# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
418890 | FlippenFaz | Arranging Shoes (IOI19_shoes) | C++14 | 1087 ms | 84336 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;
typedef long long ll;
map<int, queue<int>> shoesList;
ll count_swaps(vector<int> s) {
ll sum = 0;
ll offset = 0;
for (ll i = 0; i < s.size(); i++) {
ll pos = 0;
if (s[i] > 0) {pos = i;}
else {pos = i+1;}
cerr << "I: " << i << " SHOE: " << s[i] << endl;
cerr << "SIZE: " << shoesList[-s[i]].size() << "POS OF INVERSE:" << shoesList[-s[i]].front() << endl;
if (shoesList[-s[i]].size() == 0) {
shoesList[s[i]].push(pos+offset);
} else {
sum += (i - shoesList[-s[i]].front()) - offset;
offset++;
shoesList[-s[i]].pop();
}
}
return sum;
}
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... |