Submission #1247115


Source Code Expand

import java.util.*;

public class Main{
        public static void main(String[] args){
                try(Scanner sc = new Scanner(System.in)){
                        int N = sc.nextInt();
                        String[] A = new String[N+1], Z = new String[N+1];
                        String S = "";

                        for(int i = 0; i <= N; i++){
                                A[i] = Z[i] = S = sc.next();
                                A[i] = A[i].replaceAll("\\?", "a");
                                Z[i] = Z[i].replaceAll("\\?", "z");
                        }
                        Arrays.sort(A);
                        Arrays.sort(Z);
                        int start = 0, goal = 0;
                        for(int i = 0; i <= N; i++){
                                if(A[i].equals(S)){
                                        goal = i;
                                }
                        }
                        for(int i = N; i >= 0; i--){
                                if(Z[i].equals(S)){
                                        start = i;
                                }
                        }
                        System.out.println(start+" "+goal);
                        for(int i = 0; i <= N; i++){
                                System.out.println(A[i] + " " + Z[i]);
                        }
                        start++; goal++;
                        for(int i = start; i <= goal; i++){
                                if(i == goal){
                                        System.out.println(i);
                                } else {
                                        System.out.print(i+" ");
                                }
                        }
                }
        }
}

Submission Info

Submission Time
Task A - Atcoder Handles
User goryudyuma
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 1802 Byte
Status WA
Exec Time 475 ms
Memory 44448 KB

Judge Result

Set Name Subtask1 Subtask2
Score / Max Score 0 / 130 0 / 120
Status
WA × 3
WA × 6
Set Name Test Cases
Subtask1 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt
Subtask2 sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt
Case Name Status Exec Time Memory
sub1_in1.txt WA 115 ms 23252 KB
sub1_in2.txt WA 167 ms 26404 KB
sub1_in3.txt WA 183 ms 25720 KB
sub2_in1.txt WA 129 ms 22484 KB
sub2_in2.txt WA 361 ms 41980 KB
sub2_in3.txt WA 475 ms 44448 KB