oj.uz

답안 #1068129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1068129 2024-08-21T07:54:09 Z lollipop COVID tests (CEOI24_covid) C++17
36.95 / 100
 2177 ms 596 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define int long long
#define pb push_back
#define s second
#define f first
#define pf push_front
#define inf 100000000000000000
#define bitebi __builtin_popcountll
#define FOR( i , n ) for( int i = 0 ; i < n ; i ++ )
#define YES cout <<"YES\n"
#define NO cout << "NO\n"
#define debug cout << "Here Fine" << endl ;
#define pr pair < int , int >
#define fbo find_by_order // returns iterator
#define ook order_of_key // returns strictly less numbers than key
using namespace std ;
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,fma")
using namespace __gnu_pbds;
using namespace __gnu_cxx;
template<class T> using ordered_set =tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update> ;
const double Pi=acos(-1.0);
const double EPS=1E-8;
const int mod =  1000000007 ;
const int mod1 = 998244353 ;
const int N = 3e5 + 10 ;
mt19937 R(time(0));
map < int , int > ma , ma1 ;

int n , t , T ;
double p ;
string s = "" , ans = "" ;


void go( int l , int r ){
	for( int i = l ; i <= r ; i ++ ) s[ i ] = '1' ;
	cout << "Q " << s << endl ;
	char c ; cin >> c ;
	for( int i = l ; i <= r ; i ++ ) s[ i ] = '0' ;
	
	if( c == 'N' ) return ;
	
	if( l == r ){
		ans[ l ] = '1' ; return ; 
	}
	int mid = ( l + r ) / 2 ; 
	go( l , mid ) ;
	go( mid + 1 , r ) ;
	
}

void solve(){

	FOR( i , n ) s[ i ] = ans[ i ] = '0' ;
	
	
	if( T == 1 ){
		FOR( i , n ){
			s[ i ] = '1' ;
			cout << "Q " << s << endl ;
			s[ i ] = '0' ;
			char c ; cin >> c ;
			if( c == 'P' ) ans[ i ] = '1' ;
		}
		cout << "A " << ans << endl ;
		char c ; cin >> c ;
		if( c == 'W' ) return ; 
		return ;
	}
	
	
	// else go binary search?
	
	
	
	go( 0 , n - 1 ) ; 
	cout << "A " << ans << endl ;
	char c ; cin >> c ;
	
	
	
}
signed main() {
   ios_base::sync_with_stdio(0),cin.tie(NULL),cout.tie(NULL);
   cin >> n >> p >> t ; 
   T = t ;
   FOR( i , n ) s += '0' , ans += '0' ; 
   
   while( t -- ){
   	 solve() ;
   }

}

Subtask #0
0.0 / 0.0

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 6 ms 344 KB Output is correct
8 Correct 3 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 5 ms 596 KB Output is correct
17 Correct 5 ms 344 KB Output is correct

Subtask #2
26.949999996 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 344 KB Output is correct (P=0.001, F=15.1, Q=17.8) -> 52.47 points
2 Correct 144 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=78.0) -> 28.98 points
3 Correct 307 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=150.0) -> 27.09 points
4 Correct 608 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=303.5) -> 26.95 points
5 Correct 766 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=388.5) -> 27.20 points
6 Correct 1094 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=569.4) -> 27.95 points
7 Correct 1471 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=751.4) -> 28.75 points
8 Correct 1904 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=967.6) -> 29.45 points
9 Correct 2177 ms 344 KB Output is correct (P=0.2, F=731.4, Q=1112.6) -> 29.18 points