oj.uz

답안 #320573

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320573 2020-11-09T06:25:46 Z vishesh312 Labels (NOI20_labels) C++17
7 / 100
 1000 ms 3928 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);
    vector<vector<int>> out;
    for (auto &x : v) cin >> x;
    for (int first = 1; first <= n; ++first) {
        vector<int> ans(n);
        ans[0] = first;
        for (int i = 1; i < n; ++i) {
            ans[i] = ans[i-1] + v[i-1];
        }
        if (*max_element(all(ans))<=n and *min_element(all(ans))>0)out.pb(ans);
    }
    deb(sz(out));
    for (auto a : out[4]) deb(a)
    if (sz(out)>1) cout << -1 << '\n'; else for (auto a : out) for (auto b : a) cout << b << " ";
}

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
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Runtime error 1 ms 492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Runtime error 1 ms 492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1048 ms 3928 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Runtime error 1 ms 492 KB Execution killed with signal 11 (could be triggered by violating memory limits)
5 Halted 0 ms 0 KB -