# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
998051 | fimh | Examination (JOI19_examination) | C++14 | 361 ms | 41120 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;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
const ll N = 2e5 + 5;
const ll blocksz = 505;
const ll mod = 1e9 + 7;
const ll inf = 1e18;
ll n, q;
ll cnt[N], ans[N];
map<ll, ll> mp;
struct Info{
ll x, y, z, id;
} a[N];
struct BIT{
ll b[N];
void upd(ll i, ll x){
for (; i <= n + q; i += i & (-i)) b[i] += x;
}
ll get(ll i){
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... |