답안 #241814

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
241814	2020-06-25T14:56:24 Z	valerikk	Xoractive (IZhO19_xoractive)	C++14	88 / 100	17 ms	896 KB

Xoractive

#include "interactive.h"
#include<bits/stdc++.h>
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define f first
#define s second
#define pb push_back
#define ins insert

#define trav(a,x) for (auto a:x)
#define F0R(i,a,b) for (int i = (a); i < (b); i++)
#define FOR(i,n) for (int i = 0; i < (n); i++)

#define rsz resize
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()

typedef vector<int> vi;
typedef pair<int, int> pi;
typedef pair<pi,vi> T;
/*
vi hid;

int ask(int i) {
    return hid[i - 1];
}

vi getPairwiseXor(vi pos) {
    vi res;
    trav(i,pos) trav(j,pos) res.pb(hid[i-1]^hid[j-1]);
    return res;
}
*/
vi getXor(vi pos) {
    /*cout << "pos: ";
    for (auto it = pos.begin(); it != pos.end(); it++) {
        if (it != pos.begin()) cout << ", ";
        cout << *it;
    }
    cout << '\n';*/
    vi POS;
    trav(x,pos) POS.pb(x+1);
    sort(all(POS));
    vi ans = get_pairwise_xor(POS);
    assert(sz(ans) == sz(pos)*sz(pos));
    map<int,int> mp;
    trav(x,ans) if (x != 0) mp[x]++;
    vi res;
    trav(x,mp) FOR(_,x.s/2) res.pb(x.f);
    return res;
}

vi getSet(int a0, vi pos) {
    if (pos.empty()) return {};
    vi POS = pos;
    POS.pb(0);
    vi ans = getXor(pos), ANS = getXor(POS);
    map<int,int> mp;
    trav(x,ans) mp[x]--; trav(x,ANS) mp[x]++;
    vi res;
    trav(x,mp) FOR(i,x.s) res.pb(x.f^a0);
    return res;
}

vi guess(int n) {
    vi a(n);
    a[0] = ask(1);
    vi pos;
    F0R(i,1,n) pos.pb(i);
    vector<T> layer={{{1,n-1},getSet(a[0],pos)}};
    while (sz(layer)) {
        /*cout << "layer: ";
        for (auto it = layer.begin(); it != layer.end(); it++) {
            if (it != layer.begin()) cout << ", ";
            cout << "[" << it->f.f << ", " << it->f.s << "]";
        }
        cout << '\n';*/
        vi POS;
        trav(x,layer) {
            if (x.f.f == x.f.s) a[x.f.f] = x.s[0]; else {
                int mi = (x.f.f+x.f.s)/2;
                F0R(i,x.f.f,mi+1) POS.pb(i);
            }
        }
        /*cout << "POS: ";
        for (auto it = POS.begin(); it != POS.end(); it++) {if (it != POS.begin()) cout << ", "; cout << *it;}
        cout << '\n';*/
        vi ANS = getSet(a[0],POS);
        /*cout << "ANS: ";
        for (auto it = ANS.begin(); it != ANS.end(); it++) {if (it != ANS.begin()) cout << ", "; cout << *it;}
        cout << '\n';*/
        set<int> ans;
        trav(x,ANS) ans.ins(x);
        vector<T> LAYER;
        trav(x,layer) {
            if (x.f.f != x.f.s) {
                int mi = (x.f.f+x.f.s)/2;
                vi lef,rig;
                trav(y,x.s) if (ans.count(y)) lef.pb(y); else rig.pb(y);
                LAYER.pb({{x.f.f, mi}, lef});
                LAYER.pb({{mi+1, x.f.s}, rig});
            }
        }
        layer = LAYER;
    }
    return a;
}
/*
int main() {
    int t;
    cin >> t;
    while (t--) {
        int n = rng()%9+2;
        hid.rsz(0);
        set<int> S;
        FOR(i,n) {
            int x = rng()%32;
            while (S.count(x)) x = rng()%32;
            S.ins(x);
            hid.pb(x);
        }
        vi ans = guess(n);
        if (ans != hid) {
            cout << "hid: ";
            for (auto it = hid.begin(); it != hid.end(); it++) {if (it != hid.begin()) cout << ", "; cout << *it;}
            cout << "\nans: ";
            for (auto it = ans.begin(); it != ans.end(); it++) {if (it != ans.begin()) cout << ", "; cout << *it;}
        }
    }
    return 0;
}
*/

Subtask #1

6.0 / 6.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
4	Correct	4 ms	256 KB	Output is correct

Subtask #2

82.0 / 94.0

