# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
143474 | mat_v | Arranging Shoes (IOI19_shoes) | C++14 | 197 ms | 18040 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 <bits/stdc++.h>
#include <cstdio>
#include <cassert>
#define pb push_back
using namespace std;
int n;
vector<int> tike[100005][2];
int dokle[100005][2];
int seg[600005];
int lazy[600005];
bool bio[200005];
void init(int l, int r, int ind){
if(l == r){
seg[ind] = l;
return;
}
int mid = (l + r) / 2;
init(l, mid, ind * 2);
init(mid + 1, r, ind * 2 + 1);
seg[ind] = seg[ind * 2] + seg[ind * 2 + 1];
}
void propagate(int l, int r, int ind){
if(lazy[ind] != 0){
seg[ind] += (r - l + 1)*lazy[ind];
int mid = (l + r) / 2;
if(l < r){
lazy[ind * 2] += lazy[ind];
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... |