# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294029 | Saboon | Werewolf (IOI18_werewolf) | C++17 | 3119 ms | 148332 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 "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 10;
const int N = 2e5 + 10;
vector<int> fex[N], fen[N];
void addinit(int x, int y){ // 0-index
x ++, y ++;
for (; x < N; x += x & -x)
fex[x].push_back(y);
}
void add(int x, int y){
x ++, y ++;
for (; x < N; x += x & -x){
int idy = lower_bound(fex[x].begin(),fex[x].end(),y)-fex[x].begin()+1;
for (; idy < fen[x].size(); idy += idy & -idy)
fen[x][idy] ++;
}
}
int get(int x, int y){
x ++, y ++;
int ret = 0;
for (; x; x -= x & -x){
int idy = upper_bound(fex[x].begin(),fex[x].end(),y)-fex[x].begin();
for (; idy; idy -= idy & -idy)
ret += fen[x][idy];
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... |