제출 #333320

#제출 시각아이디문제언어결과실행 시간메모리
333320nickmet2004비스킷 담기 (IOI20_biscuits)C++14
0 / 100
2 ms620 KiB
#include<bits/stdc++.h> #include "biscuits.h" #define ll long long using namespace std; ll X; ll dp[61] , Pr[61]; ll Q(ll a){ if(a < 0ll)return 0; if(!a) return 1; int j; for(int j = 60; ~j; --j) if((1ll << j) <= a)break; return dp[j] + Q(min(a , Pr[j] / X) - (1ll << j)); } ll count_tastiness(ll X , vector<ll> a){ int n = a.size(); X = X; for(int i = 0; i < n; ++i) if(i)Pr[i] = Pr[i - 1] + a[i] * (1ll << i); dp[0] = 1; /// 2^k___2^(k+1) - 1 /// dp[k + 1] = dp[k] + a; for(int k = 1; k < 61; ++k) dp[k] = Q((1ll << k) - 1); return dp[60]; } //int main (){}

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

biscuits.cpp: In function 'long long int Q(long long int)':
biscuits.cpp:12:16: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   12 |     return dp[j] + Q(min(a , Pr[j] / X) - (1ll << j));
      |            ~~~~^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...