루미 알고리즘

#1561다이아Bootfall

PO 2023 훈련 캠프코딩출제 Nils Gustafsson영어 원문이 문제가 어렵다면 — 배우는 순서 보기

영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)

Problem

After the latest World Cup, some countries are considering withdrawing from FIFA and forming a new sport: bootfall. In bootfall, two teams with N players each compete. A player can be either a defender or an attacker, and before each match, the team gets to decide which role each player will have.

You are the coach of a team with N players, where the i-th player has an attack level a_i and a defense level d_i. The team's attack strength A is the sum of all a_i of the players who are attackers, and the team's defense strength D is the sum of d_i of those who are defenders. If the team faces another team with attack strength A' and defense strength D', your team will score max(0, A-D') goals, while the opposing team will score max(0, A'-D) goals.

Your team will face Q other teams, where the i-th team has attack strength A_i and defense strength D_i. Your task is to decide for each match who should defend and who should attack to achieve the best possible result (ideally, you want to win, then draw, and preferably not lose).

Input

The first line contains the integer N (1 ≤ N ≤ 400), the number of players on your team.

The following N lines contain two integers a_i and d_i (0 ≤ a_i, d_i ≤ 400), the attack strength and defense strength of player i.

The next line contains an integer Q (1 ≤ Q ≤ 3 · 10^5), the number of matches.

Then follow Q lines, each containing two integers A_i and D_i (0 ≤ A_i, D_i ≤ 160000), which means that your team faces a team with attack strength A_i and defense strength D_i.

Output

Print three integers w, d, l on a single line: the number of matches you will win, tie, and lose, if you optimally choose who will defend and attack each game.

Scoring

Your solution will be tested on a set of test groups, each worth a number of points. Each test group contains a set of test cases. To get the points for a test group you need to solve all test cases in the test group.

GroupPointsConstraints
111A_i = 0 for all 1 ≤ i ≤ Q
216N ≤ 5, Q ≤ 1000
320D_i = 0 for all 1 ≤ i ≤ Q
424N, a_i, d_i ≤ 30, Q ≤ 1000
529No additional constraints.

예제

예제 1

입력
4
2 3
1 1
0 2
5 1
5
5 5
6 5
7 10
10 0
12 0
출력
2 2 1

출처 표기

출처: Programmeringsolympiaden 2023년 훈련 캠프 · 원문 페이지 · 이용 조건 CC BY-SA · LaTeX 원문을 화면용 글로 옮겼습니다(수식·표의 모양이 다를 수 있습니다). 내용은 고치지 않았습니다.

크리에이티브 커먼즈 저작자표시-동일조건변경허락.

문제 출처: 한국정보올림피아드(KOI) (CC BY-NC-SA 4.0) · International Olympiad in Informatics (IOI) (CC BY) · Centre for Education in Mathematics and Computing (CEMC), University of Waterloo (CC BY-NC 4.0) · Programmeringsolympiaden (CC BY-SA) · CSES Problem Set (Antti Laaksonen) (CC BY-NC-SA 4.0). 루미 알고리즘은 위 단체들과 관계없는 별도의 서비스이며, 자료는 원문 그대로 싣습니다. 문제마다 출처와 이용 조건을 따로 표기합니다.