제출 #43941

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
43941		Kerim	Palembang Bridges (APIO15_bridge)	C++17	22 / 100	74 ms	17220 KiB

bridge

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
vector<int>can;
vector<PII>v;
ll f(int x){x=can[x];
	ll res=0;
	tr(it,v)
		res+=abs(it->ff-x)+abs(x-it->ss)+1;
	return res;	
}
int main(){
    //~ freopen("file.in", "r", stdin);
    int k,n;
    scanf("%d%d",&k,&n);
    if(k==1){
		ll ans=0;
		for(int i=1;i<=n;i++){
			char a,c;
			int b,d;
			scanf(" %c%d %c%d",&a,&b,&c,&d);
			can.pb(b);can.pb(d);
			if(a!=c)
				v.pb(mp(b,d));
			else
				ans+=abs(b-d);
		}
		sort(all(can));
		can.erase(unique(all(can)),can.end());
		int st=0,en=can.size()-1;
		while(st+1<en){
			int mid=(st+en)>>1;
			if(f(mid)<f(mid+1))
				en=mid;
			else
				st=mid;
		}
		printf("%lld\n",ans+min(f(st),f(en)));
		//~ tr(it,can){
			//~ ll cur=0;
			//~ tr(itt,v)
				//~ cur+=abs(itt->ff-*it)+abs(itt->ss-*it)+1;
			//~ umin(res,cur);	
		//~ }
		//~ printf("%lld\n",ans+res);
	}
	return 0;
}

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

bridge.cpp: In function 'int main()':
bridge.cpp:31:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&k,&n);
     ~~~~~^~~~~~~~~~~~~~
bridge.cpp:37:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf(" %c%d %c%d",&a,&b,&c,&d);
    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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