Codeforces 390A( 模拟题)
来源:互联网 发布:mac怎样看视频更省电 编辑:程序博客网 时间:2024/05/20 20:14
Description
Inna loves sleeping very much, so she needs n alarm clocks in total to wake up. Let's suppose that Inna's room is a 100 × 100 square with the lower left corner at point (0, 0) and with the upper right corner at point (100, 100). Then the alarm clocks are points with integer coordinates in this square.
The morning has come. All n alarm clocks in Inna's room are ringing, so Inna wants to turn them off. For that Inna has come up with an amusing game:
- First Inna chooses a type of segments that she will use throughout the game. The segments can be either vertical or horizontal.
- Then Inna makes multiple moves. In a single move, Inna can paint a segment of any length on the plane, she chooses its type at the beginning of the game (either vertical or horizontal), then all alarm clocks that are on this segment switch off. The game ends when all the alarm clocks are switched off.
Inna is very sleepy, so she wants to get through the alarm clocks as soon as possible. Help her, find the minimum number of moves in the game that she needs to turn off all the alarm clocks!
Input
The first line of the input contains integer n(1 ≤ n ≤ 105) — the number of the alarm clocks. The next n lines describe the clocks: the i-th line contains two integers xi, yi — the coordinates of the i-th alarm clock (0 ≤ xi, yi ≤ 100).
Note that a single point in the room can contain any number of alarm clocks and the alarm clocks can lie on the sides of the square that represents the room.
Output
In a single line print a single integer — the minimum number of segments Inna will have to draw if she acts optimally.
Sample Input
4
0 0
0 1
0 2
1 0
2
4
0 0
0 1
1 0
1 1
2
4
1 1
1 2
2 3
3 3
3
Hint
In the first sample, Inna first chooses type "vertical segments", and then she makes segments with ends at : (0, 0), (0, 2); and, for example,(1, 0), (1, 1). If she paints horizontal segments, she will need at least 3 segments.
In the third sample it is important to note that Inna doesn't have the right to change the type of the segments during the game. That's why she will need 3 horizontal or 3 vertical segments to end the game.
Source
#include <iostream>#include <stdlib.h>#include <stdio.h>#include <algorithm>#include <string.h>#include <math.h>using namespace std;typedef long long ll;int main(){ int i,j,m,n,sum1,sum2,x,y,a[100005],b[100005]; while (cin>>n) { sum1=0; sum2=0; memset(a,0,sizeof(a)); memset(b,0,sizeof(b)); for (i=0;i<n;i++) { cin>>x>>y; a[x]=1; b[y]=1; } for (i=0;i<105;i++) if (a[i]) sum1++; for (i=0;i<105;i++) if (b[i]) sum2++; if (sum1<sum2) cout<<sum1<<endl; else cout<<sum2<<endl; } return 0;}
- Codeforces 390A( 模拟题)
- CodeForces - 404A(模拟题)
- codeforces 116A Tram(模拟水题)
- CodeForces - 344A Magnets (模拟题)
- CodeForces 600A - Extract Numbers (模拟题)
- Codeforces 631A Interview【模拟水题】
- codeforces 691A 模拟
- Codeforces 67A【模拟】
- Codeforces 449A 模拟
- Codeforces 1A 【模拟】
- codeforces 855A 模拟
- codeforces 187A 模拟
- codeforces 416 A. Guess a number!(简单模拟题)
- Codeforces 330A Cakeminator(模拟)
- 模拟 之 Codeforces 416A
- CodeForces 651A:Joysticks【模拟】
- CodeForces 632A(反向模拟)
- 【CodeForces 651A】Joysticks 模拟
- 二进制枚举
- Codeforces 417 C (递推)
- Codeforces 389A (最大公约数)
- thrift数据结构
- Codeforces 389B(十字模拟)
- Codeforces 390A( 模拟题)
- 严谨的单例实现方案
- CodeForces - 404A(模拟题)
- CodeForces - 404B(模拟题)
- CodeForces - 405A
- Oracle的Package的作用及用法
- 打包软件的调研
- CodeForces - 405C
- CodeForces - 407A