CCC '17 S1 - Sum Game - DMOJ: Modern Online Judge

CCC '17 S1 - Sum Game

Points: 3 (partial)

Time limit: 1.0s

Memory limit: 256M

Problem type

Canadian Computing Competition: 2017 Stage 1, Senior #1

Annie has two favourite baseball teams: the Swifts and the Semaphores. She has followed them throughout the season, which is now over. The season lasted for $N$ $N$ days. Both teams played exactly one game on each day.

For each day, Annie recorded the number of runs scored by the Swifts on that day. She also recorded this information for the Semaphores.

She would like you to determine the largest integer $K$ $K$ such that $K \le N$ $K \leq N$ and the Swifts and the Semaphores had scored the same total number of runs $K$ $K$ days after the start of the season. The total number of runs scored by a team after $K$ $K$ days is the sum of the number of runs scored by the team in all games before or on the $K$ $K$ -th day.

For example, if the Swifts and the Semaphores have the same total number of runs at the end of the season, then you should output $N$ $N$ . If the Swifts and the Semaphores never had the same number of runs after $K$ $K$ games, for any value of $K \le N$ $K \leq N$ , then output 0.

Input Specification

The first line of input will contain an integer $N$ $N$ $(1 \le N \le 100\,000)$ $(1 \leq N \leq 100 000)$ . The second line will contain $N$ $N$ space-separated non-negative integers representing the number of runs scored by the Swifts on each day, in order. The third line will contain $N$ $N$ space-separated non-negative integers representing the number of runs scored by the Semaphores on each day, in order. You may assume that each team scored at most $20$ $20$ runs in any single game.

For 7 of the 15 points available, $N \le 1\,000$ $N \leq 1 000$ .

Output Specification

Output the largest integer $K$ $K$ such that $K \le N$ $K \leq N$ and the Swifts and the Semaphores have the same total number of runs after $K$ $K$ days.

Sample Input 1

Copy

3
1 3 3
2 2 6

Sample Output 1

Copy

Explanation for Sample Output 1

After 2 days, each team had scored a total of 4 runs.

Sample Input 2

Copy

3
1 2 3
4 5 6

Sample Output 2

Copy

Explanation for Sample Output 2

The only time when the Swifts and the Semaphores had scored the same number of runs was at the beginning of the season.

Sample Input 3

Copy

4
1 2 3 4
1 3 2 4

Sample Output 3

Copy

Explanation for Sample Output 3

The Swifts and Semaphores have the same number of total runs after the first game, and after the third game, and after the fourth game. We take the largest of these values (1, 3 and 4) and output 4.

Comments

1

aarthisa commented on May 5, 2024, 9:32 p.m.

Hi, pls check if my code is correct https://dmoj.ca/src/6387257

Apparently my code works for Batch 1 but not for Batch 2 and batch 3, pls guide me how to fix or how i can see the use cases or the inputs for the failed cases.

1

JamesyihengWu commented on Jan. 8, 2024, 12:24 a.m.

This really made me have to rack my brain but it's very cool ;

2

Sanji_Vin commented on Dec. 17, 2023, 11:24 p.m.

should the input be a string in c ?

1

savirsingh commented on July 23, 2022, 11:23 p.m.

Anyone know why my solution doesn't work? https://dmoj.ca/src/4717382

-4

gavin_chen commented on June 12, 2022, 2:41 p.m.

can someone tell me how to make my code faster (Python 3)

2

sdesai8000 commented on Aug. 8, 2021, 4:38 p.m.

can anyone tell me why my code won't work?

2
andy_zhu23 commented on Aug. 8, 2021, 6:58 p.m. ← edit 4 →
put if(S == S1) outside of the nested for loop. In your code, if r == 0 but S == S1, it will also be added to preK which is incorrect

If you try the following

Copy
2 1 2 3 4

your code will print 2, but the correct output should be 0

2

sdesai8000 commented on Aug. 8, 2021, 7:10 p.m.

Thank you! My code works now. :D

4

orangewave commented on Dec. 14, 2019, 4:49 a.m.

TLE in python3. Can someone hint what I should be doing to avoid this? Thanks.

4

dizmac commented on Nov. 21, 2021, 6:59 p.m.

Keep a running count instead of re-computing the number of runs every time.

4

AidanB commented on Oct. 7, 2018, 2:20 a.m.

If you're getting a TLE in java, make sure you use a buffered reader.

2

Kevin03 commented on Jan. 6, 2019, 3:26 p.m.

what is a buffered reader

4

daniel236 commented on Jan. 6, 2019, 4:04 p.m. ← edit 4 →

BufferedReader is a Scanner in Java used for fast input, the reason it is so fast is because unlike Scanner it does not tokenize the input requiring the user to tokenize using either a tokenizer or .split, the DMOJ tips page has more info on this as well as oracle documentation

https://dmoj.ca/tips/#java-input

https://docs.oracle.com/javase/8/docs/api/java/io/BufferedReader.html