# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288667 | aryan12 | Arranging Shoes (IOI19_shoes) | C++17 | 33 ms | 3200 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int count_swaps(vector<int> a) {
int left = 0, right = 1;
int ans = 0;
for(int i = 0; i < a.size(); i++) {
if(a[i] < 0) {
if(left < i) {
ans += (i - left);
}
left += 2;
}
else {
if(right < i) {
ans += (i - right);
}
right += 2;
}
}
return ans;
}
/*
int main() {
int n;
cin >> n;
vector<int> a(n * 2);
for(int i = 0; i < n * 2; i++) {
cin >> a[i];
}
cout << count_swaps(a) << endl;
}*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |