oj.uz

답안 #836482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
836482 2023-08-24T11:46:36 Z SamAnd 드문 곤충 (IOI22_insects) C++17
58.38 / 100
 129 ms 508 KB 
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 2003;

vector<int> q[N];
int min_cardinality(int N)
{
    vector<int> v;
    vector<int> b;
    for (int i = 0; i < N; ++i)
    {
        move_inside(i);
        if (press_button() == 1)
        {
            v.push_back(i);
        }
        else
        {
            move_outside(i);
            b.push_back(i);
        }
    }
    for (int i = 0; i < sz(v); ++i)
        move_outside(v[i]);

    if (sz(v) > 200)
    {
        int ans = 1;
        while (!b.empty())
        {
            vector<int> vv;
            vector<int> bb;
            for (int i = 0; i < sz(b); ++i)
            {
                move_inside(b[i]);
                if (press_button() == 1)
                {
                    vv.push_back(b[i]);
                }
                else
                {
                    move_outside(b[i]);
                    bb.push_back(b[i]);
                }
            }
            if (sz(vv) < sz(v))
                break;
            ++ans;
            for (int i = 0; i < sz(vv); ++i)
                move_outside(vv[i]);
            b = bb;
        }
        return ans;
    }

    vector<int> l, r, u;
    l.assign(sz(b), 0);
    r.assign(sz(b), sz(v) - 1);
    u.assign(sz(b), -1);
    while (1)
    {
        for (int i = 0; i < sz(v); ++i)
            q[i].clear();
        bool z = false;
        for (int i = 0; i < sz(b); ++i)
        {
            if (l[i] <= r[i])
            {
                int m = (l[i] + r[i]) / 2;
                q[m].push_back(i);
                z = true;
            }
        }
        if (!z)
            break;
        for (int i = 0; i < sz(v); ++i)
        {
            move_inside(v[i]);
            for (int j = 0; j < sz(q[i]); ++j)
            {
                move_inside(b[q[i][j]]);
                if (press_button() == 2)
                {
                    u[q[i][j]] = i;
                    r[q[i][j]] = i - 1;
                }
                else
                    l[q[i][j]] = i + 1;
                move_outside(b[q[i][j]]);
            }
        }
        for (int i = 0; i < sz(v); ++i)
        {
            move_outside(v[i]);
        }
    }

    vector<int> q;
    q.assign(sz(v), 1);
    for (int i = 0; i < sz(b); ++i)
        ++q[u[i]];
    int ans = q[0];
    for (int i = 0; i < sz(v); ++i)
        ans = min(ans, q[i]);
    return ans;
}

/*
10
1 1 2 2 1 2 3 3 3 4
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 0 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 4 ms 336 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 8 ms 336 KB Output is correct
9 Correct 8 ms 336 KB Output is correct
10 Correct 6 ms 336 KB Output is correct
11 Correct 8 ms 336 KB Output is correct
12 Correct 5 ms 336 KB Output is correct
13 Correct 6 ms 336 KB Output is correct
14 Correct 6 ms 352 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 3 ms 336 KB Output is correct
17 Correct 5 ms 348 KB Output is correct
18 Correct 8 ms 336 KB Output is correct
19 Correct 8 ms 348 KB Output is correct
20 Correct 10 ms 348 KB Output is correct
21 Correct 6 ms 336 KB Output is correct
22 Correct 7 ms 344 KB Output is correct
23 Correct 11 ms 336 KB Output is correct
24 Correct 7 ms 336 KB Output is correct
25 Correct 41 ms 364 KB Output is correct
26 Correct 41 ms 488 KB Output is correct
27 Correct 11 ms 336 KB Output is correct
28 Correct 11 ms 336 KB Output is correct
29 Correct 27 ms 352 KB Output is correct
30 Correct 47 ms 360 KB Output is correct
31 Correct 23 ms 336 KB Output is correct
32 Correct 23 ms 352 KB Output is correct
33 Correct 27 ms 364 KB Output is correct
34 Correct 37 ms 348 KB Output is correct
35 Correct 28 ms 368 KB Output is correct
36 Correct 30 ms 356 KB Output is correct
37 Correct 41 ms 360 KB Output is correct
38 Correct 60 ms 356 KB Output is correct
39 Correct 45 ms 336 KB Output is correct
40 Correct 9 ms 348 KB Output is correct
41 Correct 6 ms 344 KB Output is correct

Subtask #3
33.38 / 75.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 0 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 0 ms 336 KB Output is correct
5 Correct 0 ms 336 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Correct 27 ms 352 KB Output is correct
8 Correct 13 ms 336 KB Output is correct
9 Partially correct 82 ms 420 KB Output is partially correct
10 Partially correct 84 ms 416 KB Output is partially correct
11 Correct 28 ms 336 KB Output is correct
12 Correct 26 ms 360 KB Output is correct
13 Partially correct 45 ms 384 KB Output is partially correct
14 Partially correct 109 ms 336 KB Output is partially correct
15 Partially correct 37 ms 484 KB Output is partially correct
16 Partially correct 53 ms 348 KB Output is partially correct
17 Partially correct 57 ms 456 KB Output is partially correct
18 Partially correct 81 ms 356 KB Output is partially correct
19 Partially correct 38 ms 476 KB Output is partially correct
20 Partially correct 59 ms 336 KB Output is partially correct
21 Partially correct 117 ms 416 KB Output is partially correct
22 Partially correct 109 ms 508 KB Output is partially correct
23 Partially correct 99 ms 424 KB Output is partially correct
24 Correct 13 ms 384 KB Output is correct
25 Correct 25 ms 352 KB Output is correct
26 Correct 22 ms 348 KB Output is correct
27 Partially correct 55 ms 396 KB Output is partially correct
28 Partially correct 77 ms 508 KB Output is partially correct
29 Partially correct 68 ms 464 KB Output is partially correct
30 Partially correct 59 ms 408 KB Output is partially correct
31 Partially correct 90 ms 412 KB Output is partially correct
32 Partially correct 124 ms 420 KB Output is partially correct
33 Partially correct 129 ms 412 KB Output is partially correct
34 Partially correct 124 ms 412 KB Output is partially correct
35 Partially correct 105 ms 420 KB Output is partially correct
36 Partially correct 117 ms 416 KB Output is partially correct
37 Partially correct 89 ms 464 KB Output is partially correct
38 Partially correct 72 ms 504 KB Output is partially correct
39 Partially correct 66 ms 416 KB Output is partially correct
40 Partially correct 93 ms 496 KB Output is partially correct
41 Partially correct 85 ms 388 KB Output is partially correct
42 Partially correct 78 ms 360 KB Output is partially correct
43 Partially correct 14 ms 336 KB Output is partially correct
44 Partially correct 49 ms 392 KB Output is partially correct
45 Correct 44 ms 348 KB Output is correct
46 Correct 21 ms 352 KB Output is correct
47 Correct 21 ms 460 KB Output is correct
48 Correct 25 ms 348 KB Output is correct