제출 #546873

#제출 시각아이디문제언어결과실행 시간메모리
546873LucaDantas비스킷 담기 (IOI20_biscuits)C++17
42 / 100
1080 ms620 KiB
#include "biscuits.h" #include <bits/stdc++.h> using namespace std; long long brute(long long x, std::vector<long long> a) { long long ans = 0; while(a.size() < 20) a.push_back(0); for(int mask = 0; mask <= 100000; mask++) { long long tem = 0; bool ok = 1; for(int b = 0; b < 20; b++) { tem += a[b]; if(mask&(1<<b)) { if(tem >= x) tem -= x; else {ok = 0; break;} } tem >>= 1; } ans += ok; } return ans; } long long x_leq_10000(long long x, std::vector<long long> a) { while(a.size() < 128) a.push_back(0); for(int i = 0; i+1 < a.size(); i++) { if(a[i] <= x) continue; if((a[i]&1)==(x&1)) { a[i+1] += (a[i] - x) >> 1; a[i] = x; } else { a[i+1] += (a[i] - x - 1) >> 1; a[i] = x+1; } } long long dp[20010]{}, new_dp[20010]{}; dp[0] = 1, dp[x] = 1; for(int i = (int)(a.size()) - 1; i >= 0; i--) { for(int qtd = 0; qtd <= x; qtd++) new_dp[qtd] = dp[(a[i] + qtd)/2] + (a[i]+qtd >= x ? dp[(a[i] + qtd - x) / 2] : 0); for(int qtd = 0; qtd <= x; qtd++) dp[qtd] = new_dp[qtd]; } return dp[0]; } long long count_tastiness(long long x, std::vector<long long> a) { if(x <= 10000) return x_leq_10000(x, a); return brute(x, a); }

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

biscuits.cpp: In function 'long long int x_leq_10000(long long int, std::vector<long long int>)':
biscuits.cpp:27:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   27 |     for(int i = 0; i+1 < a.size(); i++) {
      |                    ~~~~^~~~~~~~~~
#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...