# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
471430 | CSQ31 | Land of the Rainbow Gold (APIO17_rainbow) | C++17 | 1201 ms | 124744 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 "rainbow.h"
#include <bits/stdc++.h>
using namespace std;
int r,c;
#define fi first
#define se second
#define all(a) a.begin(),a.end()
#define pb push_back
typedef pair<int,int> pii;
const int MAXN = 2e5;
struct fen{
vector<vector<int>>bit;
vector<set<int>>data;
int r,c;
fen(){}
fen(int _r,int _c){
r = _r;
c = _c;
bit.resize(r+1);
data.resize(r+1);
}
void add(int x,int y){
data[x].insert(y);
}
int query(int x,int l,int r){
int res = 0;
for(int i=x;i;i-=i&(-i)){
int p = lower_bound(all(bit[i]),l) - bit[i].begin();
int q = upper_bound(all(bit[i]),r) - bit[i].begin();
# | 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... |