| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1320058 | nicolo_010 | 비스킷 담기 (IOI20_biscuits) | C++20 | 1 ms | 332 KiB |
#include <bits/stdc++.h>
#include "biscuits.h"
using namespace std;
using ll = long long;
using pii = pair<int, int>;
ll count_tastiness(ll x, vector<ll> a) {
int k = a.size();
ll sum=1;
for (int i=0; i<k; i++) {
if (sum >= (1<<i)) {
sum += (1<<i)*a[i];
}
else {
sum += sum*a[i];
}
}
return sum;
}| # | 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... | ||||
