Submission #10405757
Source Code Expand
import java.util.*; public class Main { private static Scanner sc = new Scanner(System.in); public static void main(String[] args) { // write your code here int n = sc.nextInt(); int[][] dp = new int[n + 1][3]; for (int i = 1; i <= n; i++) { int a = sc.nextInt(); int b = sc.nextInt(); int c = sc.nextInt(); dp[i][0] = Math.max(dp[i - 1][1], dp[i - 1][2]) + a; dp[i][1] = Math.max(dp[i - 1][0], dp[i - 1][2]) + b; dp[i][2] = Math.max(dp[i - 1][0], dp[i - 1][1]) + c; } System.out.println(Math.max(Math.max(dp[n][0], dp[n][1]), dp[n][2])); } }
Submission Info
Submission Time | |
---|---|
Task | C - Vacation |
User | giotto |
Language | Java8 (OpenJDK 1.8.0) |
Score | 100 |
Code Size | 709 Byte |
Status | AC |
Exec Time | 608 ms |
Memory | 95324 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | 0_00, 0_01, 0_02, 1_00, 1_01, 1_02, 1_03, 1_04, 1_05, 1_06, 1_07, 1_08, 1_09 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00 | AC | 96 ms | 18772 KB |
0_01 | AC | 92 ms | 22100 KB |
0_02 | AC | 94 ms | 19412 KB |
1_00 | AC | 91 ms | 21716 KB |
1_01 | AC | 589 ms | 95324 KB |
1_02 | AC | 603 ms | 91468 KB |
1_03 | AC | 582 ms | 93136 KB |
1_04 | AC | 593 ms | 94580 KB |
1_05 | AC | 608 ms | 94536 KB |
1_06 | AC | 589 ms | 91768 KB |
1_07 | AC | 560 ms | 92840 KB |
1_08 | AC | 596 ms | 94032 KB |
1_09 | AC | 606 ms | 91572 KB |