# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
162708 | HungAnhGoldIBO2020 | Palembang Bridges (APIO15_bridge) | C++14 | 359 ms | 18368 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 int long long
using namespace std;
const int N=1e5+2;
const int inf=1e18+2;
multiset<pair<int,int> > lis;
pair<int,int> seg[N];
long long val_pre[N],ans=0,val_suf[N],sum,sum1,val;
signed main(){
ios::sync_with_stdio(0);
cin.tie(0);
int num,i,j,k,l,n,m=0,cnt=0,min1=inf;
cin>>num>>n;
char x,y;
for(i=1;i<=n;i++){
cin>>x>>j>>y>>k;
if(j>k){
swap(j,k);
}
if(x!=y){
ans++;
m++;
seg[m].first=j;
seg[m].second=k;
}
else{
ans+=k-j;
}
}
sort(seg+1,seg+1+m,[&](pair<int,int> x,pair<int,int> y){
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... |