# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152576 | Myldero | Arranging Shoes (IOI19_shoes) | Java | 409 ms | 36380 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.
import java.io.*;
import java.util.*;
import java.math.*;
class shoes {
int[] s;
int n, m;
int[] positions, pairs;
boolean[] visited;
Fenwick tree;
public long count_swaps(int[] S) {
s = S;
m = s.length;
n = m / 2;
positions = new int[m];
pairs = new int[m];
visited = new boolean[m];
tree = new Fenwick(m);
for (int i = 1; i <= m; i++) {
tree.update(i, 1);
}
matchPairs();
long sum = 0;
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... |