oj.uz

답안 #1117323

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1117323 2024-11-23T10:08:38 Z pokmui9909 버섯 세기 (IOI20_mushrooms) C++17
92.623 / 100
 9 ms 620 KB 
#include "mushrooms.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
 
#define x first
#define y second
 
int count_mushrooms(int N){
    ll B = min(N, 80), S = 1;
    vector<ll> P, Q;
    P.push_back(0);
    while(S < N && P.size() < B && Q.size() < B){
        if(S + 1 < N && P.size() >= 2){
            ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
            if(f / 2 == 0){
                P.push_back(S);
            } else {
                Q.push_back(S);
            }
            if(f % 2 == 0){
                P.push_back(S + 1);
            } else {
                Q.push_back(S + 1);
            }
            S += 2;
        } else if(S + 1 < N && Q.size() >= 2){
            ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
            if(f / 2 == 1){
                P.push_back(S);
            } else {
                Q.push_back(S);
            }
            if(f % 2 == 1){
                P.push_back(S + 1);
            } else {
                Q.push_back(S + 1);
            }
            S += 2;
        } else {
            ll f = use_machine((vector<int>){0, S});
            if(f == 0){
                P.push_back(S);
            } else {
                Q.push_back(S);
            }
            S++;
        }
    }
    ll Ans = P.size();
    for(ll i = S; i < N; i += B){
        B = max(P.size(), Q.size());
        vector<int> V;
        if(P.size() == B){
            for(ll j = 0; j < B; j++){
                if(i + j >= N) break;
                V.push_back(P[j]);
                V.push_back(i + j);
                Ans++;
            }
            ll t = use_machine(V);
            Ans -= (t / 2) + (t % 2);
            if(t % 2 == 0){
                P.push_back(V.back());
            } else {
                Q.push_back(V.back());
            }
        } else {
            for(ll j = 0; j < B; j++){
                if(i + j >= N) break;
                V.push_back(Q[j]);
                V.push_back(i + j);
            }
            ll t = use_machine(V);
            Ans += (t / 2) + (t % 2);
            if(t % 2 == 1){
                P.push_back(V.back());
            } else {
                Q.push_back(V.back());
            }
        }
    }
    return Ans;
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:13:29: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   13 |     while(S < N && P.size() < B && Q.size() < B){
      |                    ~~~~~~~~~^~~
mushrooms.cpp:13:45: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   13 |     while(S < N && P.size() < B && Q.size() < B){
      |                                    ~~~~~~~~~^~~
mushrooms.cpp:15:66: warning: narrowing conversion of 'P.std::vector<long long int>::operator[](0)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
   15 |             ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                                  ^
mushrooms.cpp:15:66: warning: narrowing conversion of 'P.std::vector<long long int>::operator[](0)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:15:52: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   15 |             ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                    ^
mushrooms.cpp:15:52: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:15:66: warning: narrowing conversion of 'P.std::vector<long long int>::operator[](1)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
   15 |             ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                                  ^
mushrooms.cpp:15:66: warning: narrowing conversion of 'P.std::vector<long long int>::operator[](1)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:15:63: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   15 |             ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                             ~~^~~
mushrooms.cpp:15:63: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:28:66: warning: narrowing conversion of 'Q.std::vector<long long int>::operator[](0)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
   28 |             ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                                  ^
mushrooms.cpp:28:66: warning: narrowing conversion of 'Q.std::vector<long long int>::operator[](0)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:28:52: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   28 |             ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                    ^
mushrooms.cpp:28:52: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:28:66: warning: narrowing conversion of 'Q.std::vector<long long int>::operator[](1)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
   28 |             ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                                  ^
mushrooms.cpp:28:66: warning: narrowing conversion of 'Q.std::vector<long long int>::operator[](1)' from '__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:28:63: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   28 |             ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                             ~~^~~
mushrooms.cpp:28:63: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:41:49: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   41 |             ll f = use_machine((vector<int>){0, S});
      |                                                 ^
mushrooms.cpp:41:49: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:54:21: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   54 |         if(P.size() == B){
      |            ~~~~~~~~~^~~~

Subtask #1
92.623 / 100.0

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