Submission #844031

#TimeUsernameProblemLanguageResultExecution timeMemory
844031Mr_HusanboyArranging Shoes (IOI19_shoes)C++17
45 / 100
44 ms14992 KiB
#include "shoes.h" #include <bits/stdc++.h> using namespace std; template <typename T> int len(T &a){return a.size();} #define ll long long long long count_swaps(vector<int> s){ int n = len(s) / 2; vector<vector<vector<int>>> g(2, vector<vector<int>> (n + 1)); for(int i = 2 * n - 1; i >= 0; i --){ g[s[i]<0][abs(s[i])].push_back(i); } vector<int> done(2 * n); ll ans = 0; int cur = 0; for(int i = 0; i < 2 * n; i ++){ if(done[i]){ cur --; continue; } g[s[i] < 0][abs(s[i])].pop_back(); ans += g[s[i] > 0][abs(s[i])].back() - i + (s[i] > 0) - 1 - cur; cur ++; done[g[s[i] > 0][abs(s[i])].back()] = 1; g[s[i] > 0][abs(s[i])].pop_back(); } 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...