Submission #1322452

#TimeUsernameProblemLanguageResultExecution timeMemory
1322452simona1230Art Collections (BOI22_art)C++20
0 / 100
0 ms332 KiB
#include "art.h" #include <bits/stdc++.h> using namespace std; int n; int p[200001]; void solve(int N) { vector<int> v; n=N; for(int i=1;i<=N;i++) { p[i]=i-1; v.push_back(i); } int inv=publish(v); for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { swap(v[p[i]],v[p[j]]); int inv2=publish(v); if(inv2<inv) { int x=p[i]; p[i]=p[j]; p[j]=x; } else swap(v[p[i]],v[p[j]]); } } answer(v); }
#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...