Submission #601762

#TimeUsernameProblemLanguageResultExecution timeMemory
601762Minindu2006Arranging Shoes (IOI19_shoes)C++14
0 / 100
1 ms304 KiB
#include "shoes.h" #include<bits/stdc++.h> using namespace std; #define ll long long long long count_swaps(std::vector<int> s) { int n = s.size() / 2; vector<int> l; for(int i=0;i<2 * n;i++) { if(s[i] < 0) l.push_back(i); } int j = 0; ll ans = 0; for(int i=0;i<2*n;i+=2) { if(s[i] != l[j]) ans += abs(l[j] - i); j++; } 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...