Codeforces Round #370 (Div. 2)-白红宇

Codeforces Round #370 (Div. 2)

阅读量：5261 次

发布时间：2019-06-14

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

A水，直接看样例找规律，数组开小导致wa了一发。。。

#include#include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               #include
               
                #include
                
                 #include
                 
                  #include
                  
                   #define C 0.5772156649#define pi acos(-1.0)#define ll long long#define ull unsigned long long#define mod 1000000007#define ls l,m,rt<<1#define rs m+1,r,rt<<1|1#pragma comment(linker, "/STACK:1024000000,1024000000")using namespace std;const double g=10.0,eps=1e-12;const int N=100000+10,maxn=500+100,inf=0x3f3f3f;ll a[N];int main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin>>n; for(int i=0;i
                   
                    >a[i]; a[n]=0; for(int i=0;i

B记录udlr的数目，求解的过程出了问题wa了两发。。。

#include#include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               #include
               
                #include
                
                 #include
                 
                  #include
                  
                   #define C 0.5772156649#define pi acos(-1.0)#define ll long long#define ull unsigned long long#define mod 1000000007#define ls l,m,rt<<1#define rs m+1,r,rt<<1|1#pragma comment(linker, "/STACK:1024000000,1024000000")using namespace std;const double g=10.0,eps=1e-12;const int N=100000+10,maxn=500+100,inf=0x3f3f3f;int main(){ ios::sync_with_stdio(false); cin.tie(0); string s; cin>>s; if(s.size()&1) { cout<<-1<

C很水，直接暴力1a

#include#include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               #include
               
                #include
                
                 #include
                 
                  #include
                  
                   #define C 0.5772156649#define pi acos(-1.0)#define ll long long#define ull unsigned long long#define mod 1000000007#define ls l,m,rt<<1#define rs m+1,r,rt<<1|1#pragma comment(linker, "/STACK:1024000000,1024000000")using namespace std;const double g=10.0,eps=1e-12;const int N=100000+10,maxn=500+100,inf=0x3f3f3f;int main(){ ios::sync_with_stdio(false); cin.tie(0); int a,b; cin>>a>>b; int x=b,y=b,z=b,k=0; while(x