oj.uz

Submission #1058711

# Submission time Handle Problem Language Result Execution time Memory
1058711 2024-08-14T12:44:19 Z rainboy COVID tests (CEOI24_covid) C
89.21 / 100
 1195 ms 356 KB 
#include <stdio.h>
#include <string.h>

#define N	1000

int min(int a, int b) { return a < b ? a : b; }

unsigned int Z = 12345;

int rand_() {
	return (Z *= 3) >> 1;
}

int n, m; double p;

int query(int l, int r) {
	static char cc[N + 1], s[2];

	memset(cc, '0', n * sizeof *cc), memset(cc + l, '1', (r - l) * sizeof *cc);
	printf("Q %s\n", cc), fflush(stdout);
	scanf("%s", s);
	return s[0] == 'P';
}

int main() {
	int t, subtask;

	scanf("%d%lf%d", &n, &p, &t), m = 1 / p / 2, subtask = t == 1 ? 1 : 2;
	while (t--) {
		static char cc[N + 1];
		int i, l, r, lower, upper;

		memset(cc, '0', n * sizeof *cc), cc[n] = 0;
		if (subtask == 1) {
			for (i = 0; i < n; i++)
				if (query(i, i + 1))
					cc[i] = '1';
		} else {
			l = 0;
			while (l < n) {
				r = min(l + m, n);
				if (!query(l, r)) {
					l = r;
					continue;
				}
				lower = l, upper = r;
				while (upper - lower > 1) {
					i = (lower + upper) / 2;
					if (query(l, i))
						upper = i;
					else
						lower = i;
				}
				cc[lower] = '1', l = lower + 1;
			}
		}
		printf("A %s\n", cc), fflush(stdout);
		scanf("%*s");
	}
	return 0;
}

Compilation message

Main.c: In function 'query':
Main.c:21:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |  scanf("%s", s);
      |  ^~~~~~~~~~~~~~
Main.c: In function 'main':
Main.c:28:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   28 |  scanf("%d%lf%d", &n, &p, &t), m = 1 / p / 2, subtask = t == 1 ? 1 : 2;
      |  ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.c:58:3: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |   scanf("%*s");
      |   ^~~~~~~~~~~~

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 5 ms 344 KB Output is correct
2 Correct 4 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 4 ms 344 KB Output is correct
8 Correct 3 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
79.209999999 / 90.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 344 KB Output is correct (P=0.001, F=15.1, Q=10.9) -> 90.00 points
2 Correct 67 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=47.4) -> 90.00 points
3 Correct 145 ms 356 KB Output is correct (P=0.011546, F=94.9, Q=92.3) -> 90.00 points
4 Correct 307 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=190.1) -> 90.00 points
5 Correct 326 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=250.0) -> 84.90 points
6 Correct 588 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=370.6) -> 85.87 points
7 Correct 763 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=502.9) -> 81.61 points
8 Correct 1006 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=645.7) -> 86.43 points
9 Correct 1195 ms 344 KB Output is correct (P=0.2, F=731.4, Q=756.3) -> 79.21 points