# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158693 | alexander707070 | Monochrome Points (JOI20_monochrome) | C++20 | 913 ms | 6704 KiB |
#include<bits/stdc++.h>
#define MAXN 400007
using namespace std;
int n,br[MAXN],pref[MAXN];
char c[MAXN];
vector<int> B,W;
vector< pair<int,int> > pairs;
long long ans;
struct Fenwick{
int fen[MAXN];
void update(int x,int val){
while(x<=2*n){
fen[x]+=val;
x+=(x & (-x));
}
}
int getsum(int x){
int res=0;
while(x>=1){
res+=fen[x];
x^=(x & (-x));
}
return res;
}
# | 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... |