Submission #3604977
Source Code Expand
N=int(input().strip()) maze=[] for _ in range(2): maze.append(list(map(int, input().split()))) ans=0 for i in range(N): ans=max(ans,sum(maze[0][:i+1])+sum(maze[1][i:])) print(ans)
Submission Info
Submission Time | |
---|---|
Task | C - Candies |
User | nphys |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 196 Byte |
Status | AC |
Exec Time | 17 ms |
Memory | 3060 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 | 17 ms | 2940 KB |
02.txt | AC | 17 ms | 2940 KB |
03.txt | AC | 17 ms | 2940 KB |
04.txt | AC | 17 ms | 2940 KB |
05.txt | AC | 17 ms | 2940 KB |
06.txt | AC | 17 ms | 2940 KB |
07.txt | AC | 17 ms | 2940 KB |
08.txt | AC | 17 ms | 3060 KB |
09.txt | AC | 17 ms | 3060 KB |
10.txt | AC | 17 ms | 2940 KB |
11.txt | AC | 17 ms | 2940 KB |
12.txt | AC | 17 ms | 3060 KB |
sample01.txt | AC | 17 ms | 2940 KB |
sample02.txt | AC | 17 ms | 2940 KB |
sample03.txt | AC | 17 ms | 3060 KB |
sample04.txt | AC | 17 ms | 3060 KB |