/********************
10^5门课，每门课最多得到r分,r<=10^9，需要平均分为avg，avg <= min(10^6,r)
已知第i门课已经得到ai分，1 ≤ ai ≤ r,每写bi篇论文可以多得一分，1 ≤ bi ≤ 10^6
问最少需要些多少篇论文可以获得平均分按b的值统计，即写b篇论文可以拿一分的课还能拿几分
按b 从小到大，直至凑满分数
492C. Vanya and Exams
**********************/
#include <bits/stdc++.h>
using namespace std;#define N 1000005
#define LL __int64
LL lt[N];
int n, r, avg;
long long sum = 0, nowget = 0, ans = 0;void input(){int a,  b;cin >> n >> r >> avg;sum = (LL) n * avg;memset(lt, 0, sizeof(lt));for(int i = 1; i <= n; i++){cin>>a>>b;lt[b] += (r - a);nowget += a;}
}void gao(void){sum -= nowget;for(int i = 1; i <= N; i++){if(sum > 0){ans += min(sum, lt[i]) * i;sum -= min(sum, lt[i]);}else break;}cout<<ans<<endl;
}
int main(void){input();gao();
}

2 seconds

256 megabytes

standard input

standard output

/********************一开始以为是要从1开始依次打这些怪物，是连续关系。。
还看成了A打一下可以掉x点，B打一下掉y点，感觉有些麻烦。
后来发现自己想多了。打了个表，打怪以lca(x, y)为周期。周期内打个表出来。
表的大小不会超过两倍的max(x,y)
接下来取模就可以了解释一下表。a每个1/x分钟打 一下可以看做每隔y分钟打一下，同样的变换b
按从小到大的打击顺序打个表
注意爆longlong re了 = =
D. Vanya and Computer Game
**********************/
#include<bits/stdc++.h>
using namespace std;
#define LL __int64
#define N 10000007
int typ[N];
string st[3] = {"Vanya","Vova", "Both"};
int main(void){int i, n,  z, j, tot =0;LL x, y;cin>>n>>x>>y;LL m = __gcd(x,y);m = x / m * y;i = j = 1;//0->xytyp[0] = 2;// cout<<m<<endl;while(i * y <= m && j * x <= m){if(i * y < j * x){typ[++tot] = 0;i++;}else if(j * x < i * y){typ[++tot] = 1;j++;}else{typ[++tot] = 2;break;}//printf("%d %d %d\n", tot, i, j);
    }
//cout<<tot<<endl;tot++;while(n--){cin>>x;cout<<st[typ[x%tot]]<<endl;}
}

View Code

Vanya decided to walk in the field of size n × n cells. The field contains m 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 both a 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. Next m 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.