# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
404925 | FatihSolak | Exercise Deadlines (CCO20_day1problem2) | C++17 | 3 ms | 1912 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 <bits/stdc++.h>
#define N 200005
#define int long long
using namespace std;
int arr[N];
int brr[N];
struct BIT{
int n;
vector<int> bit;
BIT(int l){
n = l+1;
bit.assign(n,0);
}
void upd(int pos){
for(pos++;pos<n;pos+=pos&-pos){
bit[pos]++;
}
}
int get(int pos){
int ret = 0;
for(pos++;pos>0;pos-=pos&-pos){
ret += bit[pos];
}
return ret;
}
}bt(N);
void solve(){
int n;
cin >> n;
for(int i=1;i<=n;i++){
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |