제출 #17347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
17347		comet	Palembang Bridges (APIO15_bridge)	C++98	0 / 100	0 ms	4240 KiB

bridge

#include <cstdio>
#include <algorithm>
using namespace std;
typedef long long ll;

int K,N;
ll base;
ll a[200010],sum[200010],sz;

int main(){
	scanf("%d%d ",&K,&N);
	char tx,ty;
	ll x,y;
	for(int i=0;i<N;i++){
		scanf("%c %lld %c %lld ",&tx,&x,&ty,&y);
		if(tx==ty){
			base+=abs(x-y);
		}else{
			a[++sz]=x;
			a[++sz]=y;
			base++;
		}
	}

	sort(a+1,a+sz+1);
	a[sz+1]=-1;

	for(int i=1;i<=sz;i++){
		sum[i]=sum[i-1]+a[i];
	}

	ll ans=1e18;

	for(ll i=1;i<=sz;i++){
		x=a[i];
		ans=min(ans,sum[sz]-2ll*sum[i]+(2ll*i-sz)*x);
	}
	printf("%lld\n",ans+base);

}

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

bridge.cpp: In function 'int main()':
bridge.cpp:11:22: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d ",&K,&N);
                      ^
bridge.cpp:15:42: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%c %lld %c %lld ",&tx,&x,&ty,&y);
                                          ^

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