# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
48202 | Kmcode | Palembang Bridges (APIO15_bridge) | C++14 | 245 ms | 8372 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"
using namespace std;
int n;
int k;
vector<pair<long long int, long long int> > v;
vector<long long int> vv;
bool cmp(pair<long long int, long long int> a, pair<long long int, long long int> b) {
return a.first + a.second < b.first + b.second;
}
#define MAX 300002
long long int ans[MAX];
long long int bit[MAX];
int cnt[MAX];
void add(int i, long long int x) {
i++;
while (i < MAX) {
bit[i] += x;
cnt[i]++;
i += i&-i;
}
}
long long int sum(int i) {
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |