# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
93892 | dalgerok | Segments (IZhO18_segments) | C++14 | 5004 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>
using namespace std;
const int N = 2e5 + 5, S = 500, M = N / S + 5;
int n, t, ans;
int sz, alive, L[N], R[N];
pair < int, int > a[N];
int add[S], sz_add, del[S], sz_del;
bool killed[N];
int sz_l[S], sz_r[S];
int b_l[S][S], b_r[S][S];
int m;
inline void rebuild(){
m = 0;
for(int i = 1; i <= sz; i++){
if(killed[i] == false){
a[m++] = make_pair(R[i] - L[i] + 1, i);
}
}
sort(a, a + m);
sz_add = sz_del = 0;
for(int i = 0; i <= m / S; i++){
sz_l[i] = sz_r[i] = 0;
}
# | 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... |