Submission #475080

#TimeUsernameProblemLanguageResultExecution timeMemory
475080NhatMinh0208Intergalactic ship (IZhO19_xorsum)C++14
Compilation error
0 ms0 KiB
#ifndef CPL_TEMPLATE #define CPL_TEMPLATE /* Normie's Template v2.5 Changes: Added warning against using pragmas on USACO. */ // Standard library in one include. #include <bits/stdc++.h> using namespace std; // ordered_set library. #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> using namespace __gnu_pbds; #define ordered_set(el) tree<el,null_type,less<el>,rb_tree_tag,tree_order_statistics_node_update> // AtCoder library. (Comment out these two lines if you're not submitting in AtCoder.) (Or if you want to use it in other judges, run expander.py first.) //#include <atcoder/all> //using namespace atcoder; //Pragmas (Comment out these three lines if you're submitting in szkopul or USACO.) #pragma comment(linker, "/stack:200000000") #pragma GCC optimize("Ofast,unroll-loops,tree-vectorize") #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native") //File I/O. #define FILE_IN "cseq.inp" #define FILE_OUT "cseq.out" #define ofile freopen(FILE_IN,"r",stdin);freopen(FILE_OUT,"w",stdout) //Fast I/O. #define fio ios::sync_with_stdio(0);cin.tie(0) #define nfio cin.tie(0) #define endl "\n" //Order checking. #define ord(a,b,c) ((a>=b)and(b>=c)) //min/max redefines, so i dont have to resolve annoying compile errors. #define min(a,b) (((a)<(b))?(a):(b)) #define max(a,b) (((a)>(b))?(a):(b)) // Fast min/max assigns to use with AVX. // Requires g++ 9.2.0. template<typename T> __attribute__((always_inline)) void chkmin(T& a, const T& b) { a=(a<b)?a:b; } template<typename T> __attribute__((always_inline)) void chkmax(T& a, const T& b) { a=(a>b)?a:b; } //Constants. #define MOD (ll(998244353)) #define MAX 300001 #define mag 320 const long double PI=3.14159265358979; //Pairs and 3-pairs. #define p1 first #define p2 second.first #define p3 second.second #define fi first #define se second #define pii(element_type) pair<element_type,element_type> #define piii(element_type) pair<element_type,pii(element_type)> //Quick power of 2. #define pow2(x) (ll(1)<<x) //Short for-loops. #define ff(i,__,___) for(int i=__;i<=___;i++) #define rr(i,__,___) for(int i=__;i>=___;i--) //Typedefs. #define bi BigInt typedef long long ll; typedef long double ld; typedef short sh; // Binpow and stuff ll BOW(ll a, ll x, ll p) { if (!x) return 1; ll res=BOW(a,x/2,p); res*=res; res%=p; if (x%2) res*=a; return res%p; } ll INV(ll a, ll p) { return BOW(a,p-2,p); } //---------END-------// #endif // #include "interactive.h" map<int,int> lmao; int arr[101]; vector<int> guess(int n) { int a = ask(1); vector<int> q,aa,bb,cc; for (int i=0;i<7;i++) { q.clear(); for (int j=0;j<n;j++) if (!(j&(1<<i))) q.push_back(j+1); aa = get_pairwise_xor(q); q.erase(q.begin()); if (q.size()) bb = get_pairwise_xor(q); else bb = {}; cc.clear(); set_difference(aa.begin(),aa.end(),bb.begin(),bb.end(),back_inserter(cc)); for (int j=2;j<cc.size();j+=2) { lmao[cc[j]^a]^=(1<<i); } } for (auto g : lmao) { arr[g.se^127]=g.fi; } vector<int> r; arr[0]=a; for (int i=0;i<n;i++) r.push_back(arr[i]); return r; } // N;

Compilation message (stderr)

xorsum.cpp:23: warning: ignoring '#pragma comment ' [-Wunknown-pragmas]
   23 | #pragma comment(linker, "/stack:200000000")
      | 
xorsum.cpp: In function 'std::vector<int> guess(int)':
xorsum.cpp:105:13: error: 'ask' was not declared in this scope
  105 |     int a = ask(1);
      |             ^~~
xorsum.cpp:110:14: error: 'get_pairwise_xor' was not declared in this scope
  110 |         aa = get_pairwise_xor(q);
      |              ^~~~~~~~~~~~~~~~
xorsum.cpp:117:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |         for (int j=2;j<cc.size();j+=2) {
      |                      ~^~~~~~~~~~