Submission #3026939
Source Code Expand
#include <bits/stdc++.h> using namespace std; int main(){ int N; cin >> N; int a[100], b[100]; for(int i=0;i<N;i++) cin >> a[i]; for(int i=0;i<N;i++) cin >> b[i]; int MAX = 0; //下に移動する位置(0,N-1) for(int i=0;i<N;i++){ int C = 0; //Candies //N回の移動 int j=0; for(j=0;j<N;j++){ //1列目 if(j<i){ C += a[j]; }else if(j==i){ C += a[j]; C += b[j]; }else{ C += b[j]; } } if(MAX < C) MAX = C; } cout << MAX << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Candies |
User | Ichijyo |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 706 Byte |
Status | AC |
Exec Time | 1 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample01.txt, sample02.txt, sample03.txt, sample04.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, sample01.txt, sample02.txt, sample03.txt, sample04.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 1 ms | 256 KB |
02.txt | AC | 1 ms | 256 KB |
03.txt | AC | 1 ms | 256 KB |
04.txt | AC | 1 ms | 256 KB |
05.txt | AC | 1 ms | 256 KB |
06.txt | AC | 1 ms | 256 KB |
07.txt | AC | 1 ms | 256 KB |
08.txt | AC | 1 ms | 256 KB |
09.txt | AC | 1 ms | 256 KB |
10.txt | AC | 1 ms | 256 KB |
11.txt | AC | 1 ms | 256 KB |
12.txt | AC | 1 ms | 256 KB |
sample01.txt | AC | 1 ms | 256 KB |
sample02.txt | AC | 1 ms | 256 KB |
sample03.txt | AC | 1 ms | 256 KB |
sample04.txt | AC | 1 ms | 256 KB |