| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 262013 | tiberiu | Arranging Shoes (IOI19_shoes) | C++14 | 1089 ms | 14840 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 <vector>
using namespace std;
long long count_swaps(std::vector<int> s) {
    int n = s.size() / 2;
    vector<int>* f = new vector<int>[2 * n + 1]() + n;
    for (int i = 0; i < 2 * n; i++)
        f[s[i]].push_back(i);
    vector<int> p(2 * n);
    for (int i = 1; i <= n; i++) {
        int j = 0;
        while (j < f[i].size()) {
            p[f[i][j]] = f[-i][j];
            p[f[-i][j]] = f[i][j];
            j++;
        }
    }
    long long ans = 0;
    for (int i = 0; i < 2 * n; i++) {
        if (p[i] < i)
            continue;
        if (s[p[i]] < s[i])
            ans++;
        for (int j = i + 1; j < p[i]; j++)
            ans += (p[j] > i);
    }
    return ans;
}
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... | ||||
