Submission #448389

#	Time	Username	Problem	Language	Result	Execution time	Memory
448389		julian33	Nizin (COCI16_nizin)	C++14	100 / 100	89 ms	10540 KiB

nizin

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {
    cerr<<vars<<" = ";
    string delim="";
    (...,(cerr<<delim<<values,delim=", "));
    cerr<<"\n";
}
#else
#define deb(...) logger(#__VA_ARGS__, __VA_ARGS__)
template<typename ...Args>
void logger(string vars, Args&&... values) {}
#endif

#define pb push_back
#define sz(x) (int)(x.size())
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
template<typename T> inline void maxa(T& a,T b){a=max(a,b);}
template<typename T> inline void mina(T& a,T b){a=min(a,b);} 
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int mxN=2e5+5; //make sure this is right
const int mod=1e9+7;

int main(){
    cin.sync_with_stdio(0);
    cin.tie(0); cout.tie(0);

    #ifdef LOCAL
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
    #endif

    int n; cin>>n;
    deque<ll> dq;
    for(int i=0;i<n;i++){
        int x; cin>>x;
        dq.pb(x);
    }
    int ans=0;
    while(sz(dq)>1){
        if(dq.front()==dq.back()){
            dq.pop_front();
            dq.pop_back();
        } else if(dq.front()<dq.back()){
            ll k=dq.front();
            dq.pop_front();
            dq.front()+=k;
            ans++;
        } else{
            ll k=dq.back();
            dq.pop_back();
            dq.back()+=k;
            ans++;
        }
    }
    cout<<ans<<"\n";
}

• 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