Summer training #8

A：

B：按题意直接暴力找符合题意的数的个数

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-6
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
int num[][];//+ 1 - 2 * 3 / 4
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 int n;
 string a;
 int ans=;
 cin >> n;
 int now;
 for(int i=;i<=n;i++)
 {
        cin >> a >> now;
        num[i][]=now;
        if(a[]=='A')
        num[i][]=;
        if(a[]=='S')
        num[i][]=;
        if(a[]=='M')
        num[i][]=;
        if(a[]=='D')
        num[i][]=;
 }
 for(int i=;i<=;i++)
 {
        int cur=i;
        for(int j=;j<=n;j++)
        {
        if(num[j][]==)
        {
        cur+=num[j][];
        }
        if(num[j][]==)
        {
        cur-=num[j][];
        if(cur<)
        {
        ans++;
        break;
        }
        }
        if(num[j][]==)
        {
        cur*=num[j][];
        }
        if(num[j][]==)
        {
        if(cur%num[j][]!=)
        {
        ans++;
        break;
        }
        else
        cur/=num[j][];
        }
        }
 }
 cout<<ans<<endl;
  return ;
}

C：水

D：s[i][j]可以向四个方向跳s[i][j]个格子 问能不能从左上角跳到右下角 BFS

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-6
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
int dir[][];
int m,n;
char s1[][];
int  a[][];
int ans[][];
int flag=;
pair<int,int> now;
queue<pair<int,int> > que;
void bfs()
{
 for(int i=;i<=;i++)
        for(int j=;j<=;j++)
        ans[i][j]=2e9;
 ans[][]=;
 int dx,dy;
 while(!que.empty())
 {
        now=que.front();
        que.pop();
        int f=now.first;
        int s=now.second;
        int j=a[f][s];
        for(int i=;i<;i++)
        {
        dx=f+j*dir[i][];
        dy=s+dir[i][]*j;
        if(dx>=&&dx<=m&&dy>=&&dy<=n&&ans[dx][dy]>ans[f][s]+)
        {
        ans[dx][dy]=ans[f][s]+;
        now.first=dx,now.second=dy;
        que.push(now);
        }
        }
 }
}
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 cin >> m >> n;
dir[][]=-,dir[][]=;
dir[][]=,dir[][]=;
dir[][]=,dir[][]=;
dir[][]=,dir[][]=-;
 for(int i=;i<=m;i++)
 {
        scanf("%s",s1[i]+);
        for(int j=;j<=n;j++)
        a[i][j]=s1[i][j]-'';
 }
 /*for(int i=0;i<m;i++)
 {
        for(int j=0;j<n;j++)
        printf("%d",a[i][j]);
        cout<<endl;
 }*/
 //TS;
 now.first=now.second=;
 que.push(now);
 bfs();
 //TS;
 if(ans[m][n]==2e9)
 cout<<"IMPOSSIBLE"<<endl;
 else
 cout<<ans[m][n]<<endl;
  return ;
}

E：水

F：水

G：水

H：加权区间调度问题 瞎DP

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-6
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
struct wave
{
ll start;
ll w;
ll t;
ll end;
}now[];
bool cmp(wave a,wave b)
{
return a.start>b.start;
}
ll dp[];
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 int n;
 ll maxn=;
 cin >> n;
 for(int i=;i<=n;i++)
 {
        int t;
        scanf("%d %d %d",&now[i].start,&now[i].w,&now[i].t);
        now[i].end=now[i].t+now[i].start;
        maxn=max(maxn,now[i].end);
 }
 sort(now+,now++n,cmp);
 int pop=;
 for(int i=;i>=;i--)
 {
        if(i==now[pop].start)
        {
        if(i+now[pop].t>)
        dp[i]=max(dp[i+],now[pop].w);
        else
        dp[i]=max(dp[i+],dp[i+now[pop].t]+now[pop].w);
        pop++;
        }
        else
        dp[i]=dp[i+];
 }
 cout<<dp[]<<endl;
  return ;
}

J：每个格子的值为其为中心九宫格之和 问最终的值 其实一起都要除九的话就不用除了

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-6
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
int now[][];
int doit[][];
set<int> ans;
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 int m,n,time;
 cin >> m >> n >> time;
 for(int i=;i<n;i++)
        for(int j=;j<m;j++)
        scanf("%d",&now[i][j]);
 while(time--)
 {
        mem(doit,);
        for(int i=;i<n;i++)
        {
                for(int j=;j<m;j++)
                {

                        for(int x=-;x<=;x++)
                        {
                                for(int y=-;y<=;y++)
                                {
                                int dx=(n+i+x)%n;
                                int dy=(m+j+y)%m;
                                doit[i][j]+=now[dx][dy];
                                }
                        }
                }
        }
        for(int i=;i<n;i++)
                for(int j=;j<m;j++)
                        now[i][j]=doit[i][j];
 }
 for(int i=;i<n;i++)
        for(int j=;j<m;j++)
                ans.insert(now[i][j]);
 cout<<ans.size()<<endl;
  return ;
}

K：DFS+回溯 注意！！！每个轮子只能有一个旋转状态 如果发生矛盾了就转不动了！

#include <bits/stdc++.h>
#include <cstring>
#include <iostream>
#include <algorithm>
#define foror(i,a,b) for(i=a;i<b;i++)
#define foror2(i,a,b) for(i=a;i>b;i--)
#define EPS 1.0e-6
#define PI acos(-1.0)
#define INF 3000000000
#define MOD 1000000009
#define mem(a,b) memset((a),b,sizeof(a))
#define TS printf("!!!\n")
#define lson o<<1, l, m
#define rson o<<1|1, m+1, r
//using ll = long long;
//using ull= unsigned long long;
//std::ios::sync_with_stdio(false);
using namespace std;
//priority_queue<int,vector<int>,greater<int>> que;
typedef long long ll;
int n;
int flag=-;
struct point
{
int x,y,r;
}a[];
vector<int> v[];
int visit[];
int ans=;
int anser;
bool check(point a,point b)
{
int dx=abs(a.x-b.x);
int dy=abs(a.y-b.y);
int dr=a.r+b.r;
if(dx*dx+dy*dy==dr*dr)
 return true;
 return false;
}
void dfs(int num,int now)
{
        if(flag==)
        return ;
        for(int i=;i<v[num].size();i++)
        {
        int next=v[num][i];
        if(flag==)
        return ;
        if(visit[next]==-)
        {
        visit[next]=now;
        dfs(next,now^);
        }
        if(visit[next]!=now)
        {
        flag=;
        return ;
        }
        }
}
int gcd(int x,int y){return y==?x:gcd(y,x%y);}
int main()
{
 //freopen("in.txt", "r", stdin);
 //freopen("out.txt", "w", stdout);
 cin >> n;
 mem(visit,-);
 visit[]=;
 for(int i=;i<=n;i++)
 {
        cin >> a[i].x >> a[i].y >> a[i].r;
 }
 for(int i=;i<n;i++)
        for(int j=i+;j<=n;j++)
 {
        if(check(a[i],a[j]))
        {
        v[i].push_back(j);
        v[j].push_back(i);
        }
 }
 dfs(,);
 if(flag==)
 {
        cout<<"The input gear cannot move."<<endl;
        return ;
 }
 if(visit[n]==-)
 {
        cout<<"The input gear is not connected to the output gear."<<endl;
        return ;
 }
        int chu=gcd(a[].r,a[n].r);
        if(visit[]!=visit[n])
        cout<<"-";
        printf("%d:%d\n",a[].r/chu,a[n].r/chu);
  return ;
}