# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
994191 | Sharky | Examination (JOI19_examination) | C++17 | 246 ms | 39168 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 int long long
#define pii pair<int, int>
const int N = 100001;
const int INF = 1e9;
int n, q, cntq = 0, ans[N], fen[N];
vector<array<int, 3>> v;
struct Crit {
int a, b, c, id;
bool operator < (const Crit& o) const {
return c > o.c;
}
} crit[N];
struct Query {
int ty, x, y, f, id, ti;
} qry[N << 2], tq[N << 2];
void upd(int idx, int k) {
for (; idx <= N; idx += (idx & -idx)) fen[idx] += k;
}
int query(int idx) {
int res = 0;
for (; idx; idx -= (idx & -idx)) res += fen[idx];
# | 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... |