Submission #999079

---

Source Code Expand

#include <iostream>
#include <vector>
#include <stack>
#include <string>
#include <cmath>
#include <sstream>
#include <queue>
#include <map>
#include <cstring>
#include <unordered_set>
#include <algorithm>
#include <iomanip>
using namespace std;

int winner (int* stones, int s, int l) {
    int s1, s2;
    if (l == 2) {
        s1 = stones[s];
        s2 = stones[s + 1];
    } else {
        s1 = winner(stones, s, l >> 1);
        s2 = winner(stones, s + (l >> 1), l >> 1);
    }
    if (stones[s] == stones[s + 1]) {
        return stones[s];
    } else {
        return max(s1, s2) - min(s1, s2);
    }
}

int main() {
    int N, n;
    cin >> N;
    n = pow(2, N);
    int *stones = new int[n];
    for (int i = 0; i < n; ++i) {
        cin >> stones[i];
    }
    cout << winner(stones, 0, n) << endl;
    delete [] stones;
    return 0;
}

Submission Info

Judge Result