Submission #19196616


Source Code Expand

Copy
import java.util.Scanner;
 
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        final int V = in.nextInt();
        final int E = in.nextInt();
        for (int i = 0; i < E; i++) {
            int u = in.nextInt() - 1;
            int v = in.nextInt() - 1;
            int d = in.nextInt();
        }
        final int dayType = in.nextInt();
        final int nDiv = in.nextInt();
        final int nPattern = in.nextInt();
        final int electricSupplySigma = in.nextInt();
        final double pEvent = in.nextDouble();
        final int deltaEvent = in.nextInt();
        int[][] powerPredict = new int[nPattern][nDiv];
        for (int i = 0; i < nPattern; i++) {
            for (int j = 0; j < nDiv; j++) {
                powerPredict[i][j] = in.nextInt();
            }
        }
        final int nGrid = in.nextInt();
        final int cGridInit = in.nextInt();
        final int cGridMax = in.nextInt();
        final int vGridMax = in.nextInt();
 
        final int[] x = new int[nGrid];
        final int[] pattern = new int[nGrid];
        for (int i = 0; i < nGrid; i++) {
            x[i] = in.nextInt();
            pattern[i] = in.nextInt();
        }
        final int nEv = in.nextInt();
        final int cEvInit = in.nextInt();
        final int cEvMax = in.nextInt();
        final int vEvMax = in.nextInt();
        final int deltaEvMove = in.nextInt();
        final int[] pos = new int[nEv];
        for (int i = 0; i < nEv; i++) {
            pos[i] = in.nextInt();
        }
        final double gamma = in.nextDouble();
        final int tMax = in.nextInt();
 
        for (int turn = 0; turn < tMax; turn++) {
            for (int i = 0; i < nGrid; i++) {
                final int xx = in.nextInt() - 1;
                final int yy = in.nextInt();
                final int powerActual = in.nextInt();
                final int powerExcess = in.nextInt();
                final int powerBuy = in.nextInt();
            }
            for (int i = 0; i < nEv; i++) {
                final int charge = in.nextInt();
                final int u = in.nextInt() - 1;
                final int v = in.nextInt() - 1;
                final int distFromU = in.nextInt();
                final int distFromV = in.nextInt();
            }
            for (int i = 0; i < nEv; i++) {
                System.out.println("stay");
            }
            System.out.flush();
        }
    }
}

Submission Info

Submission Time
Task A - hokudai_hitachi2020_a
User hiro116s
Language Java (OpenJDK 11.0.6)
Score 0
Code Size 2550 Byte
Status RE
Exec Time 116 ms
Memory 13872 KB

Judge Result

Set Name All
Score / Max Score 0 / 9999999999999
Status
RE × 16
Set Name Test Cases
All test_case_1, test_case_10, test_case_11, test_case_12, test_case_13, test_case_14, test_case_15, test_case_16, test_case_2, test_case_3, test_case_4, test_case_5, test_case_6, test_case_7, test_case_8, test_case_9
Case Name Status Exec Time Memory
test_case_1 RE 113 ms 4876 KB
test_case_10 RE 108 ms 4784 KB
test_case_11 RE 112 ms 4848 KB
test_case_12 RE 114 ms 4876 KB
test_case_13 RE 116 ms 4812 KB
test_case_14 RE 114 ms 4872 KB
test_case_15 RE 115 ms 4812 KB
test_case_16 RE 25 ms 13872 KB
test_case_2 RE 113 ms 4896 KB
test_case_3 RE 114 ms 4876 KB
test_case_4 RE 113 ms 4888 KB
test_case_5 RE 114 ms 4896 KB
test_case_6 RE 114 ms 4800 KB
test_case_7 RE 113 ms 4884 KB
test_case_8 RE 114 ms 4916 KB
test_case_9 RE 113 ms 4864 KB