No tags yet

No tag edit access

The problem statement has recently been changed. View the changes.

×
Time limit per test: 0.25 second(s)

Memory limit: 65536 kilobytes

Memory limit: 65536 kilobytes

input: standard

output: standard

output: standard

Breaking news! A Russian billionaire has bought a yet undisclosed NBA team. He's planning to invest huge effort and money into making that team the best. And in fact he's been very specific about the expected result: the first place.

Being his advisor, you need to determine whether it's possible for your team to finish first in its division or not.

More formally, the NBA regular season is organized as follows: all teams play some games, in each game one team wins and one team loses. Teams are grouped into divisions, some games are between the teams in the same division, and some are between the teams in different divisions.

Given the current score and the total number of remaining games for each team of your division, and the number of remaining games between each pair of teams in your division, determine if it's possible for your team to score at least as much wins as any other team in your division.

The second line of input contains

The third line of input contains

The next

All the numbers in input are non-negative and don't exceed 10\,000.

YES" (without quotes) if it's possible for the team 1 to score at least as much wins as any other team of its division, and "

NO" (without quotes) otherwise.

sample input | sample output |

3 1 2 2 1 1 1 0 0 0 0 0 0 0 0 0 | YES |

sample input | sample output |

3 1 2 2 1 1 1 0 0 0 0 0 1 0 1 0 | NO |

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/22/2021 20:11:40 (j1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|