# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
528747 | vuhoanggiap | Segments (IZhO18_segments) | C++17 | 2613 ms | 7408 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 ii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
using namespace std;
const int maxN = 2e5 + 5, blockSz = 2000, maxCnt = (maxN + blockSz - 1) / blockSz;
int q, t, idSeg;
int l[maxN], r[maxN];
bool rem[maxN];
vector<ii> R;
int n, blockCnt;
int mnR[maxCnt], mxR[maxCnt];
vector<ii> Block[maxCnt]; // change sz
vector<ii> BlockL[maxCnt];
vector<ii> cur;
void reset() {
for (auto T : cur)
if (T.se)
rem[T.fi] = true;
R.clear(), cur.clear();
for (int i = 1; i <= idSeg; i++)
if (!rem[i])
R.pb({r[i], i});
sort(all(R));
# | 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... |