| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1352485 | mxhrvs | Candy (EGOI23_candy) | C++20 | 1 ms | 344 KiB |
#include<bits/stdc++.h>
using namespace std;
signed main(){
int n,f,t;
cin >> n >> f >> t;
int a[n+1];
int sum = 0;
for(int i = 1; i <= n; i ++){
cin >> a[i];
sum += a[i];
}
if(a[1] > 1){
if(f == 1){
if(a[1] >= t) cout << 0 << "\n";
else cout << 1 << "\n";
}
else{
if(a[1] + a[2] >= t) cout << 0 << "\n";
else cout << "NO\n";
}
}
else{
if(sum < t or f < t) cout << "NO\n";
else{
int cnt = 0;
for(int i = 1; i <= f; i ++){
if(a[i] == 0) cnt += f - i + 1;
}
cout << cnt << "\n";
}
}
}| # | 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... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
