Submission #822738

#TimeUsernameProblemLanguageResultExecution timeMemory
822738vjudge1Arranging Shoes (IOI19_shoes)C++17
50 / 100
1093 ms3128 KiB
#include "shoes.h" #include<bits/stdc++.h> using namespace std; long long count_swaps(vector<int> s) { int n = (int)s.size(); int ans = 0; for(int st = 0; st < n; st += 2) { int pos = st + 1; while(s[pos] != -s[st]) pos++; for(int i = pos; i > st + 1; i--) swap(s[i], s[i - 1]), ans++; if(s[st] > 0) swap(s[st], s[st + 1]), ans++; } 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...