2017 Multi-University Training Contest - 2

HDU 6045

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define ll long long
 #define mod 1000000007
 using namespace std;
 int t;
 int n,x,y;
 char a[],b[];
 int main()
 {
     scanf("%d",&t);
     for(int i=;i<=t;i++){
         scanf("%d %d %d",&n,&x,&y);
         scanf("%s",a);
         scanf("%s",b);
         int res=;
         for(int j=;j<n;j++){
             if(a[j]==b[j])
                 res++;
         }
         if(x+y<=n+res&&abs(x-y)<=n-res)
             printf("Not lying\n");
         else
             printf("Lying\n");
     }
     return ;
 }

HDU 6047

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define ll long long
 #define mod 1000000007
 using namespace std;
 int n;
 ll a[];
 ll b[];
 ll dp[];
 int main()
 {
     while(scanf("%d",&n)!=EOF){
     for(int i=;i<=n;i++)
         scanf("%lld",&a[i]);
     for(int i=;i<=n;i++)
         scanf("%lld",&b[i]);
     sort(b+,b++n);
     dp[n+]=;
     for(int i=n;i>=;i--)
         dp[i]=max(dp[i+],a[i]-i);
     ll ans=;
     ll now=;
     for(int i=n+;i<=*n;i++){
         ll zha=max(dp[b[i-n]],now);
         ans+=zha;
         ans%=mod;
         now=max(now,zha-i);
     }
     printf("%lld\n",ans);
     }
     return ;
 }

HDU 6049

 #include <iostream>
 #include <cstdio>
 using namespace std;
 const int N=;
 int f[N][N],minN[N][N],maxN[N][N],last[N];
 int n,a[N];
 void work()
 {
     int i,j,k,ii,jj;
     for (i=; i<=n; i++)
     {
         f[i][i]=;
         last[i]=i;
         minN[i][i]=maxN[i][i]=a[i];
         for(j=i+; j<=n; j++)
         {
             minN[i][j]=min(minN[i][j-],a[j]);
             maxN[i][j]=max(maxN[i][j-],a[j]);
         }
     }
     for(k=; k<=n; k++)
         for(i=; i<=n-k+; i++)
         {
             j=i+k-;
             if (maxN[i][j]-minN[i][j]!=j-i)
                 f[i][j]=;
             else
             {
                 if (minN[i][j]<minN[i][last[i]])f[i][j]=;
                 else
                     f[i][j]=f[i][last[i]]+f[last[i]+][j];
                 last[i]=j;
             }
         }
     int ans=f[][n];
     for (i=; i<=n; i++)
         for (j=i; j<=n; j++)
             if (f[i][j]&&(i==||f[][i-]&&minN[][i-]==))
             {
                 jj=maxN[i][j];
                 if (jj==n||maxN[jj+][n]==n&&f[jj+][n])
                     for (ii=jj; ii>j; ii--)
                         if (f[ii][jj]&&minN[ii][jj]==i)
                             ans=max(ans,f[][i-]+f[j+][ii-]+f[jj+][n]+);
             }
     cout<<ans<<endl;
 }
 int main()
 {
     int T,i,j;
     cin>>T;
     for (i=; i<=T; i++)
     {
         cin>>n;
         for (j=; j<=n; j++)cin>>a[j];
         work();
     }
     return ;
 }

HDU 6055

 #pragma comment(linker, "/STACK:102400000,102400000")
 #include <cstdio>
 #include <iostream>
 #include <cstdlib>
 #include <cstring>
 #include <algorithm>
 #include <cmath>
 #include <cctype>
 #include <map>
 #include <set>
 #include <queue>
 #include <bitset>
 #include <string>
 #include <complex>
 #define ll long long
 #define mod 1000000007
 using namespace std;
 int n;
 struct node
 {
     int x,y;
 } N[];
 int mp[][];
 int main()
 {

     while(scanf("%d",&n)!=EOF)
     {
         memset(mp,,sizeof(mp));
         for(int i=; i<=n; i++)
         {
             scanf("%d %d",&N[i].x,&N[i].y);
             mp[N[i].x+][N[i].y+]=;
         }
         int ans=;
         for(int i=; i<=n; i++){
             for(int j=; j<=n; j++){
                 if(i==j)
                     continue;
                 int x,y,xx,yy;
                 x=N[i].x;y=N[i].y;
                 xx=N[j].x;yy=N[j].y;
                 int x1,y1,x2,y2;
                 int x3,y3,x4,y4;
                 if((x>=xx&&y>yy)){
                 x1=xx+abs(y-yy)+abs(x-xx);
                 y1=y-abs(x-xx);
                 x2=xx+abs(y-yy);
                 y2=yy-abs(x-xx);
                 x3=x-abs(y-yy);
                 y3=y+abs(x-xx);
                 x4=x-abs(y-yy)-abs(x-xx);
                 y4=yy+abs(x-xx);
                 if(x1+>=&&y1+>=&&x2+>=&&y2+>=&&mp[x1+][y1+]&&mp[x2+][y2+]){
                     ans++;
                     }
                 if(x3+>=&&y3+>=&&x4+>=&&y4+>=&&mp[x3+][y3+]&&mp[x4+][y4+]){
                     ans++;
                 }
                 }
             }
             }
         printf("%d\n",ans/);
     }
     return ;
 }