| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1314631 | eldorbek_008 | Arranging Shoes (IOI19_shoes) | C++17 | 1 ms | 332 KiB |
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> s) {
int n = s.size();
map<int, set<int>> p;
long long ans = 0;
for (int i = 0; i < n; i++) {
if (p.count(-s[i])) {
int j = *p[-s[i]].begin();
p[-s[i]].erase(p[-s[i]].begin());
if (p[-s[i]].size() == 0) {
p.erase(-s[i]);
}
ans += i - j - (s[i] > 0);
} else {
p[s[i]].insert(i);
}
}
return ans;
}| # | 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... | ||||
