# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
225221 | Minnakhmetov | Sweeping (JOI20_sweeping) | C++14 | 990 ms | 72508 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;
#define ll long long
#define all(aaa) aaa.begin(), aaa.end()
struct Q {
int t, x, y;
};
const int N = 1e6 + 5;
vector<Q> qrs;
vector<pair<int, int>> pts;
vector<int> vy, app_time;
int t[N * 4];
void upd(int x, int y, int v, int L, int R) {
t[v] = max(t[v], y);
// cout << L << " " << R << "\n";
if (L != R) {
int m = (L + R) >> 1;
if (x <= m)
upd(x, y, v * 2, L, m);
else
upd(x, y, v * 2 + 1, m + 1, R);
}
}
int que(int x, int y, int v, int L, int R) {
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... |