# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108689 | shoemakerjo | Examination (JOI19_examination) | C++14 | 1149 ms | 48732 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;
const int maxn = 100010;
int n, q;
const int bil = 1000000000;
#define pii pair<int, int>
#define pp pair<int, pii>
#define mp make_pair
vector<pp> vals;
set<int> as, bs;
map<int, int> am, bm;
struct BIT {
vector<int> mvals; //going to want to merge two lists
vector<int> csum; //the sum values
int query(int num) {
//return csum >= num
//find the index of it in mvals
int indo = lower_bound(mvals.begin(), mvals.end(), num) - mvals.begin();
//maybe we should increase by 1
// indo++;
indo = mvals.size()-indo;
if (num == 100) {
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... |