oj.uz

Submission #539331

# Submission time Handle Problem Language Result Execution time Memory
539331 2022-03-18T17:54:31 Z SmolBrain Labels (NOI20_labels) C++17
100 / 100
 70 ms 9076 KB 
// Om Namah Shivaya
// GM in 137 days

#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;

template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long int ll;
typedef long double ld;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}

void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}

template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }

void usaco(string filename) {
    freopen((filename + ".in").c_str(), "r", stdin);
    freopen((filename + ".out").c_str(), "w", stdout);
}

const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    /*

    the sequence is uniquely determined by the first element
    let x = first element, mx = max prefix, mn = min prefix

    x + mx <= n
    x <= n - mx

    x + mn >= 1
    x >= 1 - mn

    1 - mn <= x <= n - mx

    if the no.of elements in this range != 1, then the answer is -1
    else fix the first element as 1 - mn and generate the final array

    */

    ll n; cin >> n;
    vector<ll> a(n - 1);
    rep(i, n - 1) cin >> a[i];

    ll mx = 0, mn = 0, curr = 0;
    rep(i, n - 1) {
        curr += a[i];
        amax(mx, curr);
        amin(mn, curr);
    }

    ll l = 1 - mn, r = n - mx;
    if (r - l + 1 != 1) {
        cout << -1 << endl;
        return;
    }

    vector<ll> ans(n);
    ans[0] = l;

    rep1(i, n - 1) {
        ans[i] = ans[i - 1] + a[i - 1];
    }

    rep(i, n) cout << ans[i] << " ";
    cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;
    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

