# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1169648 | daoquanglinh2007 | Inspections (NOI23_inspections) | C++20 | 505 ms | 37776 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
const int NM = 2e5;
int n, m, q;
vector <int> upd_add[NM+5], upd_rmv[NM+5];
set <int> S;
pii qry[NM+5];
int A[NM+5], D[NM+5], cur[NM+5];
vector <int> record;
int ans[NM+5];
void update(int x, int val){
x--;
if (x < qry[1].fi) return;
int lo = 2, hi = q, res = 1;
while (lo <= hi){
int mid = (lo+hi)/2;
if (qry[mid].fi <= x){
res = mid;
lo = mid+1;
}
else hi = mid-1;
# | 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... |