oj.uz

답안 #1047517

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1047517 2024-08-07T13:48:10 Z nightfal 버섯 세기 (IOI20_mushrooms) C++17
88.9764 / 100
 5 ms 600 KB 
#include <vector>
#include <iostream>
#include <tuple>
using namespace std;
int use_machine(std::vector<int> x);

int count2(vector<int> &a, vector<int> &b, int &now, int n, int letter) {
    vector<int> m;
    int numA=0, numB=0;
    for(int i=0; i<a.size() && now < n; i++, now++) {
        m.push_back(a[i]); 
        m.push_back(now);
    }
    int result = use_machine(m);
    if (result%2) {numB++; b.push_back(m[m.size()-1]);}
    else {numA++; a.push_back(m[m.size()-1]);}
    numB += result/2; 
    numA += m.size()/2-1-result/2;
    
    if (letter) return numB;
    else return numA;
}

void count1(vector<int> &a, vector<int> &b, int num, int n) {
    int k = min(num,n);
    for(int i=3; i+1<k;  i+=2) {
        int result = use_machine({a[0],i,a[1],i+1});
        if (result%2) b.push_back(i+1);
        else a.push_back(i+1);
        if (result/2) b.push_back(i);
        else a.push_back(i);
    }
    if (k%2==0) {
        if(use_machine({a[0],k-1})) b.push_back(k-1);
        else a.push_back(k-1);
    }
    return;
}

int count_mushrooms(int n) {
    vector<int>a, b; a.push_back(0);
    int numA=0, number1=265;

    for(int i=1; i<min(3,n); i++)
        if (use_machine({0,i})) b.push_back(i);
        else a.push_back(i);
    if (n<=3) return a.size();

    if(a.size()>=b.size()) count1(a,b,number1,n);
    else count1(b,a,number1,n);

    if (n<=number1) return a.size();

    numA = a.size();
    while (number1 < n) {
        if(a.size()>=b.size()) numA += count2(a,b,number1,n,0);
        else numA += count2(b,a,number1,n,1);
    }
    return numA;
}

Compilation message

mushrooms.cpp: In function 'int count2(std::vector<int>&, std::vector<int>&, int&, int, int)':
mushrooms.cpp:10:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for(int i=0; i<a.size() && now < n; i++, now++) {
      |                  ~^~~~~~~~~

Subtask #1
88.9764 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 456 KB Output is correct
10 Partially correct 3 ms 344 KB Output is partially correct
11 Partially correct 5 ms 344 KB Output is partially correct
12 Partially correct 3 ms 344 KB Output is partially correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 344 KB Output is correct
15 Partially correct 4 ms 344 KB Output is partially correct
16 Partially correct 3 ms 600 KB Output is partially correct
17 Correct 3 ms 344 KB Output is correct
18 Correct 3 ms 452 KB Output is correct
19 Partially correct 5 ms 344 KB Output is partially correct
20 Correct 3 ms 344 KB Output is correct
21 Partially correct 4 ms 344 KB Output is partially correct
22 Partially correct 3 ms 344 KB Output is partially correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 2 ms 444 KB Output is correct
25 Partially correct 4 ms 344 KB Output is partially correct
26 Partially correct 4 ms 344 KB Output is partially correct
27 Partially correct 3 ms 344 KB Output is partially correct
28 Partially correct 3 ms 596 KB Output is partially correct
29 Partially correct 4 ms 344 KB Output is partially correct
30 Partially correct 3 ms 344 KB Output is partially correct
31 Partially correct 3 ms 344 KB Output is partially correct
32 Partially correct 3 ms 344 KB Output is partially correct
33 Partially correct 3 ms 344 KB Output is partially correct
34 Partially correct 3 ms 344 KB Output is partially correct
35 Partially correct 4 ms 344 KB Output is partially correct
36 Partially correct 3 ms 444 KB Output is partially correct
37 Partially correct 4 ms 344 KB Output is partially correct
38 Partially correct 3 ms 344 KB Output is partially correct
39 Partially correct 3 ms 344 KB Output is partially correct
40 Partially correct 4 ms 344 KB Output is partially correct
41 Partially correct 3 ms 448 KB Output is partially correct
42 Partially correct 3 ms 344 KB Output is partially correct
43 Partially correct 4 ms 344 KB Output is partially correct
44 Partially correct 4 ms 440 KB Output is partially correct
45 Partially correct 3 ms 344 KB Output is partially correct
46 Partially correct 3 ms 600 KB Output is partially correct
47 Partially correct 4 ms 344 KB Output is partially correct
48 Partially correct 3 ms 344 KB Output is partially correct
49 Partially correct 3 ms 444 KB Output is partially correct
50 Partially correct 4 ms 348 KB Output is partially correct
51 Partially correct 4 ms 344 KB Output is partially correct
52 Partially correct 4 ms 344 KB Output is partially correct
53 Partially correct 3 ms 356 KB Output is partially correct
54 Partially correct 3 ms 352 KB Output is partially correct
55 Partially correct 5 ms 356 KB Output is partially correct
56 Partially correct 5 ms 356 KB Output is partially correct
57 Partially correct 5 ms 352 KB Output is partially correct
58 Partially correct 3 ms 356 KB Output is partially correct
59 Partially correct 3 ms 460 KB Output is partially correct
60 Partially correct 3 ms 432 KB Output is partially correct
61 Partially correct 3 ms 344 KB Output is partially correct
62 Correct 1 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 1 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