Submission #1035963

#TimeUsernameProblemLanguageResultExecution timeMemory
1035963ArthuroWichArranging Shoes (IOI19_shoes)C++17
50 / 100
1096 ms4068 KiB
#include "shoes.h" #include<bits/stdc++.h> using namespace std; long long count_swaps(vector<int> s) { int n = s.size(), ans = 0; vector<int> vis(n, 0); for (int i = 0; i < n; i++) { if (vis[i]) { continue; } int co = 0, ind = -1; for (int j = i+1; j < n; j++) { if (!vis[j] && s[i] == s[j]*-1) { vis[j] = 1; ind = j; break; } if (!vis[j]) { co++; } } ans += co; if (s[ind] < 0) { 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...