oj.uz

답안 #236213

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
236213 2020-05-31T15:35:51 Z VEGAnn Dojave (COCI17_dojave) C++14
140 / 140
 1540 ms 85752 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define a3 array<int, 3>
#define MP make_pair
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int N = (1 << 20);
const int oo = 2e9;
map<pair<ull, int>, int> mem;
ull vl[N], ans = 0;
pair<ull, int> chk;
int m, n, a[N];

mt19937_64 rnd(chrono::system_clock().now().time_since_epoch().count());

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

#ifdef _LOCAL
    freopen("in.txt","r",stdin);
#endif // _LOCAL

    cin >> m;

    n = (1 << m);

    if (m == 1){
        cout << 2;
        return 0;
    }

    for (int i = 0; i < n; i++)
        cin >> a[i];

    for (int i = 0; i < n; i++){
        int obr = ((n - 1) ^ i);

        if (obr < i) continue;

        vl[i] = rnd();
        vl[obr] = ull(0) - vl[i];
    }

    mem[MP(0, 0)]++;

    ull sum = 0;
    int xr = 0;

    for (int i = 0; i < n; i++){
        sum += vl[a[i]];
        xr ^= a[i];

        chk = MP(sum, xr);

        ans += mem[chk];

        mem[chk]++;
    }

    cout << ull(n) * (ull(n) + 1) / 2 - ans;

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 4 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 640 KB Output is correct
2 Correct 6 ms 640 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 640 KB Output is correct
2 Correct 8 ms 896 KB Output is correct

Subtask #5
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 1516 KB Output is correct
2 Correct 10 ms 1152 KB Output is correct
3 Correct 9 ms 1024 KB Output is correct

Subtask #6
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 45 ms 5240 KB Output is correct
2 Correct 41 ms 4216 KB Output is correct
3 Correct 76 ms 7928 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 49 ms 5240 KB Output is correct
2 Correct 96 ms 8056 KB Output is correct
3 Correct 207 ms 17660 KB Output is correct

Subtask #8
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 268 ms 19832 KB Output is correct
2 Correct 208 ms 15732 KB Output is correct
3 Correct 191 ms 16120 KB Output is correct

Subtask #9
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1540 ms 78456 KB Output is correct
2 Correct 1517 ms 85624 KB Output is correct
3 Correct 735 ms 52728 KB Output is correct

Subtask #10
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1514 ms 78572 KB Output is correct
2 Correct 1216 ms 69220 KB Output is correct
3 Correct 1047 ms 72332 KB Output is correct
4 Correct 1519 ms 85752 KB Output is correct