# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
439049 | sean617 | Arranging Shoes (IOI19_shoes) | C++17 | 218 ms | 139728 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"
#define N 200005
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
ll n, t, ans = 0, pa[N], s[N];
queue<ll> qu[N];
ll f_num(int p) {
if (p < 0) return (n / 2 - p);
else return p;
}
ll f(ll p) {
ll re =0;
while (p >= 1) {
re += s[p];
p -= (p & -p);
}
return re;
}
void g(ll p) {
while (p <= n) {
s[p]++;
p += (p & -p);
# | 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... |