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