# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
82220 | wjoao | Deda (COCI17_deda) | C++11 | 189 ms | 19076 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>
#define ll long long
#define inf 0x3f3f3f3f
#define zero inf
#define maxn 200010
using namespace std;
struct SegmentTree{
int st[4*maxn];
// Array inicial.
int vet[maxn];
// tamanho
int tam;
int join(int a, int b){
return min(a ,b);
}
void build(int n){
tam = n;
memset(vet, inf, sizeof vet);
memset(st, inf, sizeof st);
}
int query( int i, int y ){
return query( 1, 0, tam-1, i, y );
}
int query( int p, int L, int R, int i, int y ){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |