Submission #17669

#	Time	Username	Problem	Language	Result	Execution time	Memory
17669		chatterboy	막대기 (KOI13_game)	C++14	0 / 100	1000 ms	2644 KiB

game

#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
#define MAXN 100001
typedef long long ll;
struct Stick {
	ll t, d;
};
int N;
ll L;
Stick A[MAXN];
ll solve(int p) {
	ll ret = 0;
	for (int pp=1; pp<=N; ++pp) if (p != pp) {
		if ((A[pp].t==A[p].t && A[pp].d>A[p].d) || (A[pp].d==A[p].d && A[pp].t>A[p].t))
			ret = max(ret, solve(pp)+L+abs(A[pp].t-A[pp].d));
	}
	return ret;
}
int main() {
	scanf("%d%lld", &N, &L);
	for (int i=1; i<=N; ++i) scanf("%lld%lld", &A[i].t, &A[i].d);
	ll sol = 0;
	for (int i=1; i<=N; ++i)
		sol = max(sol, solve(i)+L+abs(A[i].t-A[i].d));
	printf("%lld", sol);
}

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