# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287347 | Saboon | Teams (IOI15_teams) | C++17 | 3354 ms | 104148 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 "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 10;
const int SQRT = 2000;
int n;
vector<int> fex[maxn], fen[maxn];
void addinit(int x, int y){
for (; x < maxn; x += x & -x)
fex[x].push_back(y);
}
void add(int x, int y){
for (int idx = x; idx < maxn; idx += idx & -idx){
int idy = lower_bound(fex[idx].begin(),fex[idx].end(),y)-fex[idx].begin()+1;
for (; idy <= fex[idx].size(); idy += idy & -idy)
fen[idx][idy] ++;
}
}
int get(int x, int 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... |