oj.uz

답안 #1077053

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1077053 2024-08-26T21:57:04 Z mariaclara 드문 곤충 (IOI22_insects) C++17
10 / 100
 269 ms 512 KB 
#include "insects.h"
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second

int rand(int a, int b) {
    return rand()%(b-a+1) + a;
}

int min_cardinality(int N) {
    vector<int> in(N);
    int colors = 0;

    srand(381723);

    for(int i = 0; i < N; i++) {
        move_inside(i);
        in[i] = 1;
        if(press_button() == 2) move_outside(i), in[i] = 0; 
        else colors++;
    }

    if(colors == 1) return N;

    int l = 1, r = N/colors;
    while(l <= r) {
        int mid = l, qtd = 0;
        if(r == 1) return 1;

        for(int i = 0; i < N; i++) {
            if(in[i]) {qtd++; continue;}
            in[i] = 1;
            move_inside(i);
            if(press_button() > mid) move_outside(i), in[i] = 0;
            else qtd++;
        }

        if(qtd == colors*mid) l = mid+1;
        else {
            r = mid-1;
            for(int i = 0; i < N; i++) if(in[i]) move_outside(i), in[i] = 0;
        }
    }
    
    return l-1;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 27 ms 344 KB Output is correct
15 Correct 17 ms 344 KB Output is correct
16 Correct 13 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 2 ms 344 KB Output is correct
8 Correct 9 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 27 ms 344 KB Output is correct
15 Correct 17 ms 344 KB Output is correct
16 Correct 13 ms 344 KB Output is correct
17 Correct 7 ms 344 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Correct 7 ms 344 KB Output is correct
20 Correct 3 ms 344 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Correct 2 ms 344 KB Output is correct
23 Correct 4 ms 344 KB Output is correct
24 Correct 5 ms 344 KB Output is correct
25 Correct 100 ms 344 KB Output is correct
26 Correct 79 ms 344 KB Output is correct
27 Correct 9 ms 512 KB Output is correct
28 Correct 7 ms 344 KB Output is correct
29 Correct 18 ms 344 KB Output is correct
30 Correct 14 ms 344 KB Output is correct
31 Incorrect 240 ms 344 KB Too many queries.
32 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 11 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Incorrect 269 ms 344 KB Too many queries.
10 Halted 0 ms 0 KB -