# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
52439 | 2018-06-26T02:48:30 Z | tataky(#1353) | Pinball (JOI14_pinball) | C++11 | 77 ms | 64288 KB |
#include <stdio.h> #include <string.h> #include <algorithm> using namespace std; typedef long long lli; class p { public: lli L, R, to, w; }; lli d[201][201][201]; p list[200]; int n, m; lli f(int l, int r, int k) { if (list[l].L == 1 && list[r].R == m) return 0; if (k == n) return (1LL << 62); if (d[l][r][k] >= 0) return d[l][r][k]; int L = list[l].L, R = list[r].R; lli res = f(l, r, k + 1); if (L <= list[k].to && list[k].to <= R) res = min(res, f(L<list[k].L ? l : k, R>list[k].R ? r : k, k + 1) + list[k].w); return d[l][r][k] = res; } int main() { scanf("%d %d", &n, &m); if (n > 200) { puts("too hard"); return 0; } for (int i = 0; i < n; i++) scanf("%lld %lld %lld %lld", &list[i].L, &list[i].R, &list[i].to, &list[i].w); reverse(list, list + n); memset(d, -1, sizeof(d)); lli res = (1LL << 62); for (int i = 0; i < n; i++) { res = min(res, f(i, i, i + 1) + list[i].w); } if (res == (1LL << 62)) res = -1; printf("%lld\n", res); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 51 ms | 63864 KB | Output is correct |
2 | Correct | 52 ms | 64036 KB | Output is correct |
3 | Correct | 51 ms | 64036 KB | Output is correct |
4 | Correct | 48 ms | 64036 KB | Output is correct |
5 | Correct | 48 ms | 64116 KB | Output is correct |
6 | Correct | 48 ms | 64116 KB | Output is correct |
7 | Correct | 54 ms | 64116 KB | Output is correct |
8 | Correct | 52 ms | 64116 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 51 ms | 63864 KB | Output is correct |
2 | Correct | 52 ms | 64036 KB | Output is correct |
3 | Correct | 51 ms | 64036 KB | Output is correct |
4 | Correct | 48 ms | 64036 KB | Output is correct |
5 | Correct | 48 ms | 64116 KB | Output is correct |
6 | Correct | 48 ms | 64116 KB | Output is correct |
7 | Correct | 54 ms | 64116 KB | Output is correct |
8 | Correct | 52 ms | 64116 KB | Output is correct |
9 | Correct | 77 ms | 64176 KB | Output is correct |
10 | Correct | 66 ms | 64176 KB | Output is correct |
11 | Correct | 66 ms | 64288 KB | Output is correct |
12 | Correct | 60 ms | 64288 KB | Output is correct |
13 | Correct | 55 ms | 64288 KB | Output is correct |
14 | Correct | 67 ms | 64288 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 51 ms | 63864 KB | Output is correct |
2 | Correct | 52 ms | 64036 KB | Output is correct |
3 | Correct | 51 ms | 64036 KB | Output is correct |
4 | Correct | 48 ms | 64036 KB | Output is correct |
5 | Correct | 48 ms | 64116 KB | Output is correct |
6 | Correct | 48 ms | 64116 KB | Output is correct |
7 | Correct | 54 ms | 64116 KB | Output is correct |
8 | Correct | 52 ms | 64116 KB | Output is correct |
9 | Correct | 77 ms | 64176 KB | Output is correct |
10 | Correct | 66 ms | 64176 KB | Output is correct |
11 | Correct | 66 ms | 64288 KB | Output is correct |
12 | Correct | 60 ms | 64288 KB | Output is correct |
13 | Correct | 55 ms | 64288 KB | Output is correct |
14 | Correct | 67 ms | 64288 KB | Output is correct |
15 | Correct | 50 ms | 64288 KB | Output is correct |
16 | Incorrect | 2 ms | 64288 KB | Output isn't correct |
17 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 51 ms | 63864 KB | Output is correct |
2 | Correct | 52 ms | 64036 KB | Output is correct |
3 | Correct | 51 ms | 64036 KB | Output is correct |
4 | Correct | 48 ms | 64036 KB | Output is correct |
5 | Correct | 48 ms | 64116 KB | Output is correct |
6 | Correct | 48 ms | 64116 KB | Output is correct |
7 | Correct | 54 ms | 64116 KB | Output is correct |
8 | Correct | 52 ms | 64116 KB | Output is correct |
9 | Correct | 77 ms | 64176 KB | Output is correct |
10 | Correct | 66 ms | 64176 KB | Output is correct |
11 | Correct | 66 ms | 64288 KB | Output is correct |
12 | Correct | 60 ms | 64288 KB | Output is correct |
13 | Correct | 55 ms | 64288 KB | Output is correct |
14 | Correct | 67 ms | 64288 KB | Output is correct |
15 | Correct | 50 ms | 64288 KB | Output is correct |
16 | Incorrect | 2 ms | 64288 KB | Output isn't correct |
17 | Halted | 0 ms | 0 KB | - |