oj.uz

Submission #1061323

# Submission time Handle Problem Language Result Execution time Memory
1061323 2024-08-16T08:03:10 Z Dan4Life COVID tests (CEOI24_covid) C++17
67.11 / 100
 1806 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a), end(a)
using ll = long long;
using vi = vector<int>;
using ar2 = array<int,2>;
using ar3 = array<int,3>;
using ar4 = array<int,4>;
const int INF = (int)2e9;
const int mxN = (int)1e6+10;
int N;
double P;

bool test_students(std::vector<bool> mask) {
    assert(mask.size() == (size_t)N);
    std::string mask_str(N, ' ');
    for (int i = 0; i < N; i++)
        mask_str[i] = mask[i] ? '1' : '0';
 
    printf("Q %s\n", mask_str.c_str());
    fflush(stdout);
 
    char answer;
    scanf(" %c", &answer);
    return (answer == 'P');
}
 
vector<bool> find_positive() {
    vector<bool> answer(N,0), test(N,0);
    if(!P) return answer;
    if(P>=0.3){
		for(int i = 0; i < N; i++){
			test[i]=1;
			if(test_students(test))
				answer[i]=1;
			test[i]=0;
		}
		return answer;
	} 
	int B = 1; double prob = 1.0-P;
	while(prob>=0.5) prob*=(1.0-P), B++;
	if(P>0.03) B/=2,B++;
    for(int i = 0; i < N; i+=B){
		int rr = min(N,i+B)-1;
		while(i<=rr){
			fill(begin(test)+i,begin(test)+rr+1,1);
			int chk = test_students(test);
			fill(begin(test)+i,begin(test)+rr+1,0);
			if(!chk) break;
			int l = i, r = rr+1;
			while(l<r){
				int mid = (l+r)/2;
				fill(begin(test)+l,begin(test)+mid+1,1);
				int chk = test_students(test);
				fill(begin(test)+l,begin(test)+mid+1,0);
				if(chk) r=mid;
				else l=mid+1;
			}
			answer[l]=1; i=l+1,rr=min(N-1,l+B);
		}
		fill(begin(test)+i,begin(test)+rr+1,0);
	}
    return answer;
}
 
int main() {
    int T;
    scanf("%d %lf %d", &N, &P, &T);

    for (int i = 0; i < T; i++) {
        vector<bool> answer = find_positive();
        assert(answer.size() == (size_t)N);
 
        string answer_str(N, ' ');
        for (int j = 0; j < N; j++)
            answer_str[j] = answer[j] ? '1' : '0';
 
        printf("A %s\n", answer_str.c_str());
        fflush(stdout);
 
        char verdict;
        scanf(" %c", &verdict);
        if (verdict == 'W')
            exit(0);
    }
    return 0;
}

Compilation message

Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:26:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   26 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:70:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     scanf("%d %lf %d", &N, &P, &T);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:84:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |         scanf(" %c", &verdict);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 6 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 6 ms 344 KB Output is correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 8 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 7 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 6 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct

Subtask #2
57.110000004 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 344 KB Output is correct (P=0.001, F=15.1, Q=11.0) -> 90.00 points
2 Correct 104 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=46.8) -> 90.00 points
3 Correct 208 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=91.4) -> 90.00 points
4 Correct 455 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=192.7) -> 87.80 points
5 Correct 633 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=264.7) -> 69.29 points
6 Correct 961 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=405.2) -> 63.11 points
7 Correct 1286 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=560.9) -> 57.11 points
8 Correct 1576 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=707.4) -> 63.05 points
9 Correct 1806 ms 344 KB Output is correct (P=0.2, F=731.4, Q=812.6) -> 62.32 points