QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#141800#4565. Rarest Insectsvalerikk#0 7ms3892kbC++17961b2023-08-18 01:03:082024-07-04 01:47:11

Judging History

你现在查看的是最新测评结果

  • [2024-07-04 01:47:11]
  • 评测
  • 测评结果:0
  • 用时:7ms
  • 内存:3892kb
  • [2023-08-18 01:03:08]
  • 提交

answer

#include "insects.h"
#include <bits/stdc++.h>

using namespace std;

namespace {

const int N = 2005;

int n;
int used[N];
vector<int> diff;

}

int min_cardinality(int grdn) {
	n = grdn;
	for (int i = 0; i < n; ++i) {
		move_inside(i);
		if (press_button() > 1) {
			move_outside(i);
		} else {
			used[i] = 1;
			diff.push_back(i);
		}
	}
	int k = diff.size();
	int ret = 1;
	int m = n / k - 1;
	while (true) {
		vector<int> a;
		for (int i = 0; i < n; ++i) {
			if (!used[i]) {
				a.push_back(i);
			}
		}
		if ((int)a.size() < k || m == 0) {
			break;
		}
		int x = m * 0.20;
		x = max(x, 1);
		x = min(x, m);
		vector<int> b;
		for (int i : a) {
			move_inside(i);
			if (press_button() - ret > x) {
				move_outside(i);
			} else {
				b.push_back(i);
			}
		}
		if ((int)b.size() == x * k) {
			m -= x;
			ret += x;
			for (int i : b) {
				used[i] = 1;
			}
		} else {
			for (int i : b) {
				move_outside(i);
			}
			m = x - 1;
		}
	}
	return ret;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Interactor Judgement Failed

Test #1:

score: 10
Accepted
time: 1ms
memory: 3804kb

input:

6
1
1
1
2
2
2
2
2
3

output:

8
0 0
8
2
8
0 1
8
2
8
0 2
8
2
8
0 3
8
2
8
1 3
8
0 4
8
2
8
1 4
8
0 5
8
2
8
1 5
8
0 3
8
2
8
0 4
8
2
8
0 5
8
2
8
1 5
8
1 3
8
1 4
8
3 1

result:

ok 
g answer secret mismatch

Test #2:

score: 0
Accepted
time: 0ms
memory: 3752kb

input:

2
1
2
2

output:

8
0 0
8
2
8
0 1
8
2
8
1 1
8
0 1
8
2
8
3 2

result:

ok 
g answer secret mismatch

Test #3:

score: 0
Accepted
time: 1ms
memory: 3820kb

input:

2
1
1

output:

8
0 0
8
2
8
0 1
8
2
8
3 1

result:

ok 
g answer secret mismatch

Test #4:

score: 0
Accepted
time: 1ms
memory: 3888kb

input:

3
1
1
2

output:

8
0 0
8
2
8
0 1
8
2
8
0 2
8
2
8
1 2
8
3 1

result:

ok 

Test #5:

score: 0
Accepted
time: 1ms
memory: 3800kb

input:

5
1
1
2
2
2
2
2
3

output:

8
0 0
8
2
8
0 1
8
2
8
0 2
8
2
8
1 2
8
0 3
8
2
8
1 3
8
0 4
8
2
8
1 4
8
0 2
8
2
8
0 3
8
2
8
0 4
8
2
8
1 4
8
3 2

result:

ok 

Test #6:

score: 0
Accepted
time: 1ms
memory: 3800kb

input:

8
1
1
2
2
2
2
2
1
2
3
3
3
2

output:

8
0 0
8
2
8
0 1
8
2
8
0 2
8
2
8
1 2
8
0 3
8
2
8
1 3
8
0 4
8
2
8
1 4
8
0 5
8
2
8
1 5
8
0 6
8
2
8
1 6
8
0 7
8
2
8
0 2
8
2
8
0 3
8
2
8
1 3
8
0 4
8
2
8
1 4
8
0 5
8
2
8
1 5
8
0 6
8
2
8
1 2
8
1 6
8
3 1

result:

ok 

Test #7:

score: 0
Accepted
time: 7ms
memory: 3892kb

input:

199
1
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

output:

8
0 0
8
2
8
0 1
8
2
8
1 1
8
0 2
8
2
8
1 2
8
0 3
8
2
8
1 3
8
0 4
8
2
8
1 4
8
0 5
8
2
8
1 5
8
0 6
8
2
8
1 6
8
0 7
8
2
8
1 7
8
0 8
8
2
8
1 8
8
0 9
8
2
8
1 9
8
0 10
8
2
8
1 10
8
0 11
8
2
8
1 11
8
0 12
8
2
8
1 12
8
0 13
8
2
8
1 13
8
0 14
8
2
8
1 14
8
0 15
8
2
8
1 15
8
0 16
8
2
8
1 16
8
0 17
8
2
8
1 17
8
...

result:

ok 

Test #8:

score: 0
Accepted
time: 1ms
memory: 3808kb

input:

200
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
...

output:

8
0 0
8
2
8
0 1
8
2
8
0 2
8
2
8
0 3
8
2
8
0 4
8
2
8
0 5
8
2
8
0 6
8
2
8
0 7
8
2
8
0 8
8
2
8
0 9
8
2
8
0 10
8
2
8
0 11
8
2
8
0 12
8
2
8
0 13
8
2
8
0 14
8
2
8
0 15
8
2
8
0 16
8
2
8
0 17
8
2
8
0 18
8
2
8
0 19
8
2
8
0 20
8
2
8
0 21
8
2
8
0 22
8
2
8
0 23
8
2
8
0 24
8
2
8
0 25
8
2
8
0 26
8
2
8
0 27
8
2
8
...

result:

ok 

Test #9:

score: 0
Accepted
time: 6ms
memory: 3764kb

input:

200
1
1
1
2
1
2
1
2
2
2
1
1
1
1
1
2
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
1
1
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

output:

8
0 0
8
2
8
0 1
8
2
8
0 2
8
2
8
0 3
8
2
8
1 3
8
0 4
8
2
8
0 5
8
2
8
1 5
8
0 6
8
2
8
0 7
8
2
8
1 7
8
0 8
8
2
8
1 8
8
0 9
8
2
8
1 9
8
0 10
8
2
8
0 11
8
2
8
0 12
8
2
8
0 13
8
2
8
0 14
8
2
8
0 15
8
2
8
1 15
8
0 16
8
2
8
1 16
8
0 17
8
2
8
1 17
8
0 18
8
2
8
1 18
8
0 19
8
2
8
1 19
8
0 20
8
2
8
1 20
8
0 21
...

result:

ok 

Test #10:

score: 0
Accepted
time: 0ms
memory: 3868kb

input:

198
1
1
1
1
1
1
2
1
2
2
2
2
1
2
1
2
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
1
2
2
2
1
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
2
1
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
2
...

output:

8
0 0
8
2
8
0 1
8
2
8
0 2
8
2
8
0 3
8
2
8
0 4
8
2
8
0 5
8
2
8
0 6
8
2
8
1 6
8
0 7
8
2
8
0 8
8
2
8
1 8
8
0 9
8
2
8
1 9
8
0 10
8
2
8
1 10
8
0 11
8
2
8
1 11
8
0 12
8
2
8
0 13
8
2
8
1 13
8
0 14
8
2
8
0 15
8
2
8
1 15
8
0 16
8
2
8
1 16
8
0 17
8
2
8
1 17
8
0 18
8
2
8
1 18
8
0 19
8
2
8
1 19
8
0 20
8
2
8
1 2...

result:

ok 

Test #11:

score: -10
Interactor Judgement Failed

input:


output:


result:


Subtask #2:

score: 0
Interactor Judgement Failed

Test #24:

score: 0
Interactor Judgement Failed

input:


output:


result:


Subtask #3:

score: 0
Interactor Judgement Failed

Test #43:

score: 0
Interactor Judgement Failed

input:


output:


result: