oj.uz

답안 #1044764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1044764 2024-08-05T13:22:06 Z Tsovak COVID tests (CEOI24_covid) C++17
53 / 100
 1835 ms 344 KB 
// -------------------- Includes -------------------- //
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <stdio.h>
#include <cstdlib>
#include <stdlib.h>
#include <array>
#include <string>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <math.h>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <list>
#include <iterator>
#include <numeric>
#include <complex>
#include <tuple>
#include <utility>
#include <cassert>
#include <assert.h>
#include <climits>
#include <limits.h>
#include <ctime>
#include <time.h>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

// -------------------- Typedefs -------------------- //

typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ld;

// -------------------- Defines -------------------- //

#define pr pair
#define mpr make_pair
#define ff first
#define ss second

#define mset multiset
#define mmap multimap
#define uset unordered_set
#define umap unordered_map
#define umset unordered_multiset
#define ummap unordered_multimap
#define pqueue priority_queue

#define sz(x) (int((x).size()))
#define len(x) (int((x).length()))
#define all(x) (x).begin(), (x).end()
#define clr(x) (x).clear()

#define ft front
#define bk back
#define pf push_front
#define pb push_back
#define popf pop_front
#define popb pop_back

#define lb lower_bound
#define ub upper_bound
#define bs binary_search

// -------------------- Constants -------------------- //

const int MAX = int(1e9 + 5);
const ll MAXL = ll(1e18 + 5);
const ll MOD = ll(1e9 + 7);
const ll MOD2 = ll(998244353);

// -------------------- Solution -------------------- //

int N;
double P;

inline bool test_students(vector<bool> mask) {
	assert(mask.size() == (size_t)N);

	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> ans, vans;

bool qry(int l, int r)
{
	vector<bool> msk(N, 0);
	for (int i = l; i <= r; i++) msk[i - 1] = 1;

	return test_students(msk);
}

int calc(int tl, int tr)
{
	if (tl == tr) {
		if (qry(tl, tl)) {
			ans[tl - 1] = 1;
			return tl;
		}

		ans[tl - 1] = 0;
		return -1;
	}

	int m = (tl + tr) / 2;


	if (qry(tl, m)) {
		if (tl == m) {
			ans[tl - 1] = 1;
			return tl;
		}
		return calc(tl, m);
	}
	for (int i = tl; i <= m; i++) ans[i - 1] = 0;

	if (qry(m + 1, tr)) {
		if (m + 1 == tr) {
			ans[m] = 1;
			return m + 1;
		}
		return calc(m + 1, tr);
	}
	for (int i = m + 1; i <= tr; i++) ans[i - 1] = 0;

	return - 1;
}

vector<bool> find_positive()
{
	int i, j;

	int h = max(1, int(db(N) * P));

	int len = N / h;

	int e;

	for (i = 1; i <= N; i) {
		e = calc(i, min(N, i + len - 1));
		if (e == -1) i += len;
		else i = e + 1;
	}

	return ans;
}

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

	ans.resize(N);

	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 'std::vector<bool> find_positive()':
Main.cpp:163:22: warning: for increment expression has no effect [-Wunused-value]
  163 |  for (i = 1; i <= N; i) {
      |                      ^
Main.cpp:155:9: warning: unused variable 'j' [-Wunused-variable]
  155 |  int i, j;
      |         ^
Main.cpp: In function 'bool test_students(std::vector<bool>)':
Main.cpp:103:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  103 |  scanf(" %c", &answer);
      |  ~~~~~^~~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:175:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  175 |  scanf("%d %lf %d", &N, &P, &T);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:191:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  191 |   scanf(" %c", &verdict);
      |   ~~~~~^~~~~~~~~~~~~~~~~

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 5 ms 344 KB Output is correct
3 Correct 4 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 9 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Correct 5 ms 344 KB Output is correct
17 Correct 0 ms 344 KB Output is correct

Subtask #2
43.000000002 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 34 ms 344 KB Output is correct (P=0.001, F=15.1, Q=15.0) -> 90.00 points
2 Correct 126 ms 344 KB Output is correct (P=0.005256, F=51.1, Q=62.8) -> 46.98 points
3 Correct 254 ms 344 KB Output is correct (P=0.011546, F=94.9, Q=120.8) -> 43.03 points
4 Correct 496 ms 344 KB Output is correct (P=0.028545, F=191.5, Q=243.5) -> 43.14 points
5 Correct 640 ms 344 KB Output is correct (P=0.039856, F=246.3, Q=313.6) -> 43.00 points
6 Correct 890 ms 344 KB Output is correct (P=0.068648, F=366.2, Q=457.6) -> 45.04 points
7 Correct 1258 ms 344 KB Output is correct (P=0.104571, F=490.3, Q=600.6) -> 47.37 points
8 Correct 1571 ms 344 KB Output is correct (P=0.158765, F=639.1, Q=759.8) -> 51.27 points
9 Correct 1835 ms 344 KB Output is correct (P=0.2, F=731.4, Q=869.6) -> 51.26 points