oj.uz

답안 #1044107

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044107 2024-08-05T07:25:59 Z alex_2008 COVID tests (CEOI24_covid) C++14
10 / 100
 5 ms 344 KB 
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <map>
#include <queue>
#include <stack>
typedef long long ll;
using namespace std;
const int N = 2e5 + 10;
int main() {
	int n, t;
	long double p;
	cin >> n >> p >> t;
	string ans = string(n, '0');
	for (int i = 1; i <= n; i++) {
		cout << "Q ";
		string s = string(n, '0');
		s[i - 1] = '1';
		cout << s << endl;
		char x;
		cin >> x;
		if (x == 'P') ans[i - 1] = '1';
	}
	cout << "A " << ans << endl;
	char x;
	cin >> x;
	return 0;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -

Subtask #1
10.0 / 10.0

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

Subtask #2
0.0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 5 ms 344 KB Unexpected end of file - token expected
2 Halted 0 ms 0 KB -