Submission #236244

#	Time	Username	Problem	Language	Result	Execution time	Memory
236244		Vimmer	Dojave (COCI17_dojave)	C++14	28 / 140	4067 ms	262148 KiB

dojave

#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 1050001
#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 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 kol[30];

vector <pair <int, int> > g[N];

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);

    int n;

    cin >> n;

    n = (1 << n);

    int a[n], pos[n];

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

    for (int i = 0; i < n; i++)
      for (int j = i + 1; j < n; j++) g[a[i] ^ a[j]].pb({a[i], a[j]});

    int ans = 0;

    for (int i = 0; i < n; i++)
    {
        int xr = 0;

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

            if (xr == n - 1 && (j - i != 0 || n - (j - i + 1) != 1)) {ans++; continue;}

            int need = (n - 1) ^ xr;

            bool good = 0;

            for (auto it : g[need])
            {
                good = (pos[it.F] < i || j < pos[it.F]) ^ (pos[it.S] < i || j < pos[it.S]);

                if (good) break;
            }

            if (good) ans++;
        }
    }
    cout << ans << endl;
}

• Subtask 1: 14 / 14
• Subtask 2: 14 / 14
• Subtask 3: 0 / 14
• Subtask 4: 0 / 14
• Subtask 5: 0 / 14
• Subtask 6: 0 / 14
• Subtask 7: 0 / 14
• Subtask 8: 0 / 14
• Subtask 9: 0 / 14
• Subtask 10: 0 / 14