Submission #1304648

#TimeUsernameProblemLanguageResultExecution timeMemory
1304648JohanArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms1960 KiB
#include "shoes.h" #include "bits/stdc++.h" using namespace std; long long count_swaps(vector < int > s){ int n = s.size(); long long cnt = 0;; for(int i = 0; i < n; i++){ if(s[i] > 0 && i % 2 == 0){ int j = i; while(j < n && s[i] != -s[j])j++; if(j == n)j--; for(int z = j; z >= i + 1; z--){ swap(s[z], s[z - 1]); cnt++; } } else if(s[i] < 0 && i % 2 == 1 || s[i] > 0 && s[i] != -s[i - 1]){ int x = s[i - 1], j = i; while(j < n && s[j] != -x)j++; if(j == n)j--; for(int z = j; z >= i + 1; z--){ swap(s[z], s[z - 1]); cnt++; } } } return cnt; }
#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...