http://codeforces.com/contest/1073

 

A. Diverse Substring

1 #include 
     
       2 using namespace std; 3 #define ll long long 4 #define minv 1e-6 5 #define inf 1e9 6 #define pi 3.1415926536 7 #define nl 2.7182818284 8 const ll mod=1e9+7;//998244353 9 const int maxn=1e3+10;10 11 char s[maxn];12 13 int main()14 {15     int n,i;16     scanf("%d",&n);17     scanf("%s",s);18     for (i=0;i<=n-2;i++)19         if (s[i]!=s[i+1])20             break;21     if (i==n-1)22         printf("NO");23     else24     {25         printf("YES\n");26         printf("%c%c",s[i],s[i+1]);27     }28     return 0;29 }
     

 

B. Vasya and Books

1 #include 
     
       2 #include 
      
        3 using namespace std; 4 const int maxn=2e5+10; 5  6 int f[maxn]; 7  8 int main() 9 {10     int n,a,v=0,i;11     scanf("%d",&n);12     for (i=1;i<=n;i++)13     {14         scanf("%d",&a);15         f[a]=i;16     }17     for (i=1;i<=n;i++)18     {19         scanf("%d",&a);20         if (i!=1)21             printf(" ");22         if (f[a]
      
     

 

C. Vasya and Robot

奇偶，负数取模

1 #include 
     
       2 using namespace std; 3 #define ll long long 4 const int maxn=2e5+10; 5 const ll inf=1e9; 6  7 int px[maxn],py[maxn]; 8  9 int main()10 {11     char c;12     int n,x,y,ax,ay,i,l,r,m,re;13     scanf("%d\n",&n);14     for (i=1;i<=n;i++)15     {16         scanf("%c",&c);17         if (c=='U')18             x=0,y=1;19         else if (c=='D')20             x=0,y=-1;21         else if (c=='L')22             x=-1,y=0;23         else24             x=1,y=0;25         px[i]=px[i-1]+x;26         py[i]=py[i-1]+y;27     }28     scanf("%d%d",&ax,&ay);29     if (px[n]==ax && py[n]==ay)30     {31         printf("0");32         return 0;33     }34     if (abs(ax+ay+n)%2==1)35     {36         printf("-1");37         return 0;38     }39     re=inf;40     for (i=1;i<=n;i++)41     {42         l=i;43         r=n;44         while (l<=r)45         {46             m=(l+r)>>1;47             ///change [i,m] ; use [1,i-1] [m+1,n]48             if (m-i+1>=abs(px[i-1]+px[n]-px[m]-ax)+abs(py[i-1]+py[n]-py[m]-ay))49                 r=m-1;50             else51                 l=m+1;52         }53         if (l!=n+1)54             re=min(re,l-i+1);55     }56     if (re==inf)57         re=-1;58     printf("%d",re);59     return 0;60 }
     

 

D. Berland Fair

1 #include 
     
       2 using namespace std; 3 #define ll long long 4 const int maxn=2e5+10; 5  6 int nex[maxn],a[maxn]; 7  8 int main() 9 {10     int n,i,j,g;11     ll m,tot=0,num=0;12     scanf("%d%lld",&n,&m);13 14     for (i=0;i
      
       =tot)41                 break;42         }43     }44     num+=m/a[i];45     cout<
      
     

 

E. Segment Sum

代码是错的，以待后续埋坑

1 #include 
     
       2 using namespace std; 3 #define ll long long 4 const ll mod=998244353; 5 const double minv=1e-10; 6  7 ll sum=0,shi[20],k,f[20][20]; 8  9 void work(ll a,int w,int g,int hav,ll num,int ori,int cond)10 {11     int s,gg,i,j,c;12     if (a==0)13         return;14     s=a/shi[w];15     for (i=0;i<=s;i++)16     {17         gg=g-(!((hav>>i) & 1) && (!(i==0 && ori==1)));18         if (gg>=0)19         {20             if (i