제출 #1033477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1033477		Zicrus	비스킷 담기 (IOI20_biscuits)	C++17	42 / 100	1094 ms	29276 KiB

biscuits

#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;

typedef long long ll;

ll sub3(ll x, vector<ll> a) {
    ll n = a.size();
    ll m = 6*x;
    vector<vector<ll>> dp(n, vector<ll>(m));
    for (int i = 0; i < m; i++) {
        dp.back()[i] = i/x + 1;
    }
 
    for (int i = n-2; i >= 0; i--) {
        for (int j = 0; j < m; j++) {
            dp[i][j] = dp[i+1][a[i+1] + j/2];
            if (j >= x) {
                dp[i][j] += dp[i+1][a[i+1] + (j-x)/2];
            }
        }
    }
 
    return dp[0][a[0]];
}

vector<map<ll, ll>> dp;

ll numWays(const ll &n, const ll &m, const ll &mxN, const ll &x, const vector<ll> &a) {
    if (n == mxN) return m/x + 1;
    if (dp[n][m]) return dp[n][m];

    ll res = numWays(n+1, a[n+1] + m/2, mxN, x, a);
    if (m >= x) {
        res += numWays(n+1, a[n+1] + (m-x)/2, mxN, x, a);
    }

    return dp[n][m] = res;
}

ll count_tastiness(ll x, vector<ll> a) {
    for (int i = 0; i < a.size(); i++) {
        ll transfer = max(0ll, (a[i]-x) / (2*x));
        if (transfer > 0) {
            if (i+1 >= a.size()) a.push_back(x*transfer);
            else a[i+1] += x*transfer;
            a[i] -= 2*x*transfer;
        }
    }

    if (x <= 10000) return sub3(x, a);

    ll n = a.size();
    dp = vector<map<ll, ll>>(n-1);
    ll res = numWays(0, a[0], n-1, x, a);
    return res;
}

컴파일 시 표준 에러 (stderr) 메시지

biscuits.cpp: In function 'll count_tastiness(ll, std::vector<long long int>)':
biscuits.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 0; i < a.size(); i++) {
      |                     ~~^~~~~~~~~~
biscuits.cpp:45:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |             if (i+1 >= a.size()) a.push_back(x*transfer);
      |                 ~~~~^~~~~~~~~~~

• Subtask 1: 9 / 9
• Subtask 2: 12 / 12
• Subtask 3: 21 / 21
• Subtask 4: 0 / 35
• Subtask 5: 0 / 23