Submission #527523

#	Time	Username	Problem	Language	Result	Execution time	Memory
527523		Koosha_mv	Palembang Bridges (APIO15_bridge)	C++14	0 / 100	1 ms	460 KiB

bridge

#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll

const int N=1e5+99,inf=1e9;

int k,n,sum,ans;
vector<pair<int,int>> a,b;

bool cmp(pair<int,int> i,pair<int,int> j){
	return i.F+i.S<j.F+j.S;
}
vector<int> solve(vector<pair<int,int>> a){
	vector<int> res;
	set<pair<int,int>> st;
	int p=0,cntb=0,sumb=0,cntf=0,sumf=0;
	f(i,0,a.size()){
		//erorp(a[i]);
		if(a[i].S<=p){
			cntb++;
			sumb+=a[i].S;
		}
		else if(p<a[i].F){
			cntf++;
			sumf+=a[i].F;
			st.insert({a[i].F,1});
			st.insert({a[i].S,0});
		}
		else{
			st.insert({a[i].S,0});
		}
		while(st.size() && cntb<cntf){
			p=(*st.begin()).F;
			st.erase(*st.begin());
			if((*st.begin()).S){
				cntf--;
				sumf-=p;
			}
			else{
				cntb++;
				sumb+=p;
			}
		}
		res.pb(p*cntb-sumb+sumf-p*cntf);
		//cout<<cntb<<" "<<sumb<<" -- "<<cntf<<" "<<sumf<<endl;
		//eror(res.back());
	}
	//cout<<"END"<<endl<<endl;
	return res;
}
main(){
	ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
	cin>>k>>n;
	f(i,0,n){
		char c1,c2;
		int l,r;
		cin>>c1>>l>>c2>>r;
		if(l>r) swap(l,r);
		sum+=r-l;
		if(c1==c2) continue ;
		sum++;
		a.pb({l,r});
		b.pb({inf-r,inf-l});		
	}
	sort(all(a),cmp);
	sort(all(b),cmp);
	vector<int> A=solve(a),B=solve(b);
	ans=A.back();
	f(i,0,A.size()-1){
		minm(ans,A[i]+B[B.size()-i-2]);
	}
	if(k==1){
		cout<<A.back()+A.back()+sum;
	}
	else{
		cout<<ans+ans+sum;
	}
}
/*
1 1
A 0 B 10

2 5
B 0 A 4
B 1 B 3
A 5 B 7
B 2 A 6
B 1 A 7
*/

Compilation message (stderr)

bridge.cpp: In function 'std::vector<long long int> solve(std::vector<std::pair<long long int, long long int> >)':
bridge.cpp:8:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   36 |  f(i,0,a.size()){
      |    ~~~~~~~~~~~~                
bridge.cpp:36:2: note: in expansion of macro 'f'
   36 |  f(i,0,a.size()){
      |  ^
bridge.cpp: At global scope:
bridge.cpp:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main(){
      | ^~~~
bridge.cpp: In function 'int main()':
bridge.cpp:8:31: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    8 | #define f(i,a,b) for(int i=a;i<b;i++)
......
   88 |  f(i,0,A.size()-1){
      |    ~~~~~~~~~~~~~~              
bridge.cpp:88:2: note: in expansion of macro 'f'
   88 |  f(i,0,A.size()-1){
      |  ^

• Subtask 1: 0 / 8
• Subtask 2: 0 / 14
• Subtask 3: 0 / 9
• Subtask 4: 0 / 32
• Subtask 5: 0 / 37