oj.uz

답안 #1066877

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1066877 2024-08-20T08:24:38 Z j_vdd16 드문 곤충 (IOI22_insects) C++17
0 / 100
 0 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;
        for (; j < i; j++) {
            move_inside(j);
            if (press_button() == 2) 
                break;

            move_outside(j);
        }

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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Wrong answer.
3 Halted 0 ms 0 KB -