# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
100264 | choikiwon | Segments (IZhO18_segments) | C++17 | 4698 ms | 10980 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;
typedef pair<int, int> pii;
const int MN = 200010;
const int SQ = 2000;
int Q, T, N, n;
pii seg[MN], tmp1[MN], tmp2[MN];
int chk[MN], mn[MN], mx[MN];
vector<int> add, del;
bool cmp(pii a, pii b) {
return a.second < b.second;
}
void relax() {
if(add.size() > SQ || del.size() > SQ) {
for(int i = 0; i < add.size(); i++) chk[ add[i] ] = 1;
for(int i = 0; i < del.size(); i++) chk[ del[i] ] = 0;
add.clear();
del.clear();
n = 0;
for(int i = 0; i < N; i++) if(chk[i]) {
tmp1[n] = pii(seg[i].second, seg[i].first);
tmp2[n] = pii(seg[i].second - seg[i].first, seg[i].first);
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |