Submission #1206437

#TimeUsernameProblemLanguageResultExecution timeMemory
1206437dostsMachine (IOI24_machine)C++20
10 / 100
3 ms436 KiB
#include "machine.h" #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") //#define int long long #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() #define big(x) ((int)(x.size())) using namespace std; const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9; std::vector<int> find_permutation(int N) { if (N%2) { vi ask; for (int i = 0;i<N;i++) ask.push_back(i); vi A = use_machine(ask); int xr = 0; for (int i = 0;i<N;i++) xr^=i; for (int i = 0;i<N;i++) xr^=A[i]; vi ans(N); for (int i = 0;i<N;i++) ans[i] = A[i]^xr; return ans; } }

Compilation message (stderr)

machine.cpp: In function 'std::vector<int> find_permutation(int)':
machine.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
   29 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...