oj.uz

Submission #320537

# Submission time Handle Problem Language Result Execution time Memory
320537 2020-11-09T04:25:19 Z vishesh312 Labels (NOI20_labels) C++17
0 / 100
 51 ms 5880 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define deb(x)        cerr << #x << " = " << x << "\n";
#define deb2(x, y)    cerr << #x << " = " << x << ", " << #y << " = " << y << "\n";
#define deb3(x, y, z) cerr << #x << " = " << x << ", " << #y << " = " << y << ", " << #z << " = " << z << "\n";

#define pb push_back
#define eb emplace_back
#define mp make_pair
#define f  first
#define s  second

#define all(x) begin(x), end(x)
#define sz(x) (int)x.size()

using ordered_set = tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>;
using ordered_multiset = tree<int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;  

ll binpow(ll a, ll b) {
    //a = a % mod;
    ll res = 1;
    while ( b > 0) {
        if (b&1) {
            res = (a*res);//%mod;
        }
        a = (a*a);//%mod;
        b >>= 1;
    }
    return res;
}

void solve(int tc) {
    int n;
    cin >> n;
    vector<int> v(n-1), p(n-1);
    for (int i = 0; i < n-1; ++i) {
        cin >> v[i];
        p[i] = v[i];
        if (i) p[i] += p[i-1];
    }
    int mx = 0, pos = -1;
    for (int i = 0; i < n-1; ++i) {
        if (p[i] > mx) {
            mx = p[i];
            pos = i;
        }
    }
    if (pos == -1) {
        cout << -1 << '\n';
        return;
    }
    vector<int> ans(n);
    ans[0] = n-mx;
    for (int i = 1; i < n; ++i) {
        ans[i] = ans[i-1] + v[i-1];
    }
    for (auto x : ans) cout << x << " ";
}

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

    int tc = 1;
    //cin >> tc;

    for (int i = 1; i <= tc; ++i) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 5880 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Incorrect 24 ms 2668 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Incorrect 0 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -