QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#794665#4565. Rarest Insects_8_8_0 3ms4084kbC++201.7kb2024-11-30 15:26:472024-11-30 15:26:48

Judging History

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

  • [2024-11-30 15:26:48]
  • 评测
  • 测评结果:0
  • 用时:3ms
  • 内存:4084kb
  • [2024-11-30 15:26:47]
  • 提交

answer

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

using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, u;
vector<int> p;
set<int> cur, lef;
void add(int i) {
    cur.insert(i);
    move_inside(i);
}
void del(int i) {
    if(cur.count(i)) {
        cur.erase(i);
        move_outside(i);
    }
}
int l , r;
bool check(int mid) {
    if(mid * u > n) return false;
    int col = 0;
    int val = (int)lef.size() + (int)cur.size();
    set<int> nf = lef;
    for(int i : lef) {
        add(i); 
        if(col <= val - mid * u && press_button() > mid) {
            del(i);
            nf.erase(i);
            col++;
        }
        if(col > val - mid * u) break;
    }
    if(col == val - mid * u) {
        set<int> nv;
        for(int i : lef) {
            if(!cur.count(i)) { 
                nv.insert(i);
            }
        }
        lef.swap(nv);
        return 1;   
    }
    set<int> nv;
    for(int i : lef) {
        if(cur.count(i)) {
            nv.insert(i);
        }
        del(i);
    }
    lef.swap(nf);
    return false;
}
int min_cardinality(int NN) {
    n = NN;
    for(int i = 0; i < n; i++) {
        lef.insert(i);
    }
    int col = 0;
    for(int i = 0; i < n; i++) {    
        add(i);
        if(press_button() == 2) {
            del(i);
            col++;
        } else {
            lef.erase(i);
        }
    }
    u = (int)cur.size();
    if(u == 1) {
        return n;
    }
    l = 1, r = n / u;
    int res;
    while(r - l > 0) {
        int mid = (l + r) >> 1;
        if(check(mid)) {
            l = mid+1;
            res = mid;
        } else {
            r = mid-1;
        }
    }
    return res;
}

詳細信息

Subtask #1:

score: 0
Wrong Answer

Test #1:

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

input:

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

result:

ok 

Test #2:

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

input:

2
1
2

output:

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

result:

ok 

Test #3:

score: 0
Wrong Answer
time: 1ms
memory: 3844kb

input:

2
1
1

output:

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

result:

wrong answer Wrong answer.

Subtask #2:

score: 0
Wrong Answer

Test #24:

score: 15
Accepted
time: 0ms
memory: 4084kb

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:

ok 

Test #25:

score: 0
Wrong Answer
time: 3ms
memory: 3884kb

input:

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

wrong answer Wrong answer.

Subtask #3:

score: 0
Wrong Answer

Test #43:

score: 75
Accepted
time: 0ms
memory: 3896kb

input:

2
1
2

output:

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

result:

ok 

Test #44:

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

input:

2
1
1

output:

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

result:

wrong answer Wrong answer.