제출 #209420

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
209420	2020-03-14 07:23:47	model_code	Visiting Singapore (NOI20_visitingsingapore)	Java	100 / 100	1849 ms	30848 KiB

VisitingSingapore

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
import java.util.Scanner;
class VisitingSingapore {
  public static void main(String[] args) {
    Scanner input = new Scanner(System.in);
    int k = input.nextInt();
    int n= input.nextInt();
    int m = input.nextInt();
    long x = input.nextInt();
    long y = input.nextInt();
    x = -x;
    y = -y;
    long ans = -x-y*m;
    long val[] = new long[k + 1]; 
    for (int i = 0; i < k; i++) {
      val[i+1] = input.nextInt();
    } 
    int arr[] = new int[n + 1];
    int arr2[] = new int[m + 1];
    for (int i = 1; i <= n; i++) {
      arr[i] = input.nextInt();
    } 
    for (int i = 1; i <= m; i++) {
      arr2[i] = input.nextInt();
    }
    long dp[][][] = new long[2][m+2][4];
    long lower = -2000000000;
    for(int i=1;i<=m;i++){
    dp[0][i][0] = lower;
    dp[0][i][1] = lower;
    dp[0][i][3] = lower;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 4 / 4
• Subtask 2: 6 / 6
• Subtask 3: 12 / 12
• Subtask 4: 7 / 7
• Subtask 5: 8 / 8
• Subtask 6: 13 / 13
• Subtask 7: 50 / 50