#include <bits/stdc++.h>
#include "interactive.h"
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b){a = b; return true;}
return false;
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b){a = b; return true;}
return false;
}
template <class T>
void printArr(T& a, string separator = " ", string finish = "\n"){
for(auto i: a) cout << i << separator;
cout << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
// int n;
// vector<int> a;
// int ask(int i){
// return a[i-1];
// }
// vector<int> get_pairwise_xor(vector<int> S){
// vector<int> ans;
// for(int i: S) for(int j: S) ans.push_back(a[i-1] ^ a[j-1]);
// sort(ALL(ans));
// return ans;
// }
vector<int> guess(int n) {
map<int, int> mp;
vector <int> ans(n);
ans[0] = ask(1);
for(int j = 0; j < 7; ++j){
vector<int> sigma;
for(int i = 0; i<n; ++i){
if (!GETBIT(i, j)) sigma.push_back(i + 1);
}
vector<int> S1 = get_pairwise_xor(sigma);
sigma.erase(sigma.begin());
vector<int> S2 = get_pairwise_xor(sigma);
multiset<int> S(ALL(S1));
for(int i: S2){
S.erase(S.find(i));
}
set<int> vcl;
for(int i: S) if (i) vcl.insert(i);
for(int i: vcl) if (i) mp[i] += MASK(j);
}
for(pair<int, int> i: mp){
ans[MASK(7) - 1 - i.second] = ans[0] ^ i.first;
}
return ans;
}
// int main(void){
// ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// cin >> n;
// a.resize(n);
// for(int i= 0; i<n; ++i) cin >> a[i];
// if (guess(n) == a) cout << "AC\n";
// else cout << "WA\n";
// return 0;
// }
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
344 KB |
Output is correct |
| 3 |
Correct |
0 ms |
344 KB |
Output is correct |
| 4 |
Correct |
0 ms |
344 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
4 ms |
600 KB |
Output is correct |
| 2 |
Correct |
4 ms |
600 KB |
Output is correct |
| 3 |
Correct |
4 ms |
600 KB |
Output is correct |
| 4 |
Correct |
6 ms |
600 KB |
Output is correct |
| 5 |
Correct |
4 ms |
600 KB |
Output is correct |
| 6 |
Correct |
4 ms |
760 KB |
Output is correct |
| 7 |
Correct |
4 ms |
600 KB |
Output is correct |
| 8 |
Correct |
4 ms |
596 KB |
Output is correct |
| 9 |
Correct |
4 ms |
600 KB |
Output is correct |
| 10 |
Correct |
4 ms |
600 KB |
Output is correct |
| 11 |
Correct |
4 ms |
600 KB |
Output is correct |
| 12 |
Correct |
5 ms |
600 KB |
Output is correct |
| 13 |
Correct |
4 ms |
600 KB |
Output is correct |
| 14 |
Correct |
4 ms |
852 KB |
Output is correct |
| 15 |
Correct |
4 ms |
600 KB |
Output is correct |
| 16 |
Correct |
4 ms |
600 KB |
Output is correct |
| 17 |
Correct |
4 ms |
592 KB |
Output is correct |
| 18 |
Correct |
4 ms |
600 KB |
Output is correct |
| 19 |
Correct |
4 ms |
660 KB |
Output is correct |
| 20 |
Correct |
4 ms |
852 KB |
Output is correct |
| 21 |
Correct |
4 ms |
796 KB |
Output is correct |
| 22 |
Correct |
4 ms |
600 KB |
Output is correct |
| 23 |
Correct |
4 ms |
600 KB |
Output is correct |
| 24 |
Correct |
4 ms |
600 KB |
Output is correct |
| 25 |
Correct |
4 ms |
600 KB |
Output is correct |
| 26 |
Correct |
4 ms |
600 KB |
Output is correct |
| 27 |
Correct |
4 ms |
600 KB |
Output is correct |
| 28 |
Correct |
5 ms |
596 KB |
Output is correct |
| 29 |
Correct |
6 ms |
600 KB |
Output is correct |
| 30 |
Correct |
4 ms |
600 KB |
Output is correct |
| 31 |
Correct |
4 ms |
600 KB |
Output is correct |
| 32 |
Correct |
4 ms |
600 KB |
Output is correct |
| 33 |
Correct |
4 ms |
600 KB |
Output is correct |
| 34 |
Correct |
4 ms |
600 KB |
Output is correct |
| 35 |
Correct |
4 ms |
600 KB |
Output is correct |
| 36 |
Correct |
5 ms |
592 KB |
Output is correct |
| 37 |
Correct |
4 ms |
600 KB |
Output is correct |
| 38 |
Correct |
4 ms |
600 KB |
Output is correct |
| 39 |
Correct |
4 ms |
600 KB |
Output is correct |
| 40 |
Correct |
4 ms |
600 KB |
Output is correct |
| 41 |
Correct |
4 ms |
580 KB |
Output is correct |
| 42 |
Correct |
4 ms |
600 KB |
Output is correct |
| 43 |
Correct |
4 ms |
600 KB |
Output is correct |
| 44 |
Correct |
4 ms |
600 KB |
Output is correct |
| 45 |
Correct |
5 ms |
600 KB |
Output is correct |
| 46 |
Correct |
4 ms |
600 KB |
Output is correct |
| 47 |
Correct |
4 ms |
600 KB |
Output is correct |
| 48 |
Correct |
4 ms |
600 KB |
Output is correct |
| 49 |
Correct |
4 ms |
600 KB |
Output is correct |
| 50 |
Correct |
4 ms |
596 KB |
Output is correct |
| 51 |
Correct |
4 ms |
600 KB |
Output is correct |
| 52 |
Correct |
4 ms |
852 KB |
Output is correct |
| 53 |
Correct |
4 ms |
476 KB |
Output is correct |
| 54 |
Correct |
4 ms |
600 KB |
Output is correct |
| 55 |
Correct |
4 ms |
600 KB |
Output is correct |
| 56 |
Correct |
5 ms |
600 KB |
Output is correct |
| 57 |
Correct |
5 ms |
600 KB |
Output is correct |
| 58 |
Correct |
4 ms |
600 KB |
Output is correct |
| 59 |
Correct |
5 ms |
600 KB |
Output is correct |
| 60 |
Correct |
4 ms |
600 KB |
Output is correct |
| 61 |
Correct |
5 ms |
600 KB |
Output is correct |
| 62 |
Correct |
4 ms |
600 KB |
Output is correct |
| 63 |
Correct |
4 ms |
600 KB |
Output is correct |
| 64 |
Correct |
4 ms |
600 KB |
Output is correct |
| 65 |
Correct |
4 ms |
672 KB |
Output is correct |
| 66 |
Correct |
4 ms |
600 KB |
Output is correct |
| 67 |
Correct |
4 ms |
596 KB |
Output is correct |
| 68 |
Correct |
4 ms |
600 KB |
Output is correct |
| 69 |
Correct |
5 ms |
600 KB |
Output is correct |
| 70 |
Correct |
4 ms |
600 KB |
Output is correct |
| 71 |
Correct |
5 ms |
600 KB |
Output is correct |
| 72 |
Correct |
4 ms |
852 KB |
Output is correct |
| 73 |
Correct |
6 ms |
760 KB |
Output is correct |
| 74 |
Correct |
4 ms |
600 KB |
Output is correct |
| 75 |
Correct |
4 ms |
600 KB |
Output is correct |
| 76 |
Correct |
4 ms |
600 KB |
Output is correct |
| 77 |
Correct |
4 ms |
600 KB |
Output is correct |
| 78 |
Correct |
4 ms |
600 KB |
Output is correct |
| 79 |
Correct |
3 ms |
600 KB |
Output is correct |
| 80 |
Correct |
4 ms |
600 KB |
Output is correct |
| 81 |
Correct |
4 ms |
600 KB |
Output is correct |
| 82 |
Correct |
4 ms |
600 KB |
Output is correct |
| 83 |
Correct |
4 ms |
668 KB |
Output is correct |
| 84 |
Correct |
6 ms |
588 KB |
Output is correct |
| 85 |
Correct |
4 ms |
600 KB |
Output is correct |
| 86 |
Correct |
4 ms |
580 KB |
Output is correct |
| 87 |
Correct |
4 ms |
600 KB |
Output is correct |
| 88 |
Correct |
4 ms |
600 KB |
Output is correct |
| 89 |
Correct |
4 ms |
600 KB |
Output is correct |
| 90 |
Correct |
4 ms |
600 KB |
Output is correct |
| 91 |
Correct |
5 ms |
588 KB |
Output is correct |
| 92 |
Correct |
5 ms |
600 KB |
Output is correct |
| 93 |
Correct |
6 ms |
600 KB |
Output is correct |
| 94 |
Correct |
4 ms |
600 KB |
Output is correct |
| 95 |
Correct |
4 ms |
600 KB |
Output is correct |
| 96 |
Correct |
4 ms |
600 KB |
Output is correct |
| 97 |
Correct |
4 ms |
600 KB |
Output is correct |
| 98 |
Correct |
4 ms |
600 KB |
Output is correct |
| 99 |
Correct |
5 ms |
600 KB |
Output is correct |
| 100 |
Correct |
4 ms |
600 KB |
Output is correct |
