Submission #573030

#TimeUsernameProblemLanguageResultExecution timeMemory
573030sff_userArranging Shoes (IOI19_shoes)C++17
50 / 100
1088 ms1864 KiB
#include "shoes.h" #include <bits/stdc++.h> #define vi vector<int> #define ll long long using namespace std; ll count_swaps(vector<int> s) { int n = s.size()/2; ll ans = 0; for(int i = 0 ;i < 2*n ; i++){ for(int j = i+1;j < 2*n ; j++){ if(s[j]+s[i] == 0){ if(s[i]>0){ ans+= j-i; }else { ans+=j-i-1; } s.erase(s.begin()+j); break; } } } return 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...