Labels.cpp: In function 'void usaco(std::string)':
Labels.cpp:62:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   62 |     freopen((filename + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Labels.cpp:63:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   63 |     freopen((filename + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 224 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 228 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 228 KB Output is correct
49 Correct 1 ms 228 KB Output is correct
50 Correct 1 ms 228 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 320 KB Output is correct
53 Correct 0 ms 212 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 224 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 228 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 228 KB Output is correct
49 Correct 1 ms 228 KB Output is correct
50 Correct 1 ms 228 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 320 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 1 ms 328 KB Output is correct
75 Correct 1 ms 332 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 1 ms 328 KB Output is correct
80 Correct 1 ms 328 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 324 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 1 ms 212 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 324 KB Output is correct
92 Correct 1 ms 212 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 324 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 300 KB Output is correct
98 Correct 1 ms 328 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 1 ms 340 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 1 ms 212 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 7636 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 66 ms 7764 KB Output is correct
4 Correct 15 ms 3184 KB Output is correct
5 Correct 20 ms 3312 KB Output is correct
6 Correct 19 ms 3404 KB Output is correct
7 Correct 18 ms 3180 KB Output is correct
8 Correct 26 ms 3304 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #5
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 324 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 328 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 324 KB Output is correct
23 Correct 1 ms 328 KB Output is correct
24 Correct 1 ms 224 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 324 KB Output is correct
28 Correct 1 ms 320 KB Output is correct
29 Correct 1 ms 324 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 1 ms 324 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 228 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 228 KB Output is correct
49 Correct 1 ms 228 KB Output is correct
50 Correct 1 ms 228 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 320 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 1 ms 332 KB Output is correct
55 Correct 1 ms 328 KB Output is correct
56 Correct 1 ms 332 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 332 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 340 KB Output is correct
62 Correct 1 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 340 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 340 KB Output is correct
67 Correct 1 ms 336 KB Output is correct
68 Correct 1 ms 340 KB Output is correct
69 Correct 1 ms 328 KB Output is correct
70 Correct 1 ms 328 KB Output is correct
71 Correct 1 ms 212 KB Output is correct
72 Correct 1 ms 340 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 1 ms 328 KB Output is correct
75 Correct 1 ms 332 KB Output is correct
76 Correct 1 ms 340 KB Output is correct
77 Correct 1 ms 340 KB Output is correct
78 Correct 1 ms 332 KB Output is correct
79 Correct 1 ms 328 KB Output is correct
80 Correct 1 ms 328 KB Output is correct
81 Correct 1 ms 340 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 1 ms 340 KB Output is correct
84 Correct 1 ms 328 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 324 KB Output is correct
87 Correct 1 ms 340 KB Output is correct
88 Correct 1 ms 212 KB Output is correct
89 Correct 1 ms 212 KB Output is correct
90 Correct 1 ms 340 KB Output is correct
91 Correct 1 ms 324 KB Output is correct
92 Correct 1 ms 212 KB Output is correct
93 Correct 1 ms 212 KB Output is correct
94 Correct 1 ms 212 KB Output is correct
95 Correct 1 ms 324 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 1 ms 300 KB Output is correct
98 Correct 1 ms 328 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 1 ms 340 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 1 ms 212 KB Output is correct
104 Correct 48 ms 7636 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 66 ms 7764 KB Output is correct
107 Correct 15 ms 3184 KB Output is correct
108 Correct 20 ms 3312 KB Output is correct
109 Correct 19 ms 3404 KB Output is correct
110 Correct 18 ms 3180 KB Output is correct
111 Correct 26 ms 3304 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 29 ms 4556 KB Output is correct
115 Correct 54 ms 8936 KB Output is correct
116 Correct 32 ms 4584 KB Output is correct
117 Correct 30 ms 4688 KB Output is correct
118 Correct 57 ms 8928 KB Output is correct
119 Correct 36 ms 4568 KB Output is correct
120 Correct 57 ms 8932 KB Output is correct
121 Correct 56 ms 8920 KB Output is correct
122 Correct 65 ms 8924 KB Output is correct
123 Correct 43 ms 4564 KB Output is correct
124 Correct 57 ms 8928 KB Output is correct
125 Correct 52 ms 9076 KB Output is correct
126 Correct 57 ms 8920 KB Output is correct
127 Correct 57 ms 8952 KB Output is correct
128 Correct 30 ms 4576 KB Output is correct
129 Correct 55 ms 8908 KB Output is correct
130 Correct 58 ms 8912 KB Output is correct
131 Correct 55 ms 8964 KB Output is correct
132 Correct 53 ms 8928 KB Output is correct
133 Correct 69 ms 8912 KB Output is correct
134 Correct 30 ms 4556 KB Output is correct
135 Correct 60 ms 8980 KB Output is correct
136 Correct 30 ms 4576 KB Output is correct
137 Correct 32 ms 4556 KB Output is correct
138 Correct 32 ms 4568 KB Output is correct
139 Correct 38 ms 4584 KB Output is correct
140 Correct 31 ms 4576 KB Output is correct
141 Correct 38 ms 4564 KB Output is correct
142 Correct 70 ms 8924 KB Output is correct
143 Correct 31 ms 4584 KB Output is correct
144 Correct 32 ms 4684 KB Output is correct
145 Correct 51 ms 8932 KB Output is correct
146 Correct 57 ms 8908 KB Output is correct
147 Correct 58 ms 8936 KB Output is correct
148 Correct 57 ms 9020 KB Output is correct
149 Correct 40 ms 7532 KB Output is correct
150 Correct 54 ms 7876 KB Output is correct
151 Correct 15 ms 3156 KB Output is correct
152 Correct 18 ms 3300 KB Output is correct
153 Correct 19 ms 3408 KB Output is correct
154 Correct 16 ms 3156 KB Output is correct
155 Correct 29 ms 3284 KB Output is correct
156 Correct 1 ms 212 KB Output is correct
157 Correct 0 ms 212 KB Output is correct
158 Correct 33 ms 4548 KB Output is correct
159 Correct 0 ms 212 KB Output is correct
160 Correct 51 ms 8992 KB Output is correct
161 Correct 28 ms 4580 KB Output is correct
162 Correct 28 ms 4564 KB Output is correct
163 Correct 29 ms 4576 KB Output is correct