#	결과	실행 시간	메모리	Grader output
1	Partially correct	14 ms	640 KB	Output is partially correct
2	Partially correct	15 ms	744 KB	Output is partially correct
3	Partially correct	9 ms	512 KB	Output is partially correct
4	Partially correct	15 ms	768 KB	Output is partially correct
5	Partially correct	15 ms	640 KB	Output is partially correct
6	Partially correct	14 ms	640 KB	Output is partially correct
7	Partially correct	9 ms	512 KB	Output is partially correct
8	Partially correct	14 ms	640 KB	Output is partially correct
9	Partially correct	15 ms	640 KB	Output is partially correct
10	Partially correct	14 ms	640 KB	Output is partially correct
11	Partially correct	9 ms	512 KB	Output is partially correct
12	Partially correct	14 ms	640 KB	Output is partially correct
13	Partially correct	14 ms	640 KB	Output is partially correct
14	Partially correct	15 ms	640 KB	Output is partially correct
15	Partially correct	10 ms	512 KB	Output is partially correct
16	Partially correct	15 ms	768 KB	Output is partially correct
17	Partially correct	15 ms	640 KB	Output is partially correct
18	Partially correct	14 ms	640 KB	Output is partially correct
19	Partially correct	10 ms	512 KB	Output is partially correct
20	Partially correct	16 ms	640 KB	Output is partially correct
21	Partially correct	16 ms	640 KB	Output is partially correct
22	Partially correct	15 ms	640 KB	Output is partially correct
23	Partially correct	9 ms	512 KB	Output is partially correct
24	Partially correct	15 ms	768 KB	Output is partially correct
25	Partially correct	14 ms	640 KB	Output is partially correct
26	Partially correct	14 ms	768 KB	Output is partially correct
27	Partially correct	9 ms	512 KB	Output is partially correct
28	Partially correct	14 ms	692 KB	Output is partially correct
29	Partially correct	15 ms	640 KB	Output is partially correct
30	Partially correct	14 ms	640 KB	Output is partially correct
31	Partially correct	9 ms	512 KB	Output is partially correct
32	Partially correct	14 ms	744 KB	Output is partially correct
33	Partially correct	15 ms	768 KB	Output is partially correct
34	Partially correct	16 ms	640 KB	Output is partially correct
35	Partially correct	9 ms	512 KB	Output is partially correct
36	Partially correct	15 ms	896 KB	Output is partially correct
37	Partially correct	15 ms	768 KB	Output is partially correct
38	Partially correct	14 ms	640 KB	Output is partially correct
39	Partially correct	10 ms	512 KB	Output is partially correct
40	Partially correct	14 ms	768 KB	Output is partially correct
41	Partially correct	15 ms	768 KB	Output is partially correct
42	Partially correct	14 ms	768 KB	Output is partially correct
43	Partially correct	9 ms	512 KB	Output is partially correct
44	Partially correct	14 ms	640 KB	Output is partially correct
45	Partially correct	15 ms	640 KB	Output is partially correct
46	Partially correct	14 ms	640 KB	Output is partially correct
47	Partially correct	9 ms	512 KB	Output is partially correct
48	Partially correct	14 ms	640 KB	Output is partially correct
49	Partially correct	14 ms	640 KB	Output is partially correct
50	Partially correct	14 ms	768 KB	Output is partially correct
51	Partially correct	9 ms	512 KB	Output is partially correct
52	Partially correct	14 ms	640 KB	Output is partially correct
53	Partially correct	14 ms	768 KB	Output is partially correct
54	Partially correct	15 ms	768 KB	Output is partially correct
55	Partially correct	9 ms	512 KB	Output is partially correct
56	Partially correct	15 ms	640 KB	Output is partially correct
57	Partially correct	15 ms	640 KB	Output is partially correct
58	Partially correct	14 ms	640 KB	Output is partially correct
59	Partially correct	9 ms	512 KB	Output is partially correct
60	Partially correct	14 ms	640 KB	Output is partially correct
61	Partially correct	15 ms	640 KB	Output is partially correct
62	Partially correct	15 ms	640 KB	Output is partially correct
63	Partially correct	9 ms	512 KB	Output is partially correct
64	Partially correct	14 ms	768 KB	Output is partially correct
65	Partially correct	15 ms	640 KB	Output is partially correct
66	Partially correct	14 ms	640 KB	Output is partially correct
67	Partially correct	9 ms	512 KB	Output is partially correct
68	Partially correct	15 ms	768 KB	Output is partially correct
69	Partially correct	15 ms	640 KB	Output is partially correct
70	Partially correct	14 ms	640 KB	Output is partially correct
71	Partially correct	9 ms	512 KB	Output is partially correct
72	Partially correct	14 ms	640 KB	Output is partially correct
73	Partially correct	14 ms	640 KB	Output is partially correct
74	Partially correct	14 ms	640 KB	Output is partially correct
75	Partially correct	10 ms	512 KB	Output is partially correct
76	Partially correct	15 ms	640 KB	Output is partially correct
77	Partially correct	14 ms	768 KB	Output is partially correct
78	Partially correct	15 ms	640 KB	Output is partially correct
79	Partially correct	9 ms	512 KB	Output is partially correct
80	Partially correct	14 ms	768 KB	Output is partially correct
81	Partially correct	15 ms	640 KB	Output is partially correct
82	Partially correct	14 ms	640 KB	Output is partially correct
83	Partially correct	9 ms	512 KB	Output is partially correct
84	Partially correct	15 ms	640 KB	Output is partially correct
85	Partially correct	14 ms	640 KB	Output is partially correct
86	Partially correct	15 ms	640 KB	Output is partially correct
87	Partially correct	9 ms	512 KB	Output is partially correct
88	Partially correct	15 ms	640 KB	Output is partially correct
89	Partially correct	15 ms	768 KB	Output is partially correct
90	Partially correct	14 ms	640 KB	Output is partially correct
91	Partially correct	9 ms	512 KB	Output is partially correct
92	Partially correct	16 ms	768 KB	Output is partially correct
93	Partially correct	14 ms	640 KB	Output is partially correct
94	Partially correct	14 ms	640 KB	Output is partially correct
95	Partially correct	9 ms	512 KB	Output is partially correct
96	Partially correct	15 ms	640 KB	Output is partially correct
97	Partially correct	14 ms	768 KB	Output is partially correct
98	Partially correct	14 ms	640 KB	Output is partially correct
99	Partially correct	9 ms	512 KB	Output is partially correct
100	Partially correct	17 ms	768 KB	Output is partially correct