oj.uz

답안 #1064359

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1064359 2024-08-18T11:51:26 Z new_acc 버섯 세기 (IOI20_mushrooms) C++14
92.623 / 100
 7 ms 724 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
int count_mushrooms(int n) {
	int c1 = use_machine({0,1});
    if(n==2) return 2-c1;
	int c2 = use_machine({0,2});
    if(n==3) return 3-c1-c2;
    vi x[2];
    x[0].push_back(0);
    if(c1) x[1].push_back(1);
    else x[0].push_back(1);
    if(c2) x[1].push_back(2);
    else x[0].push_back(2);
    bool ok=1;
    int a=0,b=0;
    if(!c1) a=0,b=1;
    else{
        if(!c2) a=0,b=2;
        else ok^=1,a=1,b=2;
    }
    int g=3;
    for(int i=3;i<n-1;i+=2){
        if(x[0].size()>=80 or x[1].size()>=80) break;
        int c3=use_machine({i,a,i+1,b});      
        if((c3&1)) x[ok].push_back(i);
        else x[ok^1].push_back(i);
        if((c3&2)) x[ok].push_back(i+1);
        else x[ok^1].push_back(i+1);
        g=i+2;
    }
    int res=x[0].size();
    for(int i=g;i<n;){
        vi pom=x[0];
        bool odw=0;
        if(x[1].size()>x[0].size()){
            odw=1;
            pom=x[1];
        }
        vi pom2;
        int i2;
        for(i2=0;i2+i<n and i2<(int)pom.size();i2++){
            pom2.push_back(pom[i2]);
            pom2.push_back(i+i2);
        }
        i+=i2; 
        int c3=use_machine(pom2);
        if(!odw) c3=pom2.size()-1-c3;
        if(c3%2==1) x[0].push_back(i-1);
        else x[1].push_back(i-1);
        res+=(c3+1)/2;
    }
	return res;
}

Subtask #1
92.623 / 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 1 ms 344 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 6 ms 344 KB Output is correct
9 Correct 3 ms 344 KB Output is correct
10 Correct 4 ms 460 KB Output is correct
11 Partially correct 3 ms 464 KB Output is partially correct
12 Correct 3 ms 344 KB Output is correct
13 Correct 5 ms 600 KB Output is correct
14 Correct 3 ms 464 KB Output is correct
15 Partially correct 4 ms 704 KB Output is partially correct
16 Partially correct 5 ms 344 KB Output is partially correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 3 ms 344 KB Output is correct
19 Partially correct 3 ms 464 KB Output is partially correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 3 ms 344 KB Output is correct
22 Partially correct 6 ms 612 KB Output is partially correct
23 Correct 3 ms 344 KB Output is correct
24 Correct 2 ms 344 KB Output is correct
25 Partially correct 3 ms 448 KB Output is partially correct
26 Partially correct 4 ms 344 KB Output is partially correct
27 Partially correct 4 ms 344 KB Output is partially correct
28 Partially correct 4 ms 344 KB Output is partially correct
29 Partially correct 4 ms 480 KB Output is partially correct
30 Partially correct 4 ms 344 KB Output is partially correct
31 Partially correct 4 ms 724 KB Output is partially correct
32 Partially correct 3 ms 476 KB Output is partially correct
33 Partially correct 5 ms 616 KB Output is partially correct
34 Partially correct 3 ms 596 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 5 ms 456 KB Output is partially correct
37 Partially correct 4 ms 344 KB Output is partially correct
38 Partially correct 4 ms 484 KB Output is partially correct
39 Partially correct 4 ms 344 KB Output is partially correct
40 Partially correct 3 ms 344 KB Output is partially correct
41 Partially correct 6 ms 344 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 4 ms 480 KB Output is partially correct
44 Partially correct 5 ms 468 KB Output is partially correct
45 Partially correct 5 ms 344 KB Output is partially correct
46 Partially correct 3 ms 468 KB Output is partially correct
47 Partially correct 4 ms 344 KB Output is partially correct
48 Partially correct 4 ms 600 KB Output is partially correct
49 Partially correct 5 ms 344 KB Output is partially correct
50 Partially correct 3 ms 344 KB Output is partially correct
51 Partially correct 6 ms 344 KB Output is partially correct
52 Partially correct 3 ms 472 KB Output is partially correct
53 Partially correct 3 ms 344 KB Output is partially correct
54 Partially correct 4 ms 600 KB Output is partially correct
55 Partially correct 5 ms 600 KB Output is partially correct
56 Partially correct 7 ms 476 KB Output is partially correct
57 Partially correct 7 ms 596 KB Output is partially correct
58 Partially correct 4 ms 344 KB Output is partially correct
59 Partially correct 6 ms 448 KB Output is partially correct
60 Partially correct 4 ms 344 KB Output is partially correct
61 Partially correct 3 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 344 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