NOIP2017题目-白红宇

NOIP2017题目

阅读量：5129 次

发布时间：2019-06-13

本文共 2827 字，大约阅读时间需要 9 分钟。

作为NOIP2017考场爆零的选手,我来考完当一波马后炮(绝望..)

Day1

Day1除了T3都很SB(T1我不会证明)

T1

#include
    
     #include
     
      int main(){    long long a,b;scanf("%lld%lld",&a,&b);    printf("%lld\n",a*b-a-b);    return 0;}

T2

模拟大活题,你可以选择DeBug\(1h+10min\)就可以AC

#include
    
     #include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #define ll long long#define re registerusing namespace std;inline int gi(){ int f=1,sum=0;char ch=getchar(); while(ch>'9' || ch<'0'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0' && ch<='9'){sum=(sum<<3)+(sum<<1)+ch-'0';ch=getchar();} return f*sum;}int t,L,have,val[100010],fuza,refuza;char Time[10],For[10],For2[10];bool use[30],cant[1000010];char Bian[1000010][2];int main(){ cin>>t; while(t--){ cin>>L>>Time;fuza=0;refuza=0;int flag=0;have=0; int flagcan=0; memset(use,0,sizeof(use));memset(cant,0,sizeof(cant)); for(re int i=1;i<=L;i++){ char ch; cin>>ch; if(ch=='F'){ fuza++; cin>>Bian[fuza]; if(use[Bian[fuza][0]-'a']){flag=1;} use[Bian[fuza][0]-'a']=1; cin>>For;cin>>For2; if(flagcan){cant[fuza]=1;use[Bian[fuza][0]-'a']=0;continue;} if(flag)continue; int b1=0,b2=0; if(For[0]=='n')b1=1; if(For2[0]=='n')b2=1; if((!b1 && b2))val[++have]=1; else if(!b2 && b1 || (strlen(For)>strlen(For2) || (strcmp(For,For2))>0 && strlen(For)==strlen(For2))){ cant[fuza]=1;flagcan=1; use[Bian[fuza][0]-'a']=0; } } else{ if(cant[fuza]){cant[fuza--]=0;continue;} else flagcan=0; use[Bian[fuza][0]-'a']=0; refuza=max(refuza,have); if(val[have])val[have--]=0; fuza--; if(fuza<0)flag=1; } } if(flag || fuza!=0)puts("ERR"); else{ if(Time[2]=='1'){ if(refuza==0)puts("Yes");else puts("No"); } else{ int i=4,ref=0; while(Time[i]>='0' && Time[i]<='9')ref=(ref*10)+Time[i++]-'0'; if(ref!=refuza)puts("No"); else puts("Yes"); } } } return 0;}

Day2

T1

#include
    
     #include
     
      #include
      
       #include
       
        inline int gi() {    int sum=0,f=1;    char ch=getchar();    while(ch<'0' || ch>'9') {        if(ch=='-')f=-1;        ch=getchar();    }    while(ch>='0' && ch<='9') {        sum=sum*10+ch-'0';        ch=getchar();    }    return sum*f;}struct node {    long long x,y,z;} a[1010];int g[1010][1010],di[1010],ding[1010],dp[1010];int cmp(node a,node b) {    return a.z
        
         =h)ding[i]=1;        }        for(i=1; i<=n; i++)            if(di[i])dp[i]=1;            else dp[i]=0;        for(i=1; i<=n; i++)            for(j=1; j<=n; j++)                if(g[i][j])                    if(dp[j])dp[i]=1;        int fla=0;        for(i=1; i<=n; i++)            if(dp[i] && ding[i]) {                fla=1;                break;            }        if(fla)printf("Yes\n");        else printf("No\n");    }    return 0;}