A.
注意:不计算小数秒内奔跑
思路:逐秒模拟
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
int v1, v2, t, s, l;
scanf("%d%d%d%d%d", &v1, &v2, &t, &s, &l);
int s1 = 0, s2 = 0;
int time = 0, n = 0;
while(s1 != l && s2 != l){
time++;//时间逐渐增加
if(n)//小明停止时的读秒
n--;
else
s1 += v1;
s2 += v2;
if(n == 0 && s1 >= s2+t)//小明停下来等待
n = s;
}
if(s1 == l && s2 == s1)
printf("Tie %d\n", tt);
else if(s1 == l)
printf("Ming %d\n", tt);
else if(s2 == l)
printf("Hong %d\n", tt);
return 0;
}
C.
#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e7 + 7;
char mp[55][55];
bool vis[55][55];
struct NODE {
int x, y, val;
NODE(int x, int y, int v) :x(x), y(y), val(v) {}
}S(0, 0, 0), E(0, 0, 0);
int dx[] = { 0,0,1,-1 ,1,1,-1,-1 };
int dy[] = { 1,-1,0,0 ,1,-1,1,-1 };
int N, M;
bool judge(int x, int y) {
if (x < 0 || y < 0 || x >= N || y >= M) return false;
for (int i = 0; i < 8; ++i) {
int nx = x + dx[i];
int ny = y + dy[i];
if (mp[nx][ny] == '*') return false;
}
return !vis[x][y];
}
int bfs() {
queue<NODE>q;
S.val = 0;
q.push(S);
vis[S.x][S.y] = true;
while (!q.empty()) {
NODE now = q.front();
q.pop();
if (mp[now.x][now.y] == 'E')
return now.val;
for (int i = 0; i < 4; ++i) {
int nx = now.x + dx[i];
int ny = now.y + dy[i];
if (judge(nx, ny)) {
q.push(NODE(nx, ny, now.val + 1));
vis[nx][ny] = true;
}
}
}
return -1;
}
int main() {
while (cin >> N >> M) {
memset(vis, 0, sizeof(vis));
for (int i = 0; i < N; ++i) {
for (int j = 0; j < M; ++j) {
cin >> mp[i][j];
if (mp[i][j] == 'S')
S.x = i, S.y = j;
else if (mp[i][j])
E.x = i, E.y = j;
}
}
int ans = bfs();
if (ans == -1)
cout << "Impossible" << endl;
else
cout << ans << endl;
}
}
D.
思路:u:相加和,v:异或和
a^b:表示a+b的这一位的结果
a&b:表示a+b这一位应该进的位
a&b<<1:表示进位之后
a+b = (a^b)+(a&b)2
v=u+2(a&b)
u>v -> -1
(v-u)&11 -> -1
uv
v==0 输出0
v!=0 输出u
设d=(v-u)/2=a&b
构造一个特殊的数组,因为相同的两个数异或值为0,所以可以构造出v^0=,数组为[u,d,d]
相加和u+d+d=v
u ^ d^d=u
[u+d,d]
d^(u+d)=u ^d ^d = u
(u+d)=(u^d)
总结
情况1:u>v或者(v-u)%21 输出-1
情况2:uv
v0 输出0
v!=0输出u
情况3:u+du^d特解[u+d,d]
else [u,d,d]
#include <bits/stdc++.h>
using namespace std;
int main() {
int u, v;
while(cin >> u >> v) {
if(u > v || ((v - u) & 1)) {
cout << -1 << endl;
continue;
}
if(u == v) {
if(v)
cout << 1 << endl;
else
cout << 0 << endl;
continue;
}
int d = (v - u) / 2;
if(d & u) {
cout << 3 << endl;
}
else {
cout << 2 << endl;
}
}
}
G.
思路:
假设N有X位,那么从1到N异或最大的数值就是是
2
X
−
1
2^X-1
2X−1(X位全1),那么从1到N能否保证存在两个数异或后是
2
X
−
1
2^X-1
2X−1呢,既然N有X位,那么一定存在
2
X
−
1
2^{X-1}
2X−1这个数,因为它是最小的有X位的数,观察这个数,假如说X=4(N有4位),那么
2
X
−
1
2^X-1
2X−1=15=1111
2
_2
2,
2
X
−
1
2^{X-1}
2X−1=8=1000
2
_2
2,1000距离异或变为1111差一个0111,也就是
2
X
−
1
−
1
2^{X-1}-1
2X−1−1,而这个数也一定存在与1到N中,于是保证一定存在两个数异或后为
2
X
−
1
2^X-1
2X−1,这也就是最终答案。
#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
int main(){
ll n;
cin >> n;
if(n==1)
cout << 0 << endl;
else
cout << (1ll <<(ll)(log2(n)+1))-1 << endl;
return 0;
}
H.
思路:带权并查集,(X,Y)的编号为X*M+Y,遍历整个图,对每个+点去连接相邻的-点,-点同理,在合并的时候记录格子的数量,对给出的坐标进行查找。
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
char s[3010][3010];
const int N=3010*3010;
int p[N];
int size[N];
int X[4]={0,0,1,-1};
int Y[4]={-1,1,0,0};
int find(int x){
if(p[x] != x) p[x] = find(p[x]);
return p[x];
}
void merge(int a,int b){
int fa=find(a);
int fb=find(b);
if(fa!=fb){
p[fa]=fb;
size[fb]+=size[fa];
}
}
int main(){
int n, m, q, x, y;
scanf("%d%d%d", &n, &m, &q);
for(int i=0;i<N;i++)
p[i]=i, size[i]=1;//初始化
for(int i=0;i<n;i++)
scanf("%s",s[i]);
for(int i = 0; i < n; i++){
for(int j = 0; j < m; j++){
for(int k = 0; k < 4; k++){
x = i+X[k], y = j+Y[k];
if(x >= 0 && x < n && y >= 0 && y < m && s[x][y] != s[i][j])
merge(i*m+j, x*m+y);
}
}
}
while(q--){//读入询问
scanf("%d%d",&x,&y);
x--;y--;
int fa = find(x*m+y);
printf("%d\n",size[fa]);
}
}
I.
思路:求[a,b]内的质数个数,可以转化为求[0,X]内的质数个数,然后[a,b]=[0,b]-[0,a-1].
#include <...>
using namespace std;
const int maxn = 1e7 + 7;
int pre[maxn];//前缀和
bool vis[maxn];//是否素数
void init() {//埃氏筛
vis[1] = 1;
for (int i = 2; i <= maxn; i++) {
if (!vis[i]) {//如果i是素数
pre[i] = pre[i - 1] + 1;//前缀和+1
for (int j = i << 1; j <= maxn; j += i)
vis[j] = 1;//把2*i到maxn的所有i的倍数标为非素数
}
else
pre[i] = pre[i - 1];
}
}
int main() {
init();
int T; cin >> T;
while (T--) {
int a, b;
cin >> a >> b;
cout << pre[b] - pre[a - 1] << endl;
}
}
J.
tips:比较大数的大小,使用java的大数类解决,使用c++可以直接比较字符串
import java.math.BigInteger;
import java.util.Scanner;
public class Main{
static public void main(String[] args){
Scanner cin = new Scanner(System.in);
BigInteger a = new BigInteger(cin.next());
BigInteger b = new BigInteger(cin.next());
if(a.compareTo(b) > 0){
System.out.println(">");
}
else if(a.compareTo(b) == 0){
System.out.println("=");
}
else {
System.out.println("<");
}
}
}
#include <...>
using namespace std;
int main() {
string a, b;
while (cin >> a >> b) {
if (a.length() != b.length()) {
cout << (a.length() > b.length() ? ">" : "<") << endl;
}
else {
bool flag = true;
for (unsigned long long i = 0; i < a.length(); ++i) {
if (a[i] != b[i]) {
cout << (a[i] > b[i] ? ">" : "<") << endl;
flag = false;
break;
}
}
if(flag)
cout << "=" << endl;
}
}
}
K.
思路:行走步数最少:不能走回头路
N+M-2步,只能向下,向右,有N-1步向下,有M-1步向右,
C
N
+
M
−
2
N
−
1
C_{N+M-2}^{N-1}
CN+M−2N−1,阶乘,取模,肯定要求我们在过程中顺便取模,假设inv(x)为x的逆元,(a/b)%p=(a%p)*(inv(b)%p)
求逆元的方法:扩展欧几里得和费马小定理
费马小定理求逆元:求a关于模数p的逆元,a^(p-2)%p,条件(模数p为质数),a ^(p-2)通过快速幂求
#include <iostream>
#include <cstdio>
using namespace std;
const int maxn = (1e6+7)*2;
const int mod = 1e9 + 7;
typedef long long ll;
ll factorial[maxn];//阶乘的答案
ll q_pow(ll a, ll b, ll mod) { // 快速幂
ll res = 1LL;
while (b) {
if (b & 1) res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res % mod;
}
ll inv(ll x) {//求逆元
return q_pow(x, mod - 2, mod);
}
ll C(ll n, ll k) {//求组合数
return factorial[n] * inv(factorial[n - k] * factorial[k] % mod) % mod;
}
int main() {
factorial[0] = 1;
for (int i = 1; i <= maxn - 5; ++i)
factorial[i] = (factorial[i - 1]) * i % mod;;
int T; cin >> T;
while (T--) {
ll N, M; cin >> N >> M;
cout << C(N + M - 2, N - 1) % mod << endl;
}
return 0;
}
L.
思路:尺取法(滑动窗口)解决具有一定变化趋势的满足特定条件的区间的问题
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=2e5+10;
int a[N];
int main(){
int n;
scanf("%d",&n);
for(int i = 1; i <= n; i++)
scanf("%d", &a[i]);
sort(a+1, a+n+1);
int ans=-1;
for(int l = 1, r = 1; l <= n; l++){//尺取法
while(a[r]-a[l] <= 5 && r<=n) r++;
ans=max(ans, r-l);
}
printf("%d\n",ans);
return 0;
}