Codeforces Round #323 (Div. 2) 583A. Asphalting Roads
来源:互联网 发布:上班记录软件 编辑:程序博客网 时间:2024/06/07 05:23
解题报告 Codeforces Round #323 Editorial
City X consists of n vertical and n horizontal infinite roads, forming n × n intersections. Roads (both vertical and horizontal) are numbered from 1 to n, and the intersections are indicated by the numbers of the roads that form them.
Sand roads have long been recognized out of date, so the decision was made to asphalt them. To do this, a team of workers was hired and a schedule of work was made, according to which the intersections should be asphalted.
Road repairs are planned for n2 days. On the i-th day of the team arrives at the i-th intersection in the list and if none of the two roads that form the intersection were already asphalted they asphalt both roads. Otherwise, the team leaves the intersection, without doing anything with the roads.
According to the schedule of road works tell in which days at least one road will be asphalted.
The first line contains integer n (1 ≤ n ≤ 50) — the number of vertical and horizontal roads in the city.
Next n2 lines contain the order of intersections in the schedule. The i-th of them contains two numbers hi, vi (1 ≤ hi, vi ≤ n), separated by a space, and meaning that the intersection that goes i-th in the timetable is at the intersection of the hi-th horizontal and vi-th vertical roads. It is guaranteed that all the intersections in the timetable are distinct.
In the single line print the numbers of the days when road works will be in progress in ascending order. The days are numbered starting from 1.
21 11 22 12 2
1 4
11 1
1
In the sample the brigade acts like that:
- On the first day the brigade comes to the intersection of the 1-st horizontal and the 1-st vertical road. As none of them has been asphalted, the workers asphalt the 1-st vertical and the 1-st horizontal road;
- On the second day the brigade of the workers comes to the intersection of the 1-st horizontal and the 2-nd vertical road. The 2-nd vertical road hasn't been asphalted, but as the 1-st horizontal road has been asphalted on the first day, the workers leave and do not asphalt anything;
- On the third day the brigade of the workers come to the intersection of the 2-nd horizontal and the 1-st vertical road. The 2-nd horizontal road hasn't been asphalted but as the 1-st vertical road has been asphalted on the first day, the workers leave and do not asphalt anything;
- On the fourth day the brigade come to the intersection formed by the intersection of the 2-nd horizontal and 2-nd vertical road. As none of them has been asphalted, the workers asphalt the 2-nd vertical and the 2-nd horizontal road.
分析:水题
题意:总共有n行n列,同时有n*n个点,有一个工人修路,当到某一点是哪行和那列路没修才修
- Codeforces Round #323 (Div. 2) 583A. Asphalting Roads
- Codeforces Round #323 (Div. 2) A. Asphalting Roads
- Codeforces Round #323 (Div. 2) A. Asphalting Roads
- Codeforces Round #323 (Div. 2)A. Asphalting Roads
- Codeforces Round #323 A Asphalting Roads
- 【Codeforces Round 323 (Div 2)A】【水题】Asphalting Roads 行列之进行首次操作
- Codeforces 583A Asphalting Roads
- codeforces 583A Asphalting Roads
- A. Asphalting Roads
- Code Forces 583 A. Asphalting Roads(水~)
- cf#323-div2-A. Asphalting Roads-简单模拟
- 【Codeforces Round #369 (Div. 2)】Codeforces 711D Directed Roads
- Codeforces Beta Round #89 (Div. 2) E. Bertown roads
- Codeforces Round #186 (Div. 2)---D. Ilya and Roads
- Codeforces Round #302 (Div. 2) D. Destroying Roads(最短路)
- Codeforces Round #302 (Div. 2)D. Destroying Roads-最短路
- Codeforces Round #369 (Div. 2) [D] Directed Roads
- Codeforces Round #369 (Div. 2) 711D Directed Roads (dfs)
- 根据参数指定的列名和值查询员工信息(使用动态sql语句)
- HDU5496求整数序列的子串的并集和,map的简单使用
- UIPickerView控件的使用
- VBA第7课 编写自定义函数
- ArcMap10.2 Construction Tools(构造工具)以及"捕捉"工具的使用----画草图
- Codeforces Round #323 (Div. 2) 583A. Asphalting Roads
- 【AMPPZ2014】【BZOJ4143】The Lawyer
- hdu 4018 Parsing URL
- hadoop学习笔记之分布式计算框架
- [PAT]1097. Deduplication on a Linked List (25)
- 50Pow(x, n)
- hdoj 5496 Beauty of Sequence 【求序列所有子序列(去重后)的和】【好题】
- Linux 学习笔记 常用命令
- hdu5119 Happy Matt Friends( DP )