oj.uz

답안 #1066888

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066888 2024-08-20T08:28:58 Z j_vdd16 드문 곤충 (IOI22_insects) C++17
10 / 100
 232 ms 344 KB 
#include "insects.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

typedef uint64_t u64;
typedef int64_t i64;

int min_cardinality(int N) {
    vi types(N);

    int typeCounter = 1;
    types[0] = 0;
    for (int i = 1; i < N; i++) {
        int j = 0;
        move_inside(i);
        for (; j < i; j++) {
            move_inside(j);
            int res = press_button();
            move_outside(j);

            if (res == 2) {
                break;
            }
        }
        move_outside(i);

        if (j == i) {
            types[i] = typeCounter++;
        }
        else {
            types[i] = types[j];
        }
    }

    vi freq(typeCounter);
    loop(i, N) {
        freq[types[i]]++;
    }

    int best = INT_MAX;
    loop(i, typeCounter) {
        best = min(best, freq[i]);
    }

    return best;
}

Subtask #1
10.0 / 10.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 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 104 ms 344 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 62 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 12 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 20 ms 344 KB Output is correct
20 Correct 49 ms 344 KB Output is correct
21 Correct 65 ms 344 KB Output is correct
22 Correct 83 ms 344 KB Output is correct

Subtask #2
0 / 15.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 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 2 ms 344 KB Output is correct
7 Correct 104 ms 344 KB Output is correct
8 Correct 11 ms 344 KB Output is correct
9 Correct 14 ms 344 KB Output is correct
10 Correct 2 ms 344 KB Output is correct
11 Correct 62 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 12 ms 344 KB Output is correct
18 Correct 7 ms 344 KB Output is correct
19 Correct 20 ms 344 KB Output is correct
20 Correct 49 ms 344 KB Output is correct
21 Correct 65 ms 344 KB Output is correct
22 Correct 83 ms 344 KB Output is correct
23 Correct 7 ms 344 KB Output is correct
24 Incorrect 217 ms 344 KB Too many queries.
25 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 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 9 ms 344 KB Output is correct
8 Incorrect 232 ms 344 KB Too many queries.
9 Halted 0 ms 0 KB -