제출 #1344214

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1344214		tte0	Palembang Bridges (APIO15_bridge)	C++20	22 / 100	86 ms	4612 KiB

bridge

// Author: Teoman Ata Korkmaz
#include <bits/stdc++.h> 
#define int int64_t
using namespace std;
///////////////////////////////////////////////////////////
int n,k,ez;
vector<pair<int,int>> v;

inline int solve1(){
	// vector<bool> vis(n,0);
	// int last=v[0].first,ans,sum=0,cnt=2*n;
	//
	// for(auto [p,ind]:v)sum+=p-last;
	// ans=sum;
	//
	// for(auto [p,ind]:v){
	// 	cerr<<"last,ans,sum,cnt: "<<last<<" "<<ans<<" "<<sum<<" "<<cnt<<endl;
	// 	sum-=cnt*(p-last);
	// 	cnt-=2;
	// 	ans=min(ans,sum);
	// 	last=p;
	// 	cerr<<"last,ans,sum,cnt: "<<last<<" "<<ans<<" "<<sum<<" "<<cnt<<endl<<endl;
	// }

	int x=v[v.size()/2].first,ans=0;
	for(auto [p,ind]:v)ans+=abs(p-x);
	
	return ans;
}

inline int solve2(){

}

signed main(void){
	cin>>k>>n;ez+=n;
	int cnt=0;
	for(int i=0;i<n;i++){
		int x,y;
		char c,d;
		cin>>c>>x>>d>>y;
		if(c==d)ez+=abs(x-y)-1;
		else{
			v.push_back({x,cnt});
			v.push_back({y,cnt});
			cnt++;
		}
	}

	if(cnt==0){
		cout<<ez<<endl;
		return 0;
	}
	n=cnt;
	sort(v.begin(),v.end());

	if(k==1)cout<<solve1()+ez<<endl;
	else 	cout<<solve2()+ez<<endl;
}

컴파일 시 표준 에러 (stderr) 메시지

bridge.cpp: In function 'int64_t solve2()':
bridge.cpp:33:1: warning: no return statement in function returning non-void [-Wreturn-type]
   33 | }
      | ^

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