Submission #573033

#TimeUsernameProblemLanguageResultExecution timeMemory
573033sff_userArranging Shoes (IOI19_shoes)C++17
50 / 100
1094 ms1876 KiB
#include "shoes.h" #include <bits/stdc++.h> #define vi vector<int> #define ll long long using namespace std; ll count_swaps(vector<int> s) { int n = s.size()/2; ll ans = 0; int encZ = 0; for(int i = 0 ;i < 2*n ; i++){ encZ = 0; if(s[i]==0) continue; for(int j = i+1;j < 2*n ; j++){ if(s[j]==0) encZ++; if(s[j]+s[i] == 0){ if(s[i]>0){ ans+= j-i-encZ; }else { ans+=j-i-1-encZ; } s[j] = 0; break; } } } return ans; } // int main() { // cout << count_swaps({-2, 2, 2, -2, -2, 2}) << endl; // cout << count_swaps({2, 1, -1, -2}) << endl; // }
#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...