# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
411388 | ollel | Arranging Shoes (IOI19_shoes) | C++17 | 1083 ms | 19912 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 <bits/stdc++.h>
#include <iostream>
using namespace std;
#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll ans = 0;
int n;
vi shoes;
int f(int x, int m) {
return (x > 0) ? x : m - 1 + x;
}
void rem() {
int pairs = n/2;
rep(pair, 0, pairs) {
vi dist(pairs, 0);
rep(i,0,n) dist[shoes[i]] += i;
int bd = 1e9, p;
rep(i, 0, pairs) {
if (dist[i] < bd) {bd = dist[i]; p = i;}
}
# | 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... |