oj.uz

답안 #1037099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037099 2024-07-28T04:25:12 Z Raimond 버섯 세기 (IOI20_mushrooms) C++17
61.5804 / 100
 7 ms 600 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
 
#define N '\n';
#define VI <vector <int>>
#define VVI <vector <vector <int>>>  
 
int count_mushrooms(int n){
    int cnt = 1;    
    
    if(n <= 226){
        for(int i = 1; i < n; i++){
            cnt += 1 - use_machine({0, i});
        }
        return cnt;
    }
 
    vector <int> As = {0};
    vector <int> Bs;
    
    int mn = 10000, ans;
    for(int i = 1; i < 500; i++){
        if(2*i + ((n - (2*i)) / i) < mn){
            mn = 2*i + ((n - (2*i)) / i);
            ans = i;
        }
    }
 
    int unt = ans*2;
    // 188 - 1 = 187
    for(int i = 1; i < unt; i++){
        bool q = use_machine({0,i});
        if(q)
            Bs.push_back(i);
        else
            As.push_back(i);
    }
    cnt += As.size()-1;
    
    int i = unt;
    // n - 188 / 94
    for(; i < n;){
        if(As.size() >= Bs.size()){
            vector<int> search;
            vector <int> Is;
            int j = 0;
            for(; j < As.size() && i < n; j++ ){
                search.push_back(i);
                Is.push_back(i);
                search.push_back(As[j]);
                i++;
            }
            int q = use_machine(search);
            cnt +=  (search.size()/2) - ((q/2) +(q % 2));
            if(q/2 + q % 2 == 0){
                for(int ii = 0; ii < Is.size(); ii++){
                    As.push_back(Is[ii]);
                }
            }
            if(q % 2 != 0){
                Bs.push_back(Is[0]);
            }
        }
        else{
            vector<int> search;
            vector <int> Is;
            for(int j = 0; j < Bs.size() && i < n; j++){
                search.push_back(i);
                Is.push_back(i);
                search.push_back(Bs[j]);
                i++;
            }
 
            int q = use_machine(search);
            cnt +=  q/2 + q % 2;
            if(q/2 + q % 2 == 0 ){
                for(int ii = 0; ii < Is.size(); ii++){
                    Bs.push_back(Is[ii]);
                }
            }
            if(q % 2 != 0){
                As.push_back(Is[0]);
            }  
        }
    }
    // B A B A B A
    // B A A A B A B A
    return cnt;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:48:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |             for(; j < As.size() && i < n; j++ ){
      |                   ~~^~~~~~~~~~~
mushrooms.cpp:57:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |                 for(int ii = 0; ii < Is.size(); ii++){
      |                                 ~~~^~~~~~~~~~~
mushrooms.cpp:68:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |             for(int j = 0; j < Bs.size() && i < n; j++){
      |                            ~~^~~~~~~~~~~
mushrooms.cpp:78:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |                 for(int ii = 0; ii < Is.size(); ii++){
      |                                 ~~~^~~~~~~~~~~
mushrooms.cpp:30:9: warning: 'ans' may be used uninitialized in this function [-Wmaybe-uninitialized]
   30 |     int unt = ans*2;
      |         ^~~

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