제출 #1322376

#제출 시각아이디문제언어결과실행 시간메모리
1322376ElayV13Arranging Shoes (IOI19_shoes)C++20
10 / 100
0 ms332 KiB
#include "shoes.h" #include "bits/stdc++.h" using namespace std; #define ll long long ll count_swaps(vector<int>s) { int n=(int)s.size(); vector<bool>used(n,false); ll res=0; for(int i=0;i<n;i++) { if(s[i]<0) continue; for(int j=i;j>=0;j--) { if(used[j]) continue; if(s[i]==-s[j]) { res+=(i-j-1); used[i]=used[j]=1; break; } } } for(int i=0;i<n;i++) { if(used[i]) continue; if(s[i]>0) continue; for(int j=i;j>=0;j--) { if(used[j]) continue; if(s[i]==-s[j]) { res+=(i-j); used[i]=used[j]=1; break; } } } return res; }
#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...