oj.uz

Submission #17668

# Submission time Handle Problem Language Result Execution time Memory
17668 2016-01-10T12:02:45 Z chatterboy 막대기 (KOI13_game) C++14
0 / 100
 1000 ms 2644 KB 
#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));
	}
	return ret+L+abs(A[p].t-A[p].d);
}
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));
	printf("%lld", sol);
}

Subtask #1
0.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2644 KB Output is correct
2 Incorrect 0 ms 2644 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 2640 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 2644 KB Output is correct
2 Incorrect 10 ms 2644 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 22.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 2640 KB Program timed out
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 2640 KB Program timed out
2 Halted 0 ms 0 KB -