답안 #826157

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
826157	2023-08-15T10:47:36 Z	LittleCube	드문 곤충 (IOI22_insects)	C++17	39.06 / 100	271 ms	436 KB

insects

#include "insects.h"
#include <bits/stdc++.h>
#define ll long long
using namespace std;

const double r = 0.45;

int min_cardinality(int N)
{
    vector<int> remain;
    int M = N, L = 1, R = N;
    /*
    Choose k:
    ans <= k -> R = k
    ans > k -> L = k + 1, M -= k
    */
    for (int i = 0; i < N; i++)
        remain.emplace_back(i);
    while (L < R)
    {
        int k = L * (1.0 - r) + R * r;
        vector<int> small, large, tmp, out;

        for (int i : remain)
        {
            move_inside(i);
            if (press_button() > k)
            {
                move_outside(i);
                large.emplace_back(i);
            }
            else
                small.emplace_back(i);
        }
        for (auto i : small)
            move_outside(i);

        if (large.empty())
            R = k;
        else
        {
            for (auto i : large)
            {
                move_inside(i);
                if (press_button() == 2)
                    move_outside(i);
                else
                    out.emplace_back(i);
            }
            int g = out.size();
            for (auto i : small)
            {
                move_inside(i);
                if (press_button() == 2)
                    large.emplace_back(i);
                else
                    tmp.emplace_back(i);
                move_outside(i);
            }
            for (auto i : out)
                move_outside(i);

            if (tmp.empty())
            {
                if (g == 1)
                    return large.size();
                L = k + 1, R = min(R, (int)remain.size() / g);
            }
            else
                remain = tmp, R = k;
        }
    }
    return L;
}

Compilation message

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:11:9: warning: unused variable 'M' [-Wunused-variable]
   11 |     int M = N, L = 1, R = N;
      |         ^

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	4 ms	212 KB	Output is correct
7	Correct	9 ms	208 KB	Output is correct
8	Correct	14 ms	208 KB	Output is correct
9	Correct	5 ms	208 KB	Output is correct
10	Correct	3 ms	208 KB	Output is correct
11	Correct	11 ms	208 KB	Output is correct
12	Correct	5 ms	208 KB	Output is correct
13	Correct	6 ms	208 KB	Output is correct
14	Correct	13 ms	208 KB	Output is correct
15	Correct	8 ms	208 KB	Output is correct
16	Correct	11 ms	208 KB	Output is correct
17	Correct	10 ms	208 KB	Output is correct
18	Correct	8 ms	208 KB	Output is correct
19	Correct	11 ms	208 KB	Output is correct
20	Correct	10 ms	208 KB	Output is correct
21	Correct	10 ms	208 KB	Output is correct
22	Correct	12 ms	208 KB	Output is correct
23	Correct	11 ms	208 KB	Output is correct
24	Correct	63 ms	208 KB	Output is correct
25	Correct	93 ms	208 KB	Output is correct
26	Correct	54 ms	308 KB	Output is correct
27	Correct	18 ms	208 KB	Output is correct
28	Correct	37 ms	208 KB	Output is correct
29	Correct	18 ms	304 KB	Output is correct
30	Correct	36 ms	308 KB	Output is correct
31	Correct	88 ms	424 KB	Output is correct
32	Correct	71 ms	308 KB	Output is correct
33	Correct	33 ms	292 KB	Output is correct
34	Correct	71 ms	420 KB	Output is correct
35	Correct	59 ms	324 KB	Output is correct
36	Correct	34 ms	336 KB	Output is correct
37	Correct	56 ms	336 KB	Output is correct
38	Correct	52 ms	300 KB	Output is correct
39	Correct	56 ms	308 KB	Output is correct
40	Correct	69 ms	208 KB	Output is correct
41	Correct	71 ms	300 KB	Output is correct

Subtask #3
14.06 / 75.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	208 KB	Output is correct
2	Correct	0 ms	208 KB	Output is correct
3	Correct	0 ms	208 KB	Output is correct
4	Correct	0 ms	208 KB	Output is correct
5	Correct	0 ms	208 KB	Output is correct
6	Correct	1 ms	208 KB	Output is correct
7	Correct	31 ms	296 KB	Output is correct
8	Partially correct	123 ms	308 KB	Output is partially correct
9	Partially correct	163 ms	428 KB	Output is partially correct
10	Partially correct	77 ms	300 KB	Output is partially correct
11	Correct	34 ms	208 KB	Output is correct
12	Partially correct	83 ms	324 KB	Output is partially correct
13	Partially correct	35 ms	308 KB	Output is partially correct
14	Partially correct	77 ms	304 KB	Output is partially correct
15	Partially correct	196 ms	436 KB	Output is partially correct
16	Partially correct	157 ms	312 KB	Output is partially correct
17	Partially correct	68 ms	312 KB	Output is partially correct
18	Partially correct	136 ms	312 KB	Output is partially correct
19	Partially correct	102 ms	300 KB	Output is partially correct
20	Partially correct	151 ms	312 KB	Output is partially correct
21	Partially correct	69 ms	336 KB	Output is partially correct
22	Partially correct	115 ms	312 KB	Output is partially correct
23	Partially correct	141 ms	312 KB	Output is partially correct
24	Partially correct	190 ms	316 KB	Output is partially correct
25	Partially correct	136 ms	420 KB	Output is partially correct
26	Partially correct	163 ms	312 KB	Output is partially correct
27	Partially correct	155 ms	312 KB	Output is partially correct
28	Partially correct	206 ms	304 KB	Output is partially correct
29	Partially correct	118 ms	436 KB	Output is partially correct
30	Partially correct	204 ms	340 KB	Output is partially correct
31	Partially correct	92 ms	316 KB	Output is partially correct
32	Partially correct	116 ms	312 KB	Output is partially correct
33	Partially correct	80 ms	312 KB	Output is partially correct
34	Partially correct	147 ms	300 KB	Output is partially correct
35	Partially correct	157 ms	312 KB	Output is partially correct
36	Partially correct	173 ms	316 KB	Output is partially correct
37	Partially correct	67 ms	316 KB	Output is partially correct
38	Partially correct	67 ms	304 KB	Output is partially correct
39	Partially correct	169 ms	304 KB	Output is partially correct
40	Partially correct	164 ms	316 KB	Output is partially correct
41	Partially correct	221 ms	316 KB	Output is partially correct
42	Partially correct	271 ms	408 KB	Output is partially correct
43	Correct	13 ms	308 KB	Output is correct
44	Correct	51 ms	300 KB	Output is correct
45	Partially correct	260 ms	312 KB	Output is partially correct
46	Partially correct	89 ms	436 KB	Output is partially correct
47	Partially correct	53 ms	316 KB	Output is partially correct
48	Partially correct	122 ms	312 KB	Output is partially correct

답안 #826157

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 15.0 / 15.0

Subtask #3 14.06 / 75.0

Subtask #1
10.0 / 10.0

Subtask #2
15.0 / 15.0

Subtask #3
14.06 / 75.0