# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143774 | 2019-08-15T04:29:22 Z | jwvg0425 | Arranging Shoes (IOI19_shoes) | C++17 | 98 ms | 11384 KB |
#include "shoes.h" #include <set> long long count_swaps(std::vector<int> s) { std::set<int> minus; std::set<int> plus; std::vector<bool> used(s.size(), false); long long ans = 0; long long useCount = 0; for (int i = 0; i < s.size(); i++) { if (s[i] > 0) plus.insert(i); else minus.insert(i); } for (int i = 0; i < s.size(); i++) { if (used[i]) continue; if (s[i] > 0) { int near = *minus.lower_bound(i); minus.erase(near); used[near] = true; ans += near - i - useCount; } else { int near = *plus.lower_bound(i); plus.erase(near); used[near] = true; ans += near - i - 1 - useCount; } useCount++; } return ans; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Incorrect | 2 ms | 376 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 256 KB | Output is correct |
3 | Correct | 2 ms | 256 KB | Output is correct |
4 | Correct | 2 ms | 256 KB | Output is correct |
5 | Correct | 95 ms | 11228 KB | Output is correct |
6 | Correct | 96 ms | 11256 KB | Output is correct |
7 | Correct | 97 ms | 11256 KB | Output is correct |
8 | Correct | 93 ms | 11256 KB | Output is correct |
9 | Correct | 97 ms | 11384 KB | Output is correct |
10 | Correct | 98 ms | 11256 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Incorrect | 2 ms | 256 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |