제출 #736177

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
736177		Nhoksocqt1	Nizin (COCI16_nizin)	C++17	100 / 100	62 ms	6260 KiB

nizin

#include<bits/stdc++.h>
using namespace std;

#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;

template<class X, class Y>
    inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
    inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
    return uniform_int_distribution<int>(l, r)(rng);
}

const int MAXN = 1000006;

int val[MAXN], nArr;

void process() {
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) {
        cin >> val[i];
    }

    if(nArr == 1) {
        cout << "0\n";
        return;
    }

    ll suml(val[1]), sumr(val[nArr]);
    int result(0), l(1), r(nArr);
    while(l < r) {
        //cout << suml << ' ' << sumr << ' ' << l << ' ' << r << '\n';
        if(suml == sumr) {
            suml = val[++l], sumr = val[--r];
            if(l >= r)
                break;

            continue;
        }

        ++result;
        if(suml < sumr) {
            suml += val[++l];
        } else {
            sumr += val[--r];
        }

        if(l == r)
            break;
    }

    cout << result << '\n';
}

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

    process();
    return 0;
}

• 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