Submission #1208117

#TimeUsernameProblemLanguageResultExecution timeMemory
1208117tapilyocaThe Collection Game (BOI21_swaps)C++20
12 / 100
45 ms416 KiB
#include "swaps.h" #include<bits/stdc++.h> using namespace std; template<typename T> using vec = vector<T>; using ll = long long; using vll = vec<ll>; void solve(int N, int V) { for(int i = 0; i < N; i++) { for(int j = 1; j <= N; j += 2) { if(j == N) break; schedule(j,j+1); } visit(); for(int j = 2; j <= N; j += 2) { if(j == N) break; schedule(j,j+1); } visit(); } vec<int> ans(N); iota(ans.begin(),ans.end(),1); answer(ans); }
#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...