oj.uz

답안 #1117302

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1117302 2024-11-23T09:34:43 Z pokmui9909 버섯 세기 (IOI20_mushrooms) C++17
0 / 100
 3 ms 336 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, 141), S = 1;
    vector<ll> P, Q;
    P.push_back(0);
    ll F = 0;
    while(S < N && P.size() < 2 && Q.size() < 2){
        ll f = use_machine((vector<int>){0, S});
        if(f == 0){
            P.push_back(S);
        } else {
            Q.push_back(S);
        }
        S++;

        F += 2;
    }
    while(S < N && P.size() < B && Q.size() < B){
        if(S + 1 < N){
            if(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);
                }
            } else {
                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;

            F += 4;
        } else {
            ll f = use_machine((vector<int>){0, S});
            if(f == 0){
                P.push_back(S);
            } else {
                Q.push_back(S);
            }
            S++;

            F += 2;
        }
    }
    B = max(P.size(), Q.size());
    ll Rev = 0;
    if(Q.size() == B){
        Rev = 1;
        swap(P, Q);
    }
    ll Ans = P.size();
    for(ll i = S; i < N; i += B){
        vector<int> V;
        for(ll j = 0; j < B; j++){
            if(i + j >= N) break;
            if(j % 2 == 0) V.push_back(P[j]);
            V.push_back(i + j);
            Ans++;
        }
        ll t = use_machine(V);
        Ans -= (t / 2) + (t % 2);

        F += V.size();
    }
    assert(F <= 100000);
    return (Rev == 0 ? Ans : N - Ans);
}

Compilation message

mushrooms.cpp: In function 'int count_mushrooms(int)':
mushrooms.cpp:15:45: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   15 |         ll f = use_machine((vector<int>){0, S});
      |                                             ^
mushrooms.cpp:15:45: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:25: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]
   25 |     while(S < N && P.size() < B && Q.size() < B){
      |                    ~~~~~~~~~^~~
mushrooms.cpp:25: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]
   25 |     while(S < N && P.size() < B && Q.size() < B){
      |                                    ~~~~~~~~~^~~
mushrooms.cpp:28:70: 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]
   28 |                 ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                                      ^
mushrooms.cpp:28:70: 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:28:56: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   28 |                 ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                        ^
mushrooms.cpp:28:56: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:28:70: 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]
   28 |                 ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                                      ^
mushrooms.cpp:28:70: 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:28:67: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   28 |                 ll f = use_machine((vector<int>){P[0], S, P[1], S + 1});
      |                                                                 ~~^~~
mushrooms.cpp:28:67: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:40:70: 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]
   40 |                 ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                                      ^
mushrooms.cpp:40:70: 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:40:56: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   40 |                 ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                        ^
mushrooms.cpp:40:56: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:40:70: 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]
   40 |                 ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                                      ^
mushrooms.cpp:40:70: 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:40:67: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   40 |                 ll f = use_machine((vector<int>){Q[0], S, Q[1], S + 1});
      |                                                                 ~~^~~
mushrooms.cpp:40:67: warning: narrowing conversion of '(S + 1)' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:56:49: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
   56 |             ll f = use_machine((vector<int>){0, S});
      |                                                 ^
mushrooms.cpp:56:49: warning: narrowing conversion of 'S' from 'll' {aka 'long long int'} to 'int' [-Wnarrowing]
mushrooms.cpp:69:17: 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]
   69 |     if(Q.size() == B){
      |        ~~~~~~~~~^~~~

Subtask #1
0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 1 ms 336 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 2 ms 336 KB Output is correct
6 Incorrect 3 ms 336 KB Answer is not correct.
7 Halted 0 ms 0 KB -