제출 #1322461

#제출 시각아이디문제언어결과실행 시간메모리
1322461simona1230Art Collections (BOI22_art)C++20
20 / 100
50 ms420 KiB
#include "art.h" #include <bits/stdc++.h> using namespace std; int n; vector<int> nxt[200001]; pair<int,int> cnt[200001]; void solve(int N) { vector<int> v; n=N; for(int i=1;i<=N;i++) { v.push_back(i); cnt[i]={0,i}; } for(int i=1;i<=n;i++) { for(int j=i+1;j<=n;j++) { v={i,j}; for(int k=1;k<=n;k++) { if(k==i||k==j)continue; v.push_back(k); } int inv=publish(v); swap(v[0],v[1]); if(publish(v)<inv)cnt[v[1]].first++; else cnt[v[0]].first++; } } sort(cnt+1,cnt+n+1); v.clear(); for(int i=1;i<=n;i++) v.push_back(cnt[i].second); 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...