oj.uz

답안 #346775

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
346775 2021-01-11T02:16:26 Z vijay 사육제 (CEOI14_carnival) Java 11
0 / 100
 241 ms 12524 KB 
import java.io.*;
import java.util.*;

public class carnival {

    public static void main(String[] args) throws IOException, FileNotFoundException {
        // BufferedReader reader = new BufferedReader(new InputStreamReader(new FileInputStream(new File("carnival.in"))));
        BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));

        int N = Integer.parseInt(reader.readLine()); 

        int[] groups = new int[N + 1];
        groups[1] = 1;

        int groupCount = 1;
        int[] groupMainPoint = new int[N + 1];

        groupMainPoint[groupCount] = 1;

        String startQuery = "1";
        int prev = 1;

        for(int i = 2; i <= N; i++){
            startQuery += " " + String.valueOf(i);
            System.out.println(i + " " + startQuery);
            System.out.flush();

            int newGroups = Integer.parseInt(reader.readLine());
            if(newGroups != prev){
                groupCount++;
                groups[i] = groupCount;
                groupMainPoint[groupCount] = i;
            } else {
                int a = 1;
                int b = groupCount;
                while(a != b){
                    int mid = (a + b) / 2;
                    // String query = "";
                    // for (int j = a; j <= mid; j++){
                    //     query += " " + groupMainPoint[j];
                    // }
                    // query += " " + i;
                    // System.out.println((mid - a + 1) + query);
                    // System.out.flush();

                    // int currGroupCount = Integer.parseInt(reader.readLine());
                    // if(currGroupCount == (mid - a + 1)){
                    //     b = mid;
                    // } else {
                    //     a = mid + 1;
                    // }
                    b = 1;
                }

                groups[i] = a;
            }

            prev = newGroups;
        }
        
        String ans = "0";
        for(int i = 1; i <= N; i++){
            ans += " " + groups[i];
        }
        System.out.println(ans);
        System.out.flush();
        return;
    }
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 237 ms 12348 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 239 ms 12260 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 12320 KB Output is correct
2 Incorrect 240 ms 12388 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 239 ms 12524 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 241 ms 12388 KB Incorrect
2 Halted 0 ms 0 KB -