Codeforces Round #280 (Div. 2)E good
来源:互联网 发布:淘宝晒图怎么删除 编辑:程序博客网 时间:2024/05/02 00:09
Vanya decided to walk in the field of size n × n cells. The field containsm apple trees, the i-th apple tree is at the cell with coordinates (xi, yi). Vanya moves towards vector(dx, dy). That means that if Vanya is now at the cell(x, y), then in a second he will be at cell. The following condition is satisfied for the vector:, where is the largest integer that divides botha and b. Vanya ends his path when he reaches the square he has already visited.
Vanya wonders, from what square of the field he should start his path to see as many apple trees as possible.
The first line contains integers n, m, dx, dy(1 ≤ n ≤ 106,1 ≤ m ≤ 105,1 ≤ dx, dy ≤ n) — the size of the field, the number of apple trees and the vector of Vanya's movement. Nextm lines contain integers xi, yi (0 ≤ xi, yi ≤ n - 1) — the coordinates of apples. One cell may contain multiple apple trees.
Print two space-separated numbers — the coordinates of the cell from which you should start your path.If there are several answers you are allowed to print any of them.
5 5 2 30 01 21 32 43 1
1 3
2 3 1 10 00 11 1
0 0
In the first sample Vanya's path will look like: (1, 3) - (3, 1) - (0, 4) - (2, 2) - (4, 0) - (1, 3)
In the second sample: (0, 0) - (1, 1) - (0, 0)
因为路径是循环的,所以可以对y坐标走一遍看每个坐标经过多少步能够回到原来的位置,然后对对应的x坐标进行相应的变化,统计有多少个相同的x,最多的就是答案
#include<iostream>#include<cstdio>#include<string>#include<cstring>#include<vector>#include<cmath>#include<queue>#include<stack>#include<map>#include<set>#include<algorithm>using namespace std;typedef long long LL;const int maxn=1000010;int N,M,dx,dy;int d[maxn],cnt[maxn];int main(){ while(scanf("%d%d%D%d",&N,&M,&dx,&dy)!=EOF) { int y=0,x=0; for(int i=0;i<N;i++) { d[y]=i; y=(y+dy)%N; } memset(cnt,0,sizeof(cnt)); int ans=0,ansx=0; for(int i=0;i<M;i++) { scanf("%d%d",&x,&y); int tmp=d[y]; tmp=((LL)x+(N-tmp)*(LL)dx)%N; cnt[tmp]++; if(cnt[tmp]>ans) { ans=cnt[tmp]; ansx=tmp; } } printf("%d %d\n",ansx,0); } return 0;}
- Codeforces Round #280 (Div. 2)E good
- Codeforces Round #287 (Div. 2) 507E E. Breaking Good
- Codeforces Round #287 (Div. 2) E. Breaking Good
- Codeforces Round #287 (Div. 2) 507 E. Breaking Good
- Codeforces Round #287 (Div. 2) E. Breaking Good 最短路
- Codeforces Round #287 (Div. 2) E. Breaking Good(最短路、dp)
- Codeforces Round #287 (Div. 2) E. Breaking Good(最短路、dp)
- Codeforces Round #266 (Div. 2)(good)
- Codeforces Round #279 (Div. 2)(good)
- Codeforces Round #280 (Div. 2) E. Vanya and Field
- Codeforces Round #280 (Div. 2 A,B,C,D,E)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces Round #103 (Div. 2) E题
- Codeforces Round #147 (Div. 2) E
- Codeforces Round #184 (Div. 2) D、E
- Codeforces Round #197 (Div. 2) (C~E)
- Codeforces Round #102 (Div. 2) //缺E
- Codeforces Round #104 (Div. 2) //缺E
- xcode 6 Adaptive Segues的Push的使用
- HDU 2156 分数矩阵
- JSP自定义标签开发入门
- Linux dump命令
- 面试题(二) 单例模式
- Codeforces Round #280 (Div. 2)E good
- eclipse无法安装最新adt的解决方法
- mac(osx) apache无法启动 localhost无法访问服务器
- 程序员干到30岁
- 【大话】六大原则
- Android中的fill_parent、match_parent、wrap_content
- 调用相机并把照片保存到指定路径------
- VC中用命令行创建文件夹的方法
- 块设备驱动程序2