Submission #854368

#TimeUsernameProblemLanguageResultExecution timeMemory
854368mychecksedadThe 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; void solv(int l, int r){ stable_sort(B.begin() + l - 1, B.begin() + r, [&](const int &x, const int &y){ schedule(x, y); vector<int> f = visit(); return !f[0]; }); } void solve(int N, int V){ for(int i = 1; i <= N; ++i) B.pb(i); solv(1, N); 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...