oj.uz

답안 #415658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
415658 2021-06-01T10:41:36 Z MKopchev 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 13 ms 448 KB 
#include "mushrooms.h"
#include<bits/stdc++.h>
using namespace std;

int use_machine(std::vector<int> x);
/*
int other(int n,int t)
{
    int ret=t+2;

    int SZ=t+1;

    n=n-3-2*t;

    while(n>=0)
    {
        n=n-SZ;
        ret++;

        if(n>0)
        {
            n=n-SZ;
            ret++;
        }

        SZ++;
    }

    return ret;
}
int eval(int n)
{
    for(int t=1;t<=300;t++)
    {
        cout<<t<<" -> "<<other(n,t)<<endl;
    }
}
*/
int count_mushrooms(int n) {

    //cout<<"n= "<<n<<endl;

    if(n<=200)
    {
        int ret=1;

        for(int i=1;i<n;i++)
            ret+=1-use_machine({0,i});

        return ret;
    }
    //cout<<eval(2e4)<<endl;

	int outp=1;

	vector<int> seen[2]={{},{}};

	seen[0].push_back(0);

	int pointer=1;

	int BLOCK=85;

	while(seen[0].size()<2&&seen[1].size()<2)
    {
        int cur=use_machine({0,pointer});

        seen[cur].push_back(pointer);

        pointer++;

        outp=outp+(1-cur);
    }

    for(int i=0;i<BLOCK;i++)
    {
        //cout<<"i "<<i<<" pointer "<<pointer<<endl;

        int id=0;
        if(seen[id].size()<2)id=1;

        vector<int> me={seen[id][0],pointer,seen[id][1],pointer+1};

        int cnt[2]={0,0};

        int cur=use_machine(me);

        if(cur/2==0)
        {
            seen[id].push_back(pointer);
            cnt[id]++;
        }
        else
        {
            seen[!id].push_back(pointer);
            cnt[!id]++;
        }

        if(cur%2==0)
        {
            seen[id].push_back(pointer+1);
            cnt[id]++;
        }
        else
        {
            seen[!id].push_back(pointer+1);
            cnt[!id]++;
        }

        outp+=cnt[0];

        pointer+=2;
    }

	while(pointer<n)
    {
        int id=0;
        if(seen[0].size()<seen[1].size())id=1;

        vector<int> me={};

        for(auto w:seen[id])
        {
            me.push_back(w);
            me.push_back(pointer);

            pointer++;

            if(pointer==n)break;
        }

        int cur=use_machine(me);

        int cnt[2]={0,0};

        cnt[!id]=cur/2+cur%2;
        cnt[id]=me.size()/2-cnt[!id];

        outp+=cnt[0];

        /*
        cout<<"me: ";for(auto w:me)cout<<w<<" ";cout<<endl;
        cout<<"cnt: "<<cnt[0]<<" "<<cnt[1]<<endl;
        */

        if(cur%2==0)seen[id].push_back(me.back());
        else seen[!id].push_back(me.back());
    }

    return outp;
}
/*
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() {

	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.

    n=2e4;

    species.resize(n);

    for(int i=1;i<n;i++)
        species[i]=rand()%2;

    int outp=0;
    for(int i=0;i<n;i++)
        outp+=1-species[i];

    cout<<"outp= "<<outp<<endl;

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

Subtask #1
92.623 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 200 KB Output is correct
2 Correct 1 ms 200 KB Output is correct
3 Correct 1 ms 200 KB Output is correct
4 Correct 2 ms 200 KB Output is correct
5 Correct 5 ms 200 KB Output is correct
6 Correct 2 ms 200 KB Output is correct
7 Correct 9 ms 288 KB Output is correct
8 Correct 9 ms 288 KB Output is correct
9 Correct 8 ms 200 KB Output is correct
10 Correct 9 ms 200 KB Output is correct
11 Partially correct 13 ms 204 KB Output is partially correct
12 Correct 11 ms 428 KB Output is correct
13 Correct 12 ms 300 KB Output is correct
14 Correct 8 ms 320 KB Output is correct
15 Partially correct 9 ms 200 KB Output is partially correct
16 Partially correct 6 ms 320 KB Output is partially correct
17 Correct 6 ms 300 KB Output is correct
18 Correct 9 ms 200 KB Output is correct
19 Partially correct 8 ms 200 KB Output is partially correct
20 Correct 12 ms 200 KB Output is correct
21 Correct 9 ms 200 KB Output is correct
22 Partially correct 10 ms 200 KB Output is partially correct
23 Correct 8 ms 200 KB Output is correct
24 Correct 6 ms 312 KB Output is correct
25 Partially correct 12 ms 308 KB Output is partially correct
26 Partially correct 10 ms 200 KB Output is partially correct
27 Partially correct 11 ms 200 KB Output is partially correct
28 Partially correct 10 ms 316 KB Output is partially correct
29 Partially correct 11 ms 304 KB Output is partially correct
30 Partially correct 9 ms 200 KB Output is partially correct
31 Partially correct 6 ms 324 KB Output is partially correct
32 Partially correct 10 ms 324 KB Output is partially correct
33 Partially correct 12 ms 300 KB Output is partially correct
34 Partially correct 9 ms 448 KB Output is partially correct
35 Partially correct 11 ms 200 KB Output is partially correct
36 Partially correct 9 ms 328 KB Output is partially correct
37 Partially correct 10 ms 336 KB Output is partially correct
38 Partially correct 9 ms 200 KB Output is partially correct
39 Partially correct 9 ms 320 KB Output is partially correct
40 Partially correct 9 ms 200 KB Output is partially correct
41 Partially correct 9 ms 200 KB Output is partially correct
42 Partially correct 9 ms 200 KB Output is partially correct
43 Partially correct 6 ms 324 KB Output is partially correct
44 Partially correct 9 ms 200 KB Output is partially correct
45 Partially correct 12 ms 284 KB Output is partially correct
46 Partially correct 11 ms 308 KB Output is partially correct
47 Partially correct 8 ms 200 KB Output is partially correct
48 Partially correct 10 ms 332 KB Output is partially correct
49 Partially correct 7 ms 200 KB Output is partially correct
50 Partially correct 9 ms 328 KB Output is partially correct
51 Partially correct 6 ms 320 KB Output is partially correct
52 Partially correct 9 ms 200 KB Output is partially correct
53 Partially correct 10 ms 304 KB Output is partially correct
54 Partially correct 9 ms 308 KB Output is partially correct
55 Partially correct 8 ms 328 KB Output is partially correct
56 Partially correct 9 ms 308 KB Output is partially correct
57 Partially correct 9 ms 320 KB Output is partially correct
58 Partially correct 10 ms 348 KB Output is partially correct
59 Partially correct 9 ms 320 KB Output is partially correct
60 Partially correct 9 ms 316 KB Output is partially correct
61 Partially correct 6 ms 328 KB Output is partially correct
62 Correct 1 ms 200 KB Output is correct
63 Correct 1 ms 200 KB Output is correct
64 Correct 1 ms 200 KB Output is correct
65 Correct 1 ms 200 KB Output is correct
66 Correct 1 ms 200 KB Output is correct
67 Correct 1 ms 200 KB Output is correct
68 Correct 1 ms 200 KB Output is correct
69 Correct 1 ms 200 KB Output is correct
70 Correct 1 ms 200 KB Output is correct
71 Correct 1 ms 200 KB Output is correct
72 Correct 2 ms 200 KB Output is correct
73 Correct 1 ms 200 KB Output is correct
74 Correct 1 ms 200 KB Output is correct
75 Correct 1 ms 200 KB Output is correct
76 Correct 1 ms 200 KB Output is correct
77 Correct 1 ms 200 KB Output is correct
78 Correct 1 ms 200 KB Output is correct
79 Correct 1 ms 200 KB Output is correct
80 Correct 2 ms 200 KB Output is correct
81 Correct 1 ms 200 KB Output is correct
82 Correct 2 ms 200 KB Output is correct
83 Correct 1 ms 200 KB Output is correct
84 Correct 1 ms 200 KB Output is correct
85 Correct 1 ms 200 KB Output is correct
86 Correct 1 ms 200 KB Output is correct
87 Correct 2 ms 200 KB Output is correct
88 Correct 1 ms 200 KB Output is correct
89 Correct 1 ms 200 KB Output is correct
90 Correct 1 ms 200 KB Output is correct
91 Correct 1 ms 200 KB Output is correct