oj.uz

Submission #346771

# Submission time Handle Problem Language Result Execution time Memory
346771 2021-01-11T02:13:57 Z vijay Carnival (CEOI14_carnival) Java 11
0 / 100
 242 ms 12488 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;
            //         }
            //     }

            //     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

# Verdict Execution time Memory Grader output
1 Incorrect 234 ms 12464 KB Integer 0 violates the range [1, 11]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 238 ms 12368 KB Integer 0 violates the range [1, 5]
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 242 ms 12304 KB Integer 0 violates the range [1, 1]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 236 ms 12488 KB Integer 0 violates the range [1, 4]
2 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 241 ms 12280 KB Integer 0 violates the range [1, 2]
2 Halted 0 ms 0 KB -