# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
154971 | Akashi | Street Lamps (APIO19_street_lamps) | C++14 | 2698 ms | 287868 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>
using namespace std;
int n, q;
char t[25], light[300005];
struct interv{
int x, y, tmp;
bool operator < (const interv &aux)const{
if(x != aux.x) return x < aux.x;
return y < aux.y;
}
};
set <interv> s;
struct node{
int val;
node *left, *right;
node(){
val = 0;
left = right = NULL;
}
};
struct data_structure{
node *bit[300005];
void update_seg(node *nod, int x, int val, int st = 1, int dr = n){
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... |