# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1088529 | Sunbae | Palembang Bridges (APIO15_bridge) | C++17 | 122 ms | 8020 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>
typedef long long ll;
#define F first
#define S second
#define mp make_pair
using namespace std;
using pii = pair<int,int>;
const int N = 1e5 + 5, M = 2e5 + 5;
int sz, m, med[2][N], bit[M], cp[M];
ll BIT[M], Ans[2][N];
pii A[N];
int pos(int x){ return upper_bound(cp, cp+m, x) - cp;}
void upd(int i, int v){ for(; i<M; i+=i&-i) bit[i] += v;}
void UPD(int i, ll v){ for(; i<M; i+=i&-i) BIT[i] += v;}
int qry(int i){ int res = 0; for(; i; i-=i&-i) res += bit[i]; return res;}
ll QRY(int i){ ll res = 0; for(; i; i-=i&-i) res += BIT[i]; return res;}
int _find(int k){
int i = 0, sum = 0;
for(int j = 18; j>=0; --j){
if(i+(1<<j) < M && sum + bit[i+(1<<j)] < k) sum += bit[i+=(1<<j)];
}
return i + 1;
}
signed main(){
int k, n; scanf("%d %d", &k, &n);
ll tot = 0;
for(int i = 0, p[2]; i<n; ++i){
char c[2]; scanf(" %c %d %c %d", c, p, c+1, p+1); if(p[0] > p[1]) swap(p[0], p[1]);
if(c[0] == c[1]) tot += p[1] - p[0];
else{
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... |