这场第四题没看懂样例,,研究Note好久。。最后发现自己少看了一句话。(:зゝ∠)
不过还好,前三题都比较顺利通过了。
A:我们舍去前导零和后导零,然后遍历那个安排表,按照它的题意计算即可。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 50005
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
int a[110];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
for(int i=0;i<n;i++)
sf(a[i]);
int st=0;
while(a[st]==0&&st<n)st++;
int ed=n-1;
while(a[ed]==0&&ed>=0) ed--;
int ans=0;
for(int i=st;i<=ed;i++){
if(a[i] == 1){
ans++;
}else{
if(a[i+1] == 1){
ans++;
}else{
while(a[i+1]==0&&i<=ed)i++;
}
}
}
printf("%d\n",ans);
}
return 0;
}
B:选两条路,要求总代价最小。直接暴力就好。先选择一条路,然后暴力找第二条路,使得两条路总代价最小,更新总代价。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 50005
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
int b[55];
int a[2][55];
int sum1[55];
int sum2[55];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
for(int i=0;i<2;i++){
for(int j=1;j<n;j++)
sf(a[i][j]);
}
for(int i=1;i<=n;i++) sf(b[i]);
memset(sum1,0,sizeof sum1);
memset(sum2,0,sizeof sum2);
for (int i = 1; i < n; i++) {
sum1[i] = sum1[i-1]+a[0][i];
}
for(int i=1;i<n;i++){
sum2[i] = sum2[i-1]+a[1][i];
}
int ans = INF;
for(int i=1;i<=n;i++){
int res1 = b[i]+sum2[n-1]-sum2[i-1]+sum1[i-1];
int res2 = M;
for(int j=i+1;j<=n;j++){
int tmp = b[j]+sum2[n-1]-sum2[j-1]+sum1[j-1];
res2 = Min(tmp,res2);
}
ans = Min(ans,res1+res2);
}
pf(ans);
}
return 0;
}
C:模拟题。我用了队列,来记录正在接受治疗或者要离开的人,因为他们都会对后面的人产生影响。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 50005
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
struct Peo{
int id;
int v,d,p;
}a[4010];
queue<int> q;
int vis[4010];
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
while(sf(n)!=EOF){
for(int i=1;i<=n;i++){
a[i].id = i;
scanf("%d%d%d",&a[i].p,&a[i].d,&a[i].v);
}
memset(vis,0,sizeof vis);
vector<int> v;
vis[1] = 1;
int dam;
for(int i=1;i<=n;i++){
if(vis[i] && i!=1) continue;
v.push_back(i);
q.push(i);
vis[i] = 1;
while(!q.empty()){
int cur = q.front();
q.pop();
if(vis[cur] == 1) dam = a[cur].p; //说明此时后面的人受到的“伤害”是递减的
else if(vis[cur] == 2) dam = a[cur].d; //此时后面的人受到的"伤害"是不变的
for(int j=cur+1;j<=n;j++){
if(vis[j]) continue;
a[j].v -= dam;
if(a[j].v<0){ //有小于0的就放入队列,来更新他后面的人
vis[j] = 2;
q.push(j);
}
if(vis[cur] == 1) dam--; //递减
if(dam<=0) break;
}
}
}
int size = (int)v.size();
printf("%d\n",size);
for(int i=0;i<size;i++)
printf("%d%c",v[i],i+1==size?'\n':' ');
}
return 0;
}
D:D题其实也不难,是一个搜索题。我们知道 人向右走一步,然后火车向左两步,其实也相当于人向右走两步。所以状态就出来了。人先是向右走一步然后有三个方向可以走:向上,不动,向下。对这三个方向进行判断,看哪个方向可以再向右走两步(相当于火车的移动),如果不会走到火车的格子,那就把它放入队列。过程中判断是否会到边界就行。
#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
#include<set>
#include<bitset>
//#define ONLINE_JUDGE
#define eps 1e-5
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,num) scanf("%d%d%d",&a,&b,&num)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
#define ll long long
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
//#pragma comment(linker,"/STACK:1024000000,1024000000")
int n,m,L;
#define N 50005
#define M 1000100
#define Mod 1000000007
#define p(x,y) make_pair(x,y)
struct Node{
int x,y;
};
char mp[3][110];
int vis[3][110];
int dir[3] = {0,1,-1}; //三个方向
bool check(int x,int y){
if(x>=0 && x<3 && y>=0 && y<n && !vis[x][y] && mp[x][y] == '.')
return true;
return false;
}
bool bfs(int x,int y){
queue<Node> q;
Node cur;
cur.x = x;
cur.y = y;
vis[x][y] = 1;
q.push(cur);
while(!q.empty()){
cur = q.front();
q.pop();
if(cur.y == n-1) return true; //看是否在边界
int xx = cur.x;
int yy = cur.y+1;
if(!check(xx,yy)) continue; //先判断向右的这一步
else if(yy == n-1) return true; //当然你得判断是否向右这一步直接到了终点
for(int i=0;i<3;i++){
xx = cur.x+dir[i];
if(!check(xx,yy)) continue; //判断向上,不动,向下的合法性
if(check(xx,yy+1) && yy+1 == n-1) //之后我们要模拟火车向左移动两格,但是同时我们要判断人是否走一步就到终点了
return true; //这就相当于火车是否移动了一格就过去了
if(check(xx,yy+2)){ //模拟火车向左移动两格,人向右移动两格。
q.push((Node){xx,yy+2});
vis[xx][yy+2] = 1;
}
}
}
return false;
}
int main(){
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int t;
sf(t);
while(t--){
int k;
sfd(n,k);
for(int i=0;i<3;i++)
sfs(mp[i]);
memset(vis,0,sizeof vis);
int flag;
for(int i=0;i<3;i++){
if(mp[i][0] == 's'){
flag = bfs(i,0);
break;
}
}
if(flag)
printf("YES\n");
else
printf("NO\n");
}
return 0;
}