Submission #854383

#TimeUsernameProblemLanguageResultExecution timeMemory
854383mychecksedadThe Collection Game (BOI21_swaps)C++17
0 / 100
1 ms344 KiB
// #include <swaps.h> #include <bits/stdc++.h> using namespace std; #define ll long long int #define MOD (1000000000+7) #define MOD1 (998244353) #define pb push_back #define all(x) x.begin(), x.end() #define en cout << '\n' void schedule(int, int); vector<int> visit(); void answer(std::vector<int>); vector<int> B; mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); void solve(int N, int V){ for(int i = 1; i <= N; ++i) B.pb(i); for(int i = 0; i < 1000; ++i){ if(i&1){ for(int j = 2; j <= N; j += 2) schedule(j, j + 1); }else{ for(int j = 1; j <= N; j += 2) schedule(j, j + 1); } visit(); } answer(B); }
#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...
#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...