Submission #169920

#TimeUsernameProblemLanguageResultExecution timeMemory
169920whtttArranging Shoes (IOI19_shoes)C++14
50 / 100
1070 ms3192 KiB
#include <vector> #include <iostream> #include <algorithm> #define ll long long using namespace std; ll count_swaps(vector<int> S){ ll sol = 0; while(1){ if(S.size() == 0){ break; } for(ll i = 1;;i++){ if(S[i] == -S[0]){ sol += i; if(S[0] < 0){ sol--; } S.erase(S.begin()+i); S.erase(S.begin()); break; } } } return sol; }
#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...