Codeforces Round #519 by Botan Investments

Codeforces Round #519 by Botan Investments

 #include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<map>
 #define lson i<<1
 #define rson i<<1|1
 #define LS l,mid,lson
 #define RS mid+1,r,rson
 #define mem(a,x) memset(a,x,sizeof(a))
 #define gcd(a,b) __gcd(a,b)
 #define ll long long
 #define ull unsigned long long
 #define lowbit(x) (x&-x)
 #define pb(x) push_back(x)
 #define enld endl
 #define mian main
 #define itn int
 #define prinft printf
 #define Max(a,b,c) max(a,max(b,c))
 #pragma GCC optimize(2)
 //#pragma comment(linker, "/STACK:102400000,102400000")

 const double PI = acos (-1.0);
 const ll INF = 0x3f3f3f3f3f3f3f3f;
 ;
 ;
 ;
 ;
 ;

 using namespace std;

 ;
 int temp;
 ;
 int main() {
     //std::ios::sync_with_stdio(false);
     //cin.tie(NULL);
     ;
     while(cin>>n) {
         sum=;
         ;i<=n;++i) {
             cin>>temp;
             sum+=temp;
             maxn=max(temp,maxn);
         }
         for(int k=maxn;;++k) {
             if(k*n-sum>sum) {
                 cout<<k<<endl;
                 break;
             }
         }
     }
 }

A - Elections

 #include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<map>
 #define lson i<<1
 #define rson i<<1|1
 #define LS l,mid,lson
 #define RS mid+1,r,rson
 #define mem(a,x) memset(a,x,sizeof(a))
 #define gcd(a,b) __gcd(a,b)
 #define ll long long
 #define ull unsigned long long
 #define lowbit(x) (x&-x)
 #define pb(x) push_back(x)
 #define enld endl
 #define mian main
 #define itn int
 #define prinft printf
 #define Max(a,b,c) max(a,max(b,c))
 #pragma GCC optimize(2)
 //#pragma comment(linker, "/STACK:102400000,102400000")

 const double PI = acos (-1.0);
 const int INF = 0x3f3f3f3f;
 ;
 ;
 ;
 ;
 ;

 using namespace std;

 int n;
 int a[MAXN];
 int ans[MAXN];

 bool check(int x)
 {
     ;i+x<n;++i) {
         ]-a[i]!=a[i+x+]-a[i+x]) return false;
     }
     return true;
 }

 int main() {
     //std::ios::sync_with_stdio(false);
     //cin.tie(NULL);
     cin>>n;
     ;i<=n;++i) cin>>a[i];
     ;
     a[]=;
     ;i<=n;++i) {
         if(check(i)) ans[cnt++]=i;
     }
     cout<<cnt<<endl;
     ;i<cnt;++i ) {
         if(i) cout<<' ';
         cout<<ans[i];
     }cout<<endl;
 }

B - Lost Array

 //#include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<map>
 #define lson i<<1
 #define rson i<<1|1
 #define LS l,mid,lson
 #define RS mid+1,r,rson
 #define mem(a,x) memset(a,x,sizeof(a))
 #define gcd(a,b) __gcd(a,b)
 #define ll long long
 #define ull unsigned long long
 #define lowbit(x) (x&-x)
 #define pb(x) push_back(x)
 #define enld endl
 #define mian main
 #define itn int
 #define prinft printf
 #define Max(a,b,c) max(a,max(b,c))
 #pragma GCC optimize(2)
 //#pragma comment(linker, "/STACK:102400000,102400000")

 const double PI = acos (-1.0);
 const ll INF = 0x3f3f3f3f3f3f3f3f;
 ;
 ;
 ;
 ;
 ;

 using namespace std;

 string s;
 int a[MAXN];

 int main() {
     std::ios::sync_with_stdio(false);
     cin.tie(NULL);

     cin>>s;

     ) {cout<<<<endl; ;}

     mem(a,);
     ;i<s.size()-;++i) {
         if(i)cout<<' ';
         ]) cout<<;
         ;
     }
     ]=="<<endl;
     "<<endl;
 }

C - Smallest Word

 #include<bits/stdc++.h>
 #include<iostream>
 #include<cstdio>
 #include<cstdlib>
 #include<cstring>
 #include<cmath>
 #include<algorithm>
 #include<queue>
 #include<vector>
 #include<map>
 #define lson i<<1
 #define rson i<<1|1
 #define LS l,mid,lson
 #define RS mid+1,r,rson
 #define mem(a,x) memset(a,x,sizeof(a))
 #define gcd(a,b) __gcd(a,b)
 #define ll long long
 #define ull unsigned long long
 #define lowbit(x) (x&-x)
 #define pb(x) push_back(x)
 #define enld endl
 #define mian main
 #define itn int
 #define prinft printf
 #define Max(a,b,c) max(a,max(b,c))
 #pragma GCC optimize(2)
 //#pragma comment(linker, "/STACK:102400000,102400000")

 const double PI = acos (-1.0);
 const ll INF = 0x3f3f3f3f3f3f3f3f;
 ;
 ;
 ;
 ;
 ;

 using namespace std;

 int n,m;
 ][MAXN];
 ][MAXN];
 ll ans[MAXN];
 ll q;

 int main() {
     std::ios::sync_with_stdio(false);
     cin.tie(NULL);

     cin>>n>>m;
     mem(ans,);
     ; i<=m; ++i) {
         ; j<=n; ++j) {
             cin>>a[i][j];
             ==)
                 pre[i][a[i][j]]=;
             else
                 pre[i][a[i][j]]=a[i][j-];

         }
     }
     q=n;
     ; i<=n; ++i) {
         ll cnt=;
         ; j<m; ++j) {
             if(pre[j][a[m][i]]==pre[m][a[m][i]])
                 cerr<<++cnt<<endl;
                 //++cnt;
         }
         )
             ans[i]=ans[i-]+;
         q+=ans[i];
     }
     cout<<q<<endl;

 }

D - Mysterious Crime