Submission #527858

#TimeUsernameProblemLanguageResultExecution timeMemory
527858definitelynotmeeXoractive (IZhO19_xoractive)C++17
100 / 100
3 ms344 KiB
#include<bits/stdc++.h> #define mp make_pair #define mt make_tuple #define all(x) x.begin(), x.end() #define ff first #define ss second using namespace std; template <typename T> using matrix = vector<vector<T>>; typedef unsigned int uint; typedef unsigned long long ull; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; const ll INFL = (1LL<<62)-1; const int INF = (1<<30)-1; const double EPS = 1e-7; const int MOD = 1e9 + 7; const int RANDOM = chrono::high_resolution_clock::now().time_since_epoch().count(); const int MAXN = 1e6+1; //#include "interactive.h" int ask(int i); vector<int> get_pairwise_xor(vector<int> q); vector<int> guess(int n) { int last = ask(n); auto getset =[&](vector<int> q)->vector<int>{ q.push_back(n); vector<int> tot = get_pairwise_xor(q); q.pop_back(); vector<int> totminus = get_pairwise_xor(q); vector<int> v(q.size()); int p1 = 0, p2 = 0; int ptr = 0; while(p1 < tot.size()){ if(p2 == totminus.size() || totminus[p2] != tot[p1]){ if(tot[p1] != 0){ v[ptr] = tot[p1]^last; ptr++; p1++; } } else p2++; p1++; } assert(ptr == q.size()); return v; }; vector<int> q(n-1); iota(all(q),1); q.push_back(n); matrix<int> group = {q}; map<int,int> m; int timer = 20; while(group.size() < n){ matrix<int> newgroup; vector<int> q; for(vector<int>& i : group){ vector<int> g1, g2; for(int j = 0; j < i.size()/2; j++) q.push_back(i[j]), g1.push_back(i[j]); for(int j = i.size()/2; j < i.size(); j++) g2.push_back(i[j]); if(g1.size()) newgroup.push_back(g1); if(g2.size()) newgroup.push_back(g2); } vector<int> r = getset(q); for(int i : r) m[i] |= (1<<timer); swap(group,newgroup); timer--; } vector<int> resp; for(pii i : m) resp.push_back(i.ff); resp.push_back(last); sort(all(resp),[&](int a, int b){ return m[a] > m[b]; }); return resp; }

Compilation message (stderr)

Xoractive.cpp: In lambda function:
Xoractive.cpp:40:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |           while(p1 < tot.size()){
      |                 ~~~^~~~~~~~~~~~
Xoractive.cpp:41:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             if(p2 == totminus.size() || totminus[p2] != tot[p1]){
      |                ~~~^~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Xoractive.cpp:1:
Xoractive.cpp:52:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |           assert(ptr == q.size());
      |                  ~~~~^~~~~~~~~~~
Xoractive.cpp: In function 'std::vector<int> guess(int)':
Xoractive.cpp:63:28: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<int>, std::allocator<std::vector<int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   63 |         while(group.size() < n){
      |               ~~~~~~~~~~~~~^~~
Xoractive.cpp:68:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for(int j = 0; j < i.size()/2; j++)
      |                            ~~^~~~~~~~~~~~
Xoractive.cpp:70:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   70 |             for(int j = i.size()/2; j < i.size(); j++)
      |                                     ~~^~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...