# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
988221 | kachim2 | Arranging Shoes (IOI19_shoes) | C++17 | 1077 ms | 140336 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 "shoes.h"
#include <climits>
#include <stack>
#include <vector>
#include <queue>
#include <iostream>
long long count_swaps(std::vector<int> s) {
std::vector<int> pos(s.size(), INT_MIN);
std::vector<int> spos(s.size());
std::vector<int> rpos(s.size());
for (int i = 0; i < s.size(); i++) {
spos[i] = i;
}
for (int i = 0; i < s.size(); i++) {
rpos[i] = i;
}
auto qm = new std::queue<int>[100007];
auto qp = new std::queue<int> [100007];
for (int i = 0; i < s.size(); i++) {
if (s[i] < 0) {
if (qp[-s[i]].empty()) {
qm[-s[i]].push(i);
} else {
auto x = qp[-s[i]].front();
qp[-s[i]].pop();
pos[i] = x;
}
} else {
if (qm[s[i]].empty()) {
qp[s[i]].push(i);
} else {
auto x = qm[s[i]].front();
qm[s[i]].pop();
pos[i] = x;
}
}
}
long count = 0;
// for (auto i : spos) {
// std::cerr << i << ' ';
//}
for (int i = 0; i < s.size(); i++) {
if (pos[i] >= 0) {
int wp = s[spos[i]] > 0 ? spos[pos[i]] + 1 : spos[pos[i]];
//std::cerr << i << ' ' << wp << '\n';
if(spos[i]-wp == 0) continue;
count+=spos[i]-wp;
for (int j = spos[i]-1; j >= wp ; j--) {
spos[rpos[j]]++;
rpos[j + 1] = rpos[j];
}
spos[i] = wp;
rpos[wp] = i;
//for (auto i : rpos) {
//std::cerr << i << ' ';
// }
// std::cerr << '\n';
}
}
// for (auto i : spos) {
// std::cerr << i << ' ';
// }
// std::cerr << '\n';
// for (auto i : rpos) {
// // std::cerr << i << ' ';
// }
// std::cerr << '\n';
// for (auto i : pos) {
// std::cerr << i << ' ';
// }
delete[] qm;
delete[] qp;
return count;
}
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... |