# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152852 | junodeveloper | Robots (IOI13_robots) | C++14 | 1643 ms | 42852 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 "robots.h"
#define sz(x) ((int)x.size())
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int offset=1<<20;
int *val[2];
int sum[1000010];
int tree[2][offset<<1];
void Up(int t,int h) {
while(h>0) {
if(tree[t][h*2+1]==-1||(tree[t][h*2]!=-1&&sum[tree[t][h*2]]>sum[tree[t][h*2+1]]))
tree[t][h]=tree[t][h*2];
else tree[t][h]=tree[t][h*2+1];
h/=2;
}
}
inline void Add(int t,int p,int i) {
tree[t][p+offset]=i;
Up(t,(p+offset)/2);
}
inline void Remove(int t,int p) {
tree[t][p+offset]=-1;
Up(t,(p+offset)/2);
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... |