Submission #157302

#	Time	Username	Problem	Language	Result	Execution time	Memory
157302		GoldNextYear	Nizin (COCI16_nizin)	C++14	100 / 100	264 ms	6392 KiB

nizin

#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#include <bits/stdc++.h>
using namespace std;
#define sqr 340
#define mid (l+r)/2
#define pb push_back
#define ppb pop_back
#define fi first
#define se second
#define lb lower_bound
#define ub upper_bound
#define ins insert
#define era erase
#define C continue
#define mem(dp,i) memset(dp,i,sizeof(dp))
#define mset multiset
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pi;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pi> vpi;
typedef vector<pll> vpll;
const ll mod=1000000007;
const ll inf=1e18*4;
const ld pai=acos(-1);
int n,num;
int a[1000009];
int main(){
        cin>>n;
        for(int i=0;i<n;i++)cin>>a[i];
        int i=0,j=n-1;
        int crnt1=a[i];
        int crnt2=a[j];
        while(i<j){
                if(crnt1==crnt2)i++,j--,crnt1+=a[i],crnt2+=a[j];
                else if(crnt1>crnt2)j--,crnt2+=a[j],num++;
                else i++,crnt1+=a[i],num++;
        }
        cout<<num<<endl;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10
• Subtask 8: 10 / 10
• Subtask 9: 10 / 10
• Subtask 10: 10 / 10