Submission #1175680


Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define all(v) begin(v), end(v)
#define pb(a) push_back(a)
#define fr first
#define sc second
#define INF 2000000000
#define int long long int

#define X real()
#define Y imag()
#define EPS (1e-10)
#define EQ(a,b) (abs((a) - (b)) < EPS)
#define EQV(a,b) ( EQ((a).X, (b).X) && EQ((a).Y, (b).Y) )
#define LE(n, m) ((n) < (m) + EPS)
#define LEQ(n, m) ((n) <= (m) + EPS)
#define GE(n, m) ((n) + EPS > (m))
#define GEQ(n, m) ((n) + EPS >= (m))

typedef vector<int> VI;
typedef vector<VI> MAT;
typedef pair<int, int> pii;
typedef long long ll;

typedef complex<double> P;
typedef pair<P, P> L;
typedef pair<P, double> C;

int dx[]={1, -1, 0, 0};
int dy[]={0, 0, 1, -1};
int const MOD = 1000000007;
ll mod_pow(ll x, ll n) {return (!n)?1:(mod_pow((x*x)%MOD,n/2)*((n&1)?x:1))%MOD;}
int madd(int a, int b) {return (a + b) % MOD;}
int msub(int a, int b) {return (a - b + MOD) % MOD;}
int mmul(int a, int b) {return (a * b) % MOD;}
int minv(int a) {return mod_pow(a, MOD-2);}
int mdiv(int a, int b) {return mmul(a, minv(b));}

namespace std {
    bool operator<(const P& a, const P& b) {
        return a.X != b.X ? a.X < b.X : a.Y < b.Y;
    }
}

signed main() {
    int n; cin >> n;
    vector<int> v(1 << n);
    rep(i,0,1<<n) cin >> v[i];

    rep(c,0,n) {
        for(size_t i=0; i<v.size(); i+=2) {
            if(v[i] < v[i+1]) {
                v[i+1] -= v[i];
                v[i]    =   -1;
            }
            if(v[i] > v[i+1]) {
                v[i]  -= v[i+1];
                v[i+1] = -1;
            }
        }
        v.erase(remove(v.begin(), v.end(), -1), v.end());
    }
    cout << v[0] << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Kode Festival
User tsutaj
Language C++14 (GCC 5.4.1)
Score 100
Code Size 2272 Byte
Status AC
Exec Time 107 ms
Memory 2304 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 2
AC × 23
Set Name Test Cases
Sample sample_01.txt, sample_02.txt
All sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask1_01.txt AC 1 ms 256 KB
subtask1_02.txt AC 1 ms 256 KB
subtask1_03.txt AC 1 ms 256 KB
subtask1_04.txt AC 1 ms 256 KB
subtask1_05.txt AC 8 ms 384 KB
subtask1_06.txt AC 1 ms 256 KB
subtask1_07.txt AC 15 ms 512 KB
subtask1_08.txt AC 54 ms 1280 KB
subtask1_09.txt AC 2 ms 256 KB
subtask1_10.txt AC 107 ms 2304 KB
subtask1_11.txt AC 107 ms 2304 KB
subtask1_12.txt AC 107 ms 2304 KB
subtask1_13.txt AC 107 ms 2304 KB
subtask1_14.txt AC 107 ms 2304 KB
subtask1_15.txt AC 107 ms 2304 KB
subtask1_16.txt AC 107 ms 2304 KB
subtask1_17.txt AC 107 ms 2304 KB
subtask1_18.txt AC 107 ms 2304 KB
subtask1_19.txt AC 107 ms 2304 KB