# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
105562 | Pro_ktmr | Examination (JOI19_examination) | C++14 | 1489 ms | 82472 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 MP make_pair
#define PB push_back
int N,Q;
vector<pair<int,int>> score;//math,info
vector<pair<int,int>> score2;//info,moto
vector<pair<pair<int,int>,pair<int,int>>> query;//info,math,sum,moto
int ans[100000];
struct RSQ{
public:
int N;
vector<int> sorted;
vector<bool> already;
vector<int> node;
void init(int n){
N = n;
for(int i=0; i<2*N-1; i++) node.PB(0);
}
void add(int x){
int k = lower_bound(sorted.begin(), sorted.end(), x) - sorted.begin();
k += N-1;
node[k]++;
while(k > 0){
k = (k-1)/2;
node[k]++;
}
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... |