Submission #257484

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
257484	2020-08-04T10:45:47 Z	BThero	Xoractive (IZhO19_xoractive)	C++17	88 / 100	187 ms	760 KB

Xoractive

// chrono::system_clock::now().time_since_epoch().count()
#include<bits/stdc++.h>
#include "interactive.h"

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << " = " << x << endl;

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;

int n;
vi arr;

void print(vi x) {
  fprintf(stderr, "%d:", x.size());
  
  for (int y : x) {
    fprintf(stderr, " %d", y);
  }
  
  fprintf(stderr, "\n");
}

int query(int x) {
  return ask(x + 1);
}

vi query(vi x) {
  for (int &y : x) {
    ++y;
  }
  
  return get_pairwise_xor(x);
}

vi subt(vi a, vi b) {
  for (int x : b) {
    a.erase(find(all(a), x));
  }
  
  return a;
}

vi getSet(vi a) {
  vi b = a;
  b.pb(n);
  a = query(a);
  b = query(b);
  b = subt(b, a);
  b.erase(find(all(b), 0));
  b.resize(unique(all(b)) - b.begin());
  
  for (int &x : b) {
    x ^= arr[n];
  }
  
  sort(all(b));
  return b;
}

vi guess(int _n) {
  n = _n;
  arr = vi(n);
  
  if (n <= 10) {
    for (int i = 0; i < n; ++i) {
      arr[i] = query(i);
    }
    
    return arr;
  }
  
  arr[n - 1] = query(n - 1);
  --n;
  
  vi A;
  
  for (int i = 0; i < n; ++i) {
    A.pb(i);
  }
  
  A = getSet(A);
  print(A);
  
  vvi S;
  S.pb(A);
  
  int k = 0;
  
  while ((1 << k) < n) { 
    ++k;
  }
  
  for (int step = (1 << k); step > 1; step /= 2) {
    A.clear();
    
    for (int j = 0; j < n; ++j) {
      if (j % step < step / 2) {
        A.pb(j);
      } 
    }
    
    A = getSet(A);
    int m = (int)S.size();
    vvi buckets(m), newS;
    
    for (int x : A) {
      for (int i = 0; i < m; ++i) {
        if (find(all(S[i]), x) != S[i].end()) {
          buckets[i].pb(x);
        }
      }
    }
    
    for (int i = 0; i < m; ++i) {
      vi A = buckets[i];
      vi B = subt(S[i], A);
      
      if (!A.empty()) {
        newS.pb(A);
      }
      
      if (!B.empty()) {
        newS.pb(B);
      }
    }
    
    S = newS;
  }
  
  assert((int)S.size() == n);
  
  for (int i = 0; i < n; ++i) {
    assert((int)S[i].size() == 1);
    arr[i] = S[i][0];
  }
  
  return arr;
}

Compilation message

Xoractive.cpp: In function 'void print(vi)':
Xoractive.cpp:24:34: warning: format '%d' expects argument of type 'int', but argument 3 has type 'std::vector<int>::size_type {aka long unsigned int}' [-Wformat=]
   fprintf(stderr, "%d:", x.size());
                          ~~~~~~~~^

Subtask #1
6.0 / 6.0

#	Verdict	Memory	Grader output
1	Correct	256 KB	Output is correct
2	Correct	256 KB	Output is correct
3	Correct	256 KB	Output is correct
4	Correct	256 KB	Output is correct

Subtask #2
82.0 / 94.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	181 ms	512 KB	Output is partially correct
2	Partially correct	160 ms	512 KB	Output is partially correct
3	Partially correct	168 ms	572 KB	Output is partially correct
4	Partially correct	172 ms	632 KB	Output is partially correct
5	Partially correct	184 ms	576 KB	Output is partially correct
6	Partially correct	161 ms	512 KB	Output is partially correct
7	Partially correct	180 ms	536 KB	Output is partially correct
8	Partially correct	160 ms	512 KB	Output is partially correct
9	Partially correct	179 ms	592 KB	Output is partially correct
10	Partially correct	165 ms	632 KB	Output is partially correct
11	Partially correct	173 ms	632 KB	Output is partially correct
12	Partially correct	153 ms	512 KB	Output is partially correct
13	Partially correct	162 ms	612 KB	Output is partially correct
14	Partially correct	174 ms	632 KB	Output is partially correct
15	Partially correct	171 ms	512 KB	Output is partially correct
16	Partially correct	177 ms	512 KB	Output is partially correct
17	Partially correct	171 ms	532 KB	Output is partially correct
18	Partially correct	153 ms	512 KB	Output is partially correct
19	Partially correct	157 ms	512 KB	Output is partially correct
20	Partially correct	171 ms	512 KB	Output is partially correct
21	Partially correct	184 ms	512 KB	Output is partially correct
22	Partially correct	178 ms	512 KB	Output is partially correct
23	Partially correct	181 ms	560 KB	Output is partially correct
24	Partially correct	185 ms	632 KB	Output is partially correct
25	Partially correct	163 ms	512 KB	Output is partially correct
26	Partially correct	159 ms	512 KB	Output is partially correct
27	Partially correct	175 ms	760 KB	Output is partially correct
28	Partially correct	169 ms	512 KB	Output is partially correct
29	Partially correct	179 ms	576 KB	Output is partially correct
30	Partially correct	160 ms	708 KB	Output is partially correct
31	Partially correct	178 ms	548 KB	Output is partially correct
32	Partially correct	173 ms	512 KB	Output is partially correct
33	Partially correct	168 ms	512 KB	Output is partially correct
34	Partially correct	169 ms	536 KB	Output is partially correct
35	Partially correct	174 ms	512 KB	Output is partially correct
36	Partially correct	159 ms	512 KB	Output is partially correct
37	Partially correct	168 ms	632 KB	Output is partially correct
38	Partially correct	159 ms	544 KB	Output is partially correct
39	Partially correct	186 ms	632 KB	Output is partially correct
40	Partially correct	172 ms	540 KB	Output is partially correct
41	Partially correct	175 ms	572 KB	Output is partially correct
42	Partially correct	172 ms	512 KB	Output is partially correct
43	Partially correct	173 ms	700 KB	Output is partially correct
44	Partially correct	166 ms	632 KB	Output is partially correct
45	Partially correct	187 ms	512 KB	Output is partially correct
46	Partially correct	156 ms	512 KB	Output is partially correct
47	Partially correct	154 ms	512 KB	Output is partially correct
48	Partially correct	157 ms	632 KB	Output is partially correct
49	Partially correct	155 ms	572 KB	Output is partially correct
50	Partially correct	163 ms	572 KB	Output is partially correct
51	Partially correct	165 ms	512 KB	Output is partially correct
52	Partially correct	154 ms	512 KB	Output is partially correct
53	Partially correct	159 ms	564 KB	Output is partially correct
54	Partially correct	176 ms	632 KB	Output is partially correct
55	Partially correct	155 ms	512 KB	Output is partially correct
56	Partially correct	176 ms	512 KB	Output is partially correct
57	Partially correct	183 ms	700 KB	Output is partially correct
58	Partially correct	159 ms	632 KB	Output is partially correct
59	Partially correct	184 ms	512 KB	Output is partially correct
60	Partially correct	167 ms	632 KB	Output is partially correct
61	Partially correct	157 ms	564 KB	Output is partially correct
62	Partially correct	175 ms	512 KB	Output is partially correct
63	Partially correct	156 ms	548 KB	Output is partially correct
64	Partially correct	168 ms	572 KB	Output is partially correct
65	Partially correct	177 ms	632 KB	Output is partially correct
66	Partially correct	152 ms	640 KB	Output is partially correct
67	Partially correct	180 ms	576 KB	Output is partially correct
68	Partially correct	162 ms	540 KB	Output is partially correct
69	Partially correct	170 ms	512 KB	Output is partially correct
70	Partially correct	171 ms	512 KB	Output is partially correct
71	Partially correct	170 ms	580 KB	Output is partially correct
72	Partially correct	162 ms	512 KB	Output is partially correct
73	Partially correct	186 ms	584 KB	Output is partially correct
74	Partially correct	151 ms	512 KB	Output is partially correct
75	Partially correct	179 ms	512 KB	Output is partially correct
76	Partially correct	180 ms	512 KB	Output is partially correct
77	Partially correct	156 ms	512 KB	Output is partially correct
78	Partially correct	161 ms	512 KB	Output is partially correct
79	Partially correct	149 ms	548 KB	Output is partially correct
80	Partially correct	158 ms	512 KB	Output is partially correct
81	Partially correct	174 ms	512 KB	Output is partially correct
82	Partially correct	163 ms	512 KB	Output is partially correct
83	Partially correct	158 ms	512 KB	Output is partially correct
84	Partially correct	170 ms	512 KB	Output is partially correct
85	Partially correct	164 ms	544 KB	Output is partially correct
86	Partially correct	184 ms	512 KB	Output is partially correct
87	Partially correct	177 ms	704 KB	Output is partially correct
88	Partially correct	167 ms	512 KB	Output is partially correct
89	Partially correct	159 ms	512 KB	Output is partially correct
90	Partially correct	152 ms	556 KB	Output is partially correct
91	Partially correct	172 ms	632 KB	Output is partially correct
92	Partially correct	157 ms	512 KB	Output is partially correct
93	Partially correct	170 ms	512 KB	Output is partially correct
94	Partially correct	165 ms	632 KB	Output is partially correct
95	Partially correct	153 ms	544 KB	Output is partially correct
96	Partially correct	153 ms	512 KB	Output is partially correct
97	Partially correct	176 ms	548 KB	Output is partially correct
98	Partially correct	160 ms	572 KB	Output is partially correct
99	Partially correct	167 ms	512 KB	Output is partially correct
100	Partially correct	171 ms	512 KB	Output is partially correct

Submission #257484

Compilation message

Subtask #1 6.0 / 6.0

Subtask #2 82.0 / 94.0

Subtask #1
6.0 / 6.0

Subtask #2
82.0 / 94.0