| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1292811 | Sofiatpc | 비스킷 담기 (IOI20_biscuits) | C++20 | 1096 ms | 572 KiB |
#include "biscuits.h"
#include <bits/stdc++.h>
using namespace std;
long long count_tastiness(long long x, vector<long long> a) {
int sum = 0;
for(int i = 0; i < a.size(); i++)sum += a[i]*(1<<i);
a.push_back(0);
int ans = 0;
for(int y = 0; y <= sum; y++){
int cur = 0, b = 1;
for(int i = 0; i < a.size(); i++){
if(y & (1<<i)){
if(a[i]+cur < x){b = 0; break;}
cur = (a[i]+cur-x)/2;
}
else if(a[i]+cur > 1)cur = (a[i]+cur)/2;
else cur = 0;
}
ans += b;
}
return ans;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
