oj.uz

답안 #1052548

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1052548 2024-08-10T16:02:12 Z dozer 버섯 세기 (IOI20_mushrooms) C++14
10 / 100
 128 ms 384 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define sp " "
#define endl "\n"
#define pii pair<int, int>
#define st first
#define nd second
#define pb push_back
#define ll long long
#define LL node * 2
#define RR node * 2 + 1
#define N 300005
#define LOGN 16

const int modulo = 1e9 + 7;
const ll INF = 2e18 + 7;


int count_mushrooms(int n) {
	int ans = 1;
	for (int i = 1; i < n; i++)
		ans += 1 - use_machine({0, i});
	return ans;
}
/*
static char fmt_buffer[100000];
#define FMT_TO_STR(fmt, result) va_list vargs; va_start(vargs, fmt); \
	vsnprintf(fmt_buffer, sizeof(fmt_buffer), fmt, vargs); \
	va_end(vargs); fmt_buffer[sizeof(fmt_buffer)-1] = 0; \
	std::string result(fmt_buffer);

static const int min_n = 2;
static const int max_n = 20000;
static const int max_qc = 20000;
static const int max_qs = 100000;
static const int species_A = 0;
static const int species_B = 1;

static int n;
static std::vector<int> species;
static int qc, qs;

static inline void error_if(bool cond, std::string message) {
	if (cond) {
		printf("%s\n", message.c_str());
		exit(0);
	}
}

static inline void wrong_if(bool cond, std::string message) {
	error_if(cond, "Wrong Answer: "+message);
}

int use_machine(std::vector<int> x) {
	const int xs = x.size();
	wrong_if(xs < 2, "Too small array for query.");
	wrong_if(xs > n, "Too large array for query.");
	qc++;
	wrong_if(qc > max_qc, "Too many queries.");
	qs += xs;
	wrong_if(qs > max_qs, "Too many total array sizes as queries.");
	for (int i = 0; i < xs; i++)
		wrong_if(x[i] < 0 || n - 1 < x[i], "Invalid value in the query array.");
	std::vector<bool> used(n, false);
	for (int i = 0; i < xs; i++) {
		wrong_if(used[x[i]], "Duplicate value in the query array.");
		used[x[i]] = true;
	}
	int diffs = 0;
	for (int i = 1; i < xs; i++)
		diffs += int(species[x[i]] != species[x[i-1]]);
	return diffs;
}

#ifdef __GNUC__
__attribute__ ((format(printf, 2, 3)))
#endif
static inline void check_input(bool cond, const char* message_fmt, ...) {
	FMT_TO_STR(message_fmt, message);
	error_if(!cond, "Invalid input: "+message);
}

int main() {
	fileio();
	check_input(1 == scanf("%d", &n), "Could not read n.");
	check_input(min_n <= n, "n must not be less than %d, but it is %d.", min_n, n);
	check_input(n <= max_n, "n must not be greater than %d, but it is %d.", max_n, n);
	species.resize(n);
	for (int i = 0; i < n; i++) {
		check_input(1 == scanf("%d", &species[i]), "Could not read species element [%d].", i);
		check_input(species[i]==species_A || species[i] == species_B,
					"Species elements must be %d or %d, but species element [%d] is %d.", species_A, species_B, i, species[i]);
	}
	check_input(species[0] == species_A, "Species element [%d] must be %d.", 0, species_A);
	// Postponed closing standard input in order to allow interactive usage of the grader.

	qc = 0;
	qs = 0;
	int answer = count_mushrooms(n);
	printf("%d\n%d\n", answer, qc);
	fclose(stdout);
	fclose(stdin);
	return 0;
}*/

Subtask #1
10.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Partially correct 6 ms 344 KB Output is partially correct
7 Partially correct 90 ms 344 KB Output is partially correct
8 Partially correct 101 ms 344 KB Output is partially correct
9 Partially correct 96 ms 344 KB Output is partially correct
10 Partially correct 94 ms 344 KB Output is partially correct
11 Partially correct 85 ms 344 KB Output is partially correct
12 Partially correct 87 ms 344 KB Output is partially correct
13 Partially correct 86 ms 344 KB Output is partially correct
14 Partially correct 51 ms 344 KB Output is partially correct
15 Partially correct 94 ms 344 KB Output is partially correct
16 Partially correct 105 ms 344 KB Output is partially correct
17 Partially correct 42 ms 344 KB Output is partially correct
18 Partially correct 90 ms 344 KB Output is partially correct
19 Partially correct 96 ms 344 KB Output is partially correct
20 Partially correct 99 ms 344 KB Output is partially correct
21 Partially correct 89 ms 344 KB Output is partially correct
22 Partially correct 85 ms 344 KB Output is partially correct
23 Partially correct 102 ms 344 KB Output is partially correct
24 Partially correct 55 ms 344 KB Output is partially correct
25 Partially correct 102 ms 344 KB Output is partially correct
26 Partially correct 122 ms 344 KB Output is partially correct
27 Partially correct 85 ms 344 KB Output is partially correct
28 Partially correct 102 ms 344 KB Output is partially correct
29 Partially correct 104 ms 344 KB Output is partially correct
30 Partially correct 91 ms 344 KB Output is partially correct
31 Partially correct 104 ms 344 KB Output is partially correct
32 Partially correct 87 ms 344 KB Output is partially correct
33 Partially correct 113 ms 344 KB Output is partially correct
34 Partially correct 105 ms 344 KB Output is partially correct
35 Partially correct 95 ms 344 KB Output is partially correct
36 Partially correct 81 ms 344 KB Output is partially correct
37 Partially correct 96 ms 344 KB Output is partially correct
38 Partially correct 98 ms 344 KB Output is partially correct
39 Partially correct 90 ms 344 KB Output is partially correct
40 Partially correct 108 ms 344 KB Output is partially correct
41 Partially correct 97 ms 344 KB Output is partially correct
42 Partially correct 83 ms 344 KB Output is partially correct
43 Partially correct 93 ms 344 KB Output is partially correct
44 Partially correct 128 ms 344 KB Output is partially correct
45 Partially correct 85 ms 344 KB Output is partially correct
46 Partially correct 83 ms 344 KB Output is partially correct
47 Partially correct 107 ms 344 KB Output is partially correct
48 Partially correct 78 ms 344 KB Output is partially correct
49 Partially correct 109 ms 344 KB Output is partially correct
50 Partially correct 88 ms 344 KB Output is partially correct
51 Partially correct 86 ms 344 KB Output is partially correct
52 Partially correct 98 ms 344 KB Output is partially correct
53 Partially correct 86 ms 344 KB Output is partially correct
54 Partially correct 92 ms 344 KB Output is partially correct
55 Partially correct 86 ms 344 KB Output is partially correct
56 Partially correct 87 ms 344 KB Output is partially correct
57 Partially correct 104 ms 344 KB Output is partially correct
58 Partially correct 88 ms 344 KB Output is partially correct
59 Partially correct 84 ms 344 KB Output is partially correct
60 Partially correct 81 ms 344 KB Output is partially correct
61 Partially correct 117 ms 344 KB Output is partially correct
62 Correct 0 ms 344 KB Output is correct
63 Correct 0 ms 344 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 344 KB Output is correct
66 Correct 0 ms 344 KB Output is correct
67 Correct 0 ms 344 KB Output is correct
68 Correct 0 ms 344 KB Output is correct
69 Correct 0 ms 344 KB Output is correct
70 Correct 0 ms 344 KB Output is correct
71 Correct 0 ms 344 KB Output is correct
72 Correct 0 ms 344 KB Output is correct
73 Correct 0 ms 344 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 344 KB Output is correct
76 Correct 0 ms 344 KB Output is correct
77 Correct 0 ms 344 KB Output is correct
78 Correct 0 ms 344 KB Output is correct
79 Correct 0 ms 344 KB Output is correct
80 Correct 0 ms 344 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 344 KB Output is correct
83 Correct 0 ms 344 KB Output is correct
84 Correct 0 ms 384 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 344 KB Output is correct
87 Correct 0 ms 344 KB Output is correct
88 Correct 0 ms 344 KB Output is correct
89 Correct 0 ms 344 KB Output is correct
90 Correct 0 ms 344 KB Output is correct
91 Correct 0 ms 344 KB Output is correct