oj.uz

Submission #236587

# Submission time Handle Problem Language Result Execution time Memory
236587 2020-06-02T14:15:09 Z Vimmer Dojave (COCI17_dojave) C++14
140 / 140
 1208 ms 186320 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 1005000
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <int, 2> a2;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;



int mk[N];

ull val[N], ans = 0;

unordered_map <ull, unordered_map <int, int> > mp;

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    srand(time(0));

    ll n;

    cin >> n;

    if (n == 1) {cout << 2 << endl; exit(0);}

    n = (1 << n);

    ll a[n];

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

    for (ll i = 0; i < n; i++)
    {
        ll vl = (n - 1) ^ i;

        if (vl < i) continue;

        val[i] = rand();

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

    mp[0][0]++;

    ull sum = 0;

    int xr = 0;

    for (ll i = 0; i < n; i++)
    {
        sum += val[a[i]];

        xr ^= a[i];

        ans += mp[sum][xr];

        mp[sum][xr]++;
    }
    cout << (ull(n) * ull(n + 1)) / ull(2) - ans << endl;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 768 KB Output is correct
2 Correct 6 ms 1024 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 1152 KB Output is correct
2 Correct 9 ms 1664 KB Output is correct

Subtask #5
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3200 KB Output is correct
2 Correct 10 ms 2048 KB Output is correct
3 Correct 10 ms 1920 KB Output is correct

Subtask #6
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 11400 KB Output is correct
2 Correct 35 ms 6952 KB Output is correct
3 Correct 71 ms 15624 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 11400 KB Output is correct
2 Correct 69 ms 13448 KB Output is correct
3 Correct 193 ms 36288 KB Output is correct

Subtask #8
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 44932 KB Output is correct
2 Correct 162 ms 26680 KB Output is correct
3 Correct 178 ms 32440 KB Output is correct

Subtask #9
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1208 ms 179044 KB Output is correct
2 Correct 1170 ms 179164 KB Output is correct
3 Correct 601 ms 97768 KB Output is correct

Subtask #10
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1199 ms 179060 KB Output is correct
2 Correct 771 ms 105964 KB Output is correct
3 Correct 773 ms 132296 KB Output is correct
4 Correct 1190 ms 186320 KB Output is correct