Submission #835899

# Submission time Handle Problem Language Result Execution time Memory
835899 2023-08-23T22:23:49 Z hazzle Xoractive (IZhO19_xoractive) C++17
100 / 100
4 ms 464 KB
#include "interactive.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx,avx2,fma")

using namespace std;
using namespace __gnu_pbds;

#define fi first
#define se second
#define all(m) (m).begin(), (m).end()
#define rall(m) (m).rbegin(), (m).rend()
#define vec vector
#define sz(a) (int) (a).size()
#define mpp make_pair
#define mtt make_tuple

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair <ll, ll> pll;
typedef pair <int, int> pii;
typedef tuple <int, int, int> tui;

template <typename T>
using prq = priority_queue <T>;

template <typename T>
using pgq = priority_queue <T, vec <T>, greater <T>>;

template <typename T> bool umin(T &a, T b) { return a > b ? a = b, 1 : 0; }
template <typename T> bool umax(T &a, T b) { return a < b ? a = b, 1 : 0; }

const int L = 7;

vec <int> guess(int n){
      vec <int> ans(n);
      vec <vec <int>> vals(L);
      vec <int> al;
      ans[0] = ask(1);
      for (int b = 0; b < L; ++b){
            vec <int> ii;
            for (int i = 1; i < n; ++i){
                  if (i >> b & 1) ii.push_back(i + 1);
            }
            if (ii.empty()) break;
            vec <int> v1 = get_pairwise_xor(ii);
            ii.push_back(1);
            vec <int> v2 = get_pairwise_xor(ii);
            multiset <int> s(all(v2));
            for (auto &i: v1) s.erase(s.find(i));
            s.erase(s.find(0));
            vec <int> res(all(s));
            sort(all(res));
            res.erase(unique(all(res)), res.end());
            for (auto &i: res){
                  vals[b].push_back(i ^ ans[0]);
                  al.push_back(i ^ ans[0]);
            }
      }
      sort(all(al));
      al.erase(unique(all(al)), al.end());
      for (auto &i: al){
            int pos = 0;
            for (int j = 0; j < L; ++j){
                  if (count(all(vals[j]), i)) pos |= 1 << j;
            }
            ans[pos] = i;
      }
      return ans;
}

//inline int solve(){
//
//      return 0;
//}
//
//inline void precalc(){}

//signed main(){
//      ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//      int tst = 1; //cin >> tst;
//      precalc();
//      while(tst--) solve();
//      return 0;
//}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 336 KB Output is correct
2 Correct 3 ms 336 KB Output is correct
3 Correct 3 ms 336 KB Output is correct
4 Correct 3 ms 336 KB Output is correct
5 Correct 3 ms 336 KB Output is correct
6 Correct 3 ms 464 KB Output is correct
7 Correct 3 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 3 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 3 ms 336 KB Output is correct
13 Correct 3 ms 336 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Correct 3 ms 336 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 3 ms 336 KB Output is correct
18 Correct 3 ms 336 KB Output is correct
19 Correct 3 ms 444 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 4 ms 336 KB Output is correct
22 Correct 3 ms 336 KB Output is correct
23 Correct 3 ms 336 KB Output is correct
24 Correct 3 ms 448 KB Output is correct
25 Correct 3 ms 336 KB Output is correct
26 Correct 3 ms 336 KB Output is correct
27 Correct 3 ms 336 KB Output is correct
28 Correct 3 ms 336 KB Output is correct
29 Correct 3 ms 336 KB Output is correct
30 Correct 3 ms 336 KB Output is correct
31 Correct 3 ms 336 KB Output is correct
32 Correct 4 ms 336 KB Output is correct
33 Correct 3 ms 336 KB Output is correct
34 Correct 3 ms 336 KB Output is correct
35 Correct 3 ms 336 KB Output is correct
36 Correct 3 ms 336 KB Output is correct
37 Correct 3 ms 444 KB Output is correct
38 Correct 3 ms 336 KB Output is correct
39 Correct 3 ms 336 KB Output is correct
40 Correct 3 ms 388 KB Output is correct
41 Correct 3 ms 336 KB Output is correct
42 Correct 3 ms 336 KB Output is correct
43 Correct 3 ms 336 KB Output is correct
44 Correct 3 ms 336 KB Output is correct
45 Correct 3 ms 336 KB Output is correct
46 Correct 3 ms 336 KB Output is correct
47 Correct 3 ms 336 KB Output is correct
48 Correct 3 ms 336 KB Output is correct
49 Correct 3 ms 336 KB Output is correct
50 Correct 3 ms 336 KB Output is correct
51 Correct 3 ms 336 KB Output is correct
52 Correct 3 ms 336 KB Output is correct
53 Correct 3 ms 336 KB Output is correct
54 Correct 3 ms 336 KB Output is correct
55 Correct 3 ms 388 KB Output is correct
56 Correct 3 ms 336 KB Output is correct
57 Correct 3 ms 336 KB Output is correct
58 Correct 3 ms 336 KB Output is correct
59 Correct 3 ms 336 KB Output is correct
60 Correct 3 ms 336 KB Output is correct
61 Correct 3 ms 336 KB Output is correct
62 Correct 3 ms 336 KB Output is correct
63 Correct 3 ms 336 KB Output is correct
64 Correct 3 ms 336 KB Output is correct
65 Correct 3 ms 336 KB Output is correct
66 Correct 3 ms 336 KB Output is correct
67 Correct 3 ms 336 KB Output is correct
68 Correct 4 ms 464 KB Output is correct
69 Correct 4 ms 336 KB Output is correct
70 Correct 3 ms 336 KB Output is correct
71 Correct 4 ms 336 KB Output is correct
72 Correct 3 ms 336 KB Output is correct
73 Correct 3 ms 336 KB Output is correct
74 Correct 3 ms 384 KB Output is correct
75 Correct 3 ms 336 KB Output is correct
76 Correct 3 ms 336 KB Output is correct
77 Correct 3 ms 336 KB Output is correct
78 Correct 3 ms 336 KB Output is correct
79 Correct 3 ms 336 KB Output is correct
80 Correct 3 ms 336 KB Output is correct
81 Correct 3 ms 336 KB Output is correct
82 Correct 3 ms 420 KB Output is correct
83 Correct 3 ms 336 KB Output is correct
84 Correct 3 ms 444 KB Output is correct
85 Correct 3 ms 336 KB Output is correct
86 Correct 3 ms 336 KB Output is correct
87 Correct 3 ms 336 KB Output is correct
88 Correct 3 ms 336 KB Output is correct
89 Correct 3 ms 336 KB Output is correct
90 Correct 3 ms 336 KB Output is correct
91 Correct 3 ms 336 KB Output is correct
92 Correct 3 ms 336 KB Output is correct
93 Correct 3 ms 336 KB Output is correct
94 Correct 3 ms 336 KB Output is correct
95 Correct 3 ms 460 KB Output is correct
96 Correct 3 ms 336 KB Output is correct
97 Correct 3 ms 336 KB Output is correct
98 Correct 3 ms 336 KB Output is correct
99 Correct 3 ms 336 KB Output is correct
100 Correct 3 ms 336 KB Output is correct