제출 #6908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
6908		cki86201	막대기 (KOI13_game)	C++98	100 / 100	120 ms	8196 KiB

game

#include<stdio.h>
#include<algorithm>
#include<map>
using namespace std;

typedef long long ll;
#define X first
#define Y second
typedef pair<int,int> Pi;
ll ans;
Pi stick[100010];
int n, L;
map <int, ll> M;

inline int get(Pi &a){return abs(a.X - a.Y) + L;}

int main(){
	scanf("%d%d",&n,&L);
	int i;
	for(i=0;i<n;i++)scanf("%d%d",&stick[i].X,&stick[i].Y);
	sort(stick, stick+n);
	ll now = 0;
	for(i=0;i<n;i++){
		if(i == 0 || stick[i].X != stick[i-1].X){
			ans = max(ans, now);
			now = 0;
		}
		ll tmp = now + get(stick[i]), mp = M[stick[i].Y];
		now = max(now, mp + get(stick[i]));
		ans = max(ans, M[stick[i].Y] = max(mp, tmp));
	}
	printf("%lld",max(ans,now));
	return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 13 / 13
• Subtask 3: 16 / 16
• Subtask 4: 22 / 22
• Subtask 5: 38 / 38