/*
Code written by Talant I.D.
*/
#include "interactive.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define precision(n) fixed << setprecision(n)
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define mp make_pair
#define eps (double)1e-9
#define PI 2*acos(0.0)
#define endl "\n"
#define sz(v) int((v).size())
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define OK cout << "OK" << endl;
inline bool isvowel(char ch){
ch = tolower(ch);
return (ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u');
}
inline bool isprime(int n){
if(n < 2 || (n%2 == 0 && n != 2)) return false;
for(int i = 3; i*i <= n; i++)
if(n%i == 0) return false;
return true;
}
class Union{
private:
vector <int> saizu, link;
public:
Union(int n){
saizu.assign(n, 1); link.resize(n);
iota(all(link), 0);
}
int find(int n){
if(link[n] == n) return n;
return link[n] = find(link[n]);
}
int same(int a, int b){
return find(a) == find(b);
}
void unite(int a, int b){
if(same(a, b)) return;
a = find(a); b = find(b);
if(saizu[a] < saizu[b]) swap(a, b);
saizu[a] += saizu[b];
link[b] = a;
}
int getsize(int a){
return saizu[find(a)];
}
};
const int mod = 1e9+7;
ll mode(ll a){
a %= mod;
if(a < 0) a += mod;
return a;
}
ll subt(ll a, ll b){
return mode(mode(a)-mode(b));
}
ll add(ll a, ll b){
return mode(mode(a)+mode(b));
}
ll mult(ll a, ll b){
return mode(mode(a)*mode(b));
}
ll binpow(ll a, ll b){
ll res = 1;
while(b){
if(b&1) res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
map <int, vector <int>> location;
vector <int> guess(int n){
vector <int> ans(n);
ans[0] = ask(1);
set <int> st;
for(int bit = 0; bit < 7; bit++){
vector <int> pos;
for(int i = 1; i < n; i++){
if(i&(1<<bit)) pos.pb(i+1);
}
if(sz(pos)){
vector <int> tmp1 = get_pairwise_xor(pos);
pos.pb(1);
vector <int> tmp2 = get_pairwise_xor(pos);
vector <int> tmp;
map <int, int> cnt;
for(auto to : tmp1) cnt[to]++;
cnt[0]++;
for(auto to : tmp2){
if(!cnt[to]){
if(!sz(tmp) || tmp.back() != to)
tmp.pb(to);
}
else{
cnt[to]--;
}
}
for(auto &to : tmp) to ^= ans[0];
for(auto to : tmp) location[to].pb(bit);
for(auto to : tmp) st.insert(to);
}
}
for(auto to : st) {
int aa = 0;
for(auto to2 : location[to]) aa ^= (1<<to2);
ans[aa] = to;
}
return ans;
}
/*
8
3 2 1 4 8 6 7 5
*/
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
364 KB |
Output is correct |
| 2 |
Correct |
1 ms |
364 KB |
Output is correct |
| 3 |
Correct |
0 ms |
364 KB |
Output is correct |
| 4 |
Correct |
1 ms |
256 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
4 ms |
364 KB |
Output is correct |
| 2 |
Correct |
4 ms |
364 KB |
Output is correct |
| 3 |
Correct |
3 ms |
364 KB |
Output is correct |
| 4 |
Correct |
5 ms |
364 KB |
Output is correct |
| 5 |
Correct |
4 ms |
364 KB |
Output is correct |
| 6 |
Correct |
4 ms |
364 KB |
Output is correct |
| 7 |
Correct |
3 ms |
364 KB |
Output is correct |
| 8 |
Correct |
4 ms |
364 KB |
Output is correct |
| 9 |
Correct |
4 ms |
364 KB |
Output is correct |
| 10 |
Correct |
4 ms |
364 KB |
Output is correct |
| 11 |
Correct |
3 ms |
364 KB |
Output is correct |
| 12 |
Correct |
4 ms |
364 KB |
Output is correct |
| 13 |
Correct |
4 ms |
364 KB |
Output is correct |
| 14 |
Correct |
4 ms |
364 KB |
Output is correct |
| 15 |
Correct |
3 ms |
364 KB |
Output is correct |
| 16 |
Correct |
5 ms |
364 KB |
Output is correct |
| 17 |
Correct |
5 ms |
364 KB |
Output is correct |
| 18 |
Correct |
4 ms |
364 KB |
Output is correct |
| 19 |
Correct |
3 ms |
364 KB |
Output is correct |
| 20 |
Correct |
4 ms |
364 KB |
Output is correct |
| 21 |
Correct |
4 ms |
364 KB |
Output is correct |
| 22 |
Correct |
4 ms |
364 KB |
Output is correct |
| 23 |
Correct |
3 ms |
364 KB |
Output is correct |
| 24 |
Correct |
5 ms |
364 KB |
Output is correct |
| 25 |
Correct |
4 ms |
364 KB |
Output is correct |
| 26 |
Correct |
4 ms |
364 KB |
Output is correct |
| 27 |
Correct |
3 ms |
364 KB |
Output is correct |
| 28 |
Correct |
5 ms |
364 KB |
Output is correct |
| 29 |
Correct |
5 ms |
364 KB |
Output is correct |
| 30 |
Correct |
5 ms |
364 KB |
Output is correct |
| 31 |
Correct |
3 ms |
364 KB |
Output is correct |
| 32 |
Correct |
5 ms |
364 KB |
Output is correct |
| 33 |
Correct |
4 ms |
364 KB |
Output is correct |
| 34 |
Correct |
6 ms |
364 KB |
Output is correct |
| 35 |
Correct |
4 ms |
364 KB |
Output is correct |
| 36 |
Correct |
5 ms |
364 KB |
Output is correct |
| 37 |
Correct |
6 ms |
364 KB |
Output is correct |
| 38 |
Correct |
4 ms |
364 KB |
Output is correct |
| 39 |
Correct |
5 ms |
364 KB |
Output is correct |
| 40 |
Correct |
4 ms |
364 KB |
Output is correct |
| 41 |
Correct |
4 ms |
364 KB |
Output is correct |
| 42 |
Correct |
4 ms |
364 KB |
Output is correct |
| 43 |
Correct |
4 ms |
364 KB |
Output is correct |
| 44 |
Correct |
4 ms |
364 KB |
Output is correct |
| 45 |
Correct |
5 ms |
364 KB |
Output is correct |
| 46 |
Correct |
4 ms |
364 KB |
Output is correct |
| 47 |
Correct |
3 ms |
364 KB |
Output is correct |
| 48 |
Correct |
4 ms |
364 KB |
Output is correct |
| 49 |
Correct |
4 ms |
364 KB |
Output is correct |
| 50 |
Correct |
4 ms |
364 KB |
Output is correct |
| 51 |
Correct |
3 ms |
364 KB |
Output is correct |
| 52 |
Correct |
4 ms |
364 KB |
Output is correct |
| 53 |
Correct |
4 ms |
364 KB |
Output is correct |
| 54 |
Correct |
5 ms |
364 KB |
Output is correct |
| 55 |
Correct |
4 ms |
364 KB |
Output is correct |
| 56 |
Correct |
6 ms |
364 KB |
Output is correct |
| 57 |
Correct |
5 ms |
364 KB |
Output is correct |
| 58 |
Correct |
4 ms |
364 KB |
Output is correct |
| 59 |
Correct |
3 ms |
364 KB |
Output is correct |
| 60 |
Correct |
4 ms |
472 KB |
Output is correct |
| 61 |
Correct |
5 ms |
364 KB |
Output is correct |
| 62 |
Correct |
5 ms |
364 KB |
Output is correct |
| 63 |
Correct |
3 ms |
364 KB |
Output is correct |
| 64 |
Correct |
4 ms |
364 KB |
Output is correct |
| 65 |
Correct |
6 ms |
364 KB |
Output is correct |
| 66 |
Correct |
5 ms |
364 KB |
Output is correct |
| 67 |
Correct |
3 ms |
364 KB |
Output is correct |
| 68 |
Correct |
4 ms |
364 KB |
Output is correct |
| 69 |
Correct |
6 ms |
364 KB |
Output is correct |
| 70 |
Correct |
4 ms |
364 KB |
Output is correct |
| 71 |
Correct |
3 ms |
384 KB |
Output is correct |
| 72 |
Correct |
4 ms |
364 KB |
Output is correct |
| 73 |
Correct |
4 ms |
364 KB |
Output is correct |
| 74 |
Correct |
5 ms |
364 KB |
Output is correct |
| 75 |
Correct |
3 ms |
364 KB |
Output is correct |
| 76 |
Correct |
5 ms |
364 KB |
Output is correct |
| 77 |
Correct |
4 ms |
364 KB |
Output is correct |
| 78 |
Correct |
4 ms |
364 KB |
Output is correct |
| 79 |
Correct |
3 ms |
364 KB |
Output is correct |
| 80 |
Correct |
4 ms |
364 KB |
Output is correct |
| 81 |
Correct |
5 ms |
396 KB |
Output is correct |
| 82 |
Correct |
4 ms |
384 KB |
Output is correct |
| 83 |
Correct |
3 ms |
364 KB |
Output is correct |
| 84 |
Correct |
4 ms |
364 KB |
Output is correct |
| 85 |
Correct |
5 ms |
364 KB |
Output is correct |
| 86 |
Correct |
5 ms |
364 KB |
Output is correct |
| 87 |
Correct |
3 ms |
364 KB |
Output is correct |
| 88 |
Correct |
5 ms |
364 KB |
Output is correct |
| 89 |
Correct |
4 ms |
380 KB |
Output is correct |
| 90 |
Correct |
4 ms |
364 KB |
Output is correct |
| 91 |
Correct |
3 ms |
364 KB |
Output is correct |
| 92 |
Correct |
4 ms |
364 KB |
Output is correct |
| 93 |
Correct |
4 ms |
364 KB |
Output is correct |
| 94 |
Correct |
4 ms |
364 KB |
Output is correct |
| 95 |
Correct |
3 ms |
364 KB |
Output is correct |
| 96 |
Correct |
5 ms |
492 KB |
Output is correct |
| 97 |
Correct |
5 ms |
364 KB |
Output is correct |
| 98 |
Correct |
4 ms |
364 KB |
Output is correct |
| 99 |
Correct |
3 ms |
364 KB |
Output is correct |
| 100 |
Correct |
5 ms |
384 KB |
Output is correct |
