| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 917338 |
2024-01-27T21:29:32 Z |
rainboy |
None (KOI17_travel) |
C |
|
13 ms |
816 KB |
#include <stdio.h>
#include <string.h>
#define W 100000
int max(int a, int b) { return a > b ? a : b; }
int main() {
static int dp[W + 1];
int n, w, s, x;
scanf("%d%d", &n, &w);
memset(dp, -1, (w + 1) * sizeof *dp), dp[0] = 0;
while (n--) {
int w1, v1, w2, v2;
scanf("%d%d%d%d", &w1, &v1, &w2, &v2);
for (s = w; s >= 0; s--) {
x = dp[s];
if (x == -1)
continue;
dp[s] = -1;
if (s + w1 <= w)
dp[s + w1] = max(dp[s + w1], x + v1);
if (s + w2 <= w)
dp[s + w2] = max(dp[s + w2], x + v2);
}
}
x = -1;
for (s = 0; s <= w; s++)
x = max(x, dp[s]);
printf("%d\n", x);
return 0;
}
Compilation message
travel.c: In function 'main':
travel.c:12:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
12 | scanf("%d%d", &n, &w);
| ^~~~~~~~~~~~~~~~~~~~~
travel.c:17:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
17 | scanf("%d%d%d%d", &w1, &v1, &w2, &v2);
| ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Correct |
0 ms |
348 KB |
Output is correct |
| 3 |
Correct |
1 ms |
348 KB |
Output is correct |
| 4 |
Correct |
0 ms |
348 KB |
Output is correct |
| 5 |
Correct |
0 ms |
344 KB |
Output is correct |
| 6 |
Correct |
0 ms |
348 KB |
Output is correct |
| 7 |
Correct |
0 ms |
348 KB |
Output is correct |
| 8 |
Correct |
1 ms |
348 KB |
Output is correct |
| 9 |
Correct |
0 ms |
348 KB |
Output is correct |
| 10 |
Correct |
0 ms |
348 KB |
Output is correct |
| 11 |
Correct |
0 ms |
348 KB |
Output is correct |
| 12 |
Correct |
3 ms |
604 KB |
Output is correct |
| 13 |
Correct |
7 ms |
688 KB |
Output is correct |
| 14 |
Correct |
10 ms |
604 KB |
Output is correct |
| 15 |
Correct |
13 ms |
816 KB |
Output is correct |
| 16 |
Correct |
10 ms |
812 KB |
Output is correct |
| 17 |
Correct |
11 ms |
604 KB |
Output is correct |
| 18 |
Correct |
10 ms |
604 KB |
Output is correct |
| 19 |
Correct |
10 ms |
808 KB |
Output is correct |
| 20 |
Correct |
11 ms |
688 KB |
Output is correct |
