# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288747 | Saboon | Land of the Rainbow Gold (APIO17_rainbow) | C++17 | 1806 ms | 96520 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;
const int maxn = 2e5 + 10;
map<char,int> adjr = {{'N', -1}, {'S', 1}};
map<char,int> adjc = {{'E', 1}, {'W', -1}};
set<pair<int,int>> Snake;
int R, C;
pair<int,int> Snakex, Snakey;
struct Segment2D{
vector<int> fen[maxn], fex[maxn];
vector<pair<int,int>> Q;
int get(int X, int Y){
int ret = 0;
for (int x = X; x; x -= x & -x){
int y = upper_bound(fex[x].begin(),fex[x].end(),Y)-fex[x].begin();
for (; y; y -= y & -y)
ret += fen[x][y-1];
}
return ret;
}
int get(int x1, int x2, int y1, int y2){
if (x2 < x1 or y2 < y1)
return 0;
return get(x2, y2) - get(x2, y1-1) - get(x1-1, y2) + get(x1-1,y1-1);
}
void addreal(int X, int Y){
for (int x = X; x < maxn; x += x & -x){
int y = lower_bound(fex[x].begin(),fex[x].end(),Y)-fex[x].begin()+1;
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |