QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#44243#4565. Rarest Insectsxiaoyaowudi0 7ms3280kbC++14962b2022-08-14 12:08:352022-08-14 12:08:37

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2022-08-14 12:08:37]
  • 评测
  • 测评结果:0
  • 用时:7ms
  • 内存:3280kb
  • [2022-08-14 12:08:35]
  • 提交

answer

#include "insects.h"

#include <vector>
// #include <cstdio>

constexpr int MN=2010;

int solve(const std::vector<int> &v1,const std::vector<int> &v2){
  // printf("solving\n");
  // for(int i:v1) printf("%d ",i);printf("\n");
  // for(int i:v2) printf("%d ",i);printf("\n");
  int k=v1.size(),n=v2.size();
  if(n<k) return 0;
  int b=(n-1)/(2*k)+1;
  std::vector<int> in,ot;
  for(int v:v2){
    move_inside(v);
    if(press_button()>b+1){
      move_inside(v);
      ot.push_back(v);
    }else{
      in.push_back(v);
    }
  }
  for(int v:in) move_outside(v);
  int l=in.size();
  if(l==k*b){
    return b+solve(v1,ot);
  }else{
    return solve(v1,in);
  }
}

int min_cardinality(int N) {
  std::vector<int> vals,ids;
  for(int i=0;i<N;++i){
    move_inside(i);
    if(press_button()<=1){
      vals.push_back(i);
    }else{
      move_outside(i);
      ids.push_back(i);
    }
  }
  return solve(vals,ids)+1;
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 10
Accepted
time: 3ms
memory: 3244kb

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
0 5
8
1 3
8
1 4
8
3 1

result:

ok 

Test #2:

score: 0
Accepted
time: 2ms
memory: 3212kb

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
1 1
8
3 2

result:

ok 

Test #3:

score: 0
Accepted
time: 3ms
memory: 3244kb

input:

2
1
1

output:

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

result:

ok 

Test #4:

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

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: 2ms
memory: 3208kb

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
0 4
8
1 2
8
1 3
8
3 2

result:

ok 

Test #6:

score: 0
Accepted
time: 2ms
memory: 3224kb

input:

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

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
0 3
8
0 4
8
2
8
0 4
8
0 5
8
2
8
0 5
8
0 6
8
2
8
0 6
8
1 2
8
3 1

result:

ok 

Test #7:

score: -10
Wrong Answer
time: 1ms
memory: 3272kb

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:

wrong answer Wrong answer.

Subtask #2:

score: 0
Wrong Answer

Test #24:

score: 0
Wrong Answer
time: 7ms
memory: 3280kb

input:

1000
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:

wrong answer Wrong answer.

Subtask #3:

score: 0
Wrong Answer

Test #43:

score: 75
Accepted
time: 3ms
memory: 3268kb

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
1 1
8
3 2

result:

ok 

Test #44:

score: 75
Accepted
time: 3ms
memory: 3232kb

input:

2
1
1

output:

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

result:

ok 

Test #45:

score: 75
Accepted
time: 1ms
memory: 3208kb

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 #46:

score: 75
Accepted
time: 1ms
memory: 3232kb

input:

6
1
2
1
2
2
2
2
3
4
5

output:

8
0 0
8
2
8
0 1
8
2
8
1 1
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 1
8
2
8
0 3
8
2
8
0 3
8
0 4
8
2
8
0 4
8
0 5
8
2
8
0 5
8
1 1
8
3 1

result:

ok 

Test #47:

score: 0
Wrong Answer
time: 0ms
memory: 3280kb

input:

10
1
1
2
2
2
2
2
2
2
2
2
3
3
3
4
4
5
6
4
4
4
4

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
1 7
8
0 8
8
2
8
1 8
8
0 9
8
2
8
1 9
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 6
8
0 7
8
2
8
0 7
8
0 8
8
2
8
0 8
8
0 9
8
2
8
0 9
8
1 2
8
1 3
8
1 4
8
1 5
8
0 6
8
2
8
0 6
8
0 7
8
...

result:

wrong answer Wrong answer.