제출 #480095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
480095		couplefire	비스킷 담기 (IOI20_biscuits)	C++17	9 / 100	1109 ms	192924 KiB

biscuits

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int K = 60;

map<int, int> dp[K];
int bound[K];

int dfs(int pos, int bd){
    if(bd<0) return 0; if(pos<0) return 1;
    if(dp[pos].count(bd)) return dp[pos][bd];
    return dp[pos][bd] = dfs(pos-1, min(bd, bound[pos-1]))+dfs(pos-1, min(bd-(1ll<<pos), bound[pos-1]));
}

int count_tastiness(int x, vector<int> cnt){
    cnt.resize(K); int cur = 0;
    for(int i = 0; i<K; ++i)
        cur += cnt[i]*(1ll<<i), bound[i] = cur/x, dp[i].clear();
    return dfs(K-1, bound[K-1]);
}

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

biscuits.cpp: In function 'long long int dfs(long long int, long long int)':
biscuits.cpp:11:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   11 |     if(bd<0) return 0; if(pos<0) return 1;
      |     ^~
biscuits.cpp:11:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   11 |     if(bd<0) return 0; if(pos<0) return 1;
      |                        ^~

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