# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
418235 | Josia | Arranging Shoes (IOI19_shoes) | C++14 | 1089 ms | 3140 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>
#include "shoes.h"
using namespace std;
long long count_swaps(std::vector<int> s) {
vector<bool> present(s.size(), 1);
int res = 0;
for (int i = 0; i<s.size(); i++) {
if (!present[i]) continue;
int price = 0;
for (int j = i+1; j<s.size(); j++) {
if (!present[j]) continue;
price++;
if (s[j] == -s[i]) {present[j] = 0; break;}
}
if (s[i] < 0) price--;
res += price;
// cout << price << "\n";
present[i] = 0;
}
return res;
}
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... |