Submission #226074

#TimeUsernameProblemLanguageResultExecution timeMemory
226074AaronNaiduArranging Shoes (IOI19_shoes)C++14
45 / 100
41 ms3324 KiB
#include <bits/stdc++.h> using namespace std; int n; long long counter = 0; long long count_swaps(vector<int> s) { n = s.size()/2; int minusPos = 0; for (int i = 0; i < 2 * n; i++) { if (s[i] < 0) { counter += abs(i - minusPos); minusPos += 2; } } return counter; }
#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...