# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
585428 | erto | Wall (IOI14_wall) | C++17 | 154 ms | 8064 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>
typedef long long int ll;
#define INF ll(1e9 + 7)
#define INF2 998244353
#define N (ll)(1e5 + 5)
using namespace std;
//#define int ll
#define lsb(x) (x & (-x))
int n, g, h,m, q,z,t1,t2, ans=0, ans2, n2, k, n3;
int comb(int x, int y){
return max(x, y);
}
struct SegTree{
int n;
vector<int> tmax, tmin;
SegTree(int _n){
n = _n+1;
while(lsb(n) != n)
n += lsb(n);
tmax.resize(2*n, 0);
tmin.resize(2*n, INF);
}
void push(int i, int len){
if(!len)return;
# | 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... |