oj.uz

답안 #1082960

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082960 2024-09-02T08:46:21 Z mychecksedad COVID tests (CEOI24_covid) C++17
77.57 / 100
 1937 ms 592 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long int
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define en cout << '\n'

int N;

// The probability any given student is positive
double P;

// This function performs a test on a subset of samples.
// Its argument is a vector of Booleans of length N,
// where the i-th element is true if the i-th sample should be added to the mix.
// It returns true if (and only if) at least one of the samples in the mix is positive.
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';
}

/// You should implement:

// This function will be called once for each test instance.
// It should use test_students to determine which samples are positive.
// It must return a vector of Booleans of length N,
// where the i-th element is true if and only if the i-th sample is positive.
void find_positive(vector<bool> answer) {
	std::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);
}

void f(vector<bool> &A, int l, int r, int L, int R){
	for(int i = L; i <= R; ++i) A[i] = (l <= i && i <= r) ? 1 : 0;
}

int main() {
  int T;
  scanf("%d %lf %d", &N, &P, &T);

  if(P > 0.2){
  	for(int i = 0; i < T; ++i){
  		vector<bool> ans(N), arr(N);
  		for(int j = 0; j < N; ++j){
  			arr[j] = 1;
  			ans[j] = test_students(arr);
  			arr[j] = 0;
  		}
  		find_positive(ans);
  	}
  	return 0;
  }


  for (int i = 0; i < T; i++) {
  	int S = N * P;
  	S = N/S;
  	vector<vector<int>> block;
  	for(int j = 0; j < N; j += S){
  		block.pb({});
  		for(int l = j; l < min(N, j + S); ++l){
  			block.back().pb(l);
  		}
  	}
  	vector<bool> ans(N);
  	for(auto v: block){
  		int l = v[0], r = v.back();
  		vector<bool> arr(N);
  		
  		for(;l <= r;){
  			f(arr, l, r, v[0], v.back());
  			bool is = test_students(arr);
	  		if(!is) break;
	  		if(l == r){
	  			ans[l] = 1;
	  			break;
	  		}
	  		int lm = l, rm = r - 1, fst = r;
	  		while(lm <= rm){
	  			int mid = lm+rm>>1;
	  			f(arr, l, mid, v[0], v.back());
	  			if(test_students(arr)){
	  				fst = mid;
	  				rm = mid - 1;
	  			}else lm = mid + 1;
	  		}
	  		ans[fst] = 1;
	  		l = fst + 1;
  		}
  		

  	}

    find_positive(ans);
  }

  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:103:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  103 |       int mid = lm+rm>>1;
      |                 ~~^~~
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |     scanf(" %c", &answer);
      |     ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'void find_positive(std::vector<bool>)':
Main.cpp:51:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |   scanf(" %c", &verdict);
      |   ~~~~~^~~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |   scanf("%d %lf %d", &N, &P, &T);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #1
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 7 ms 344 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 10 ms 344 KB Output is correct
5 Correct 7 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 8 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 7 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 7 ms 344 KB Output is correct
16 Correct 8 ms 344 KB Output is correct
17 Runtime error 0 ms 344 KB Execution killed with signal 8
18 Halted 0 ms 0 KB -

Subtask #2
77.570000001 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 344 KB Output is correct (P=0.001, F=15.1, Q=10.7) -> 90.00 points
2 Correct 117 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=47.7) -> 90.00 points
3 Correct 240 ms 340 KB Output is correct (P=0.011546, F=94.9, Q=94.4) -> 90.00 points
4 Correct 484 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=194.3) -> 85.03 points
5 Correct 638 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=254.2) -> 79.77 points
6 Correct 922 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=380.1) -> 78.14 points
7 Correct 1261 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=506.1) -> 79.72 points
8 Correct 1633 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=662.1) -> 78.67 points
9 Correct 1937 ms 592 KB Output is correct (P=0.2, F=731.4, Q=760.7) -> 77.57 points