# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
780601 | dozer | Teams (IOI15_teams) | C++14 | 4066 ms | 328764 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;
#define pb push_back
#define st first
#define nd second
#define sp " "
#define pii pair<int, int>
#define LOGN 20
const int S = 400;
int tree[S + 5][100005];
int a[500005], b[500005], n;
void update(int bit[], int x, int val){
while(x <= n){
bit[x] += val;
int lsb = x & -x;
x += lsb;
}
}
int query(int bit[], int x){
int ans = 0;
while(x > 0){
ans += bit[x];
int lsb = x & -x;
x -= lsb;
}
return ans;
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... |