oj.uz

Submission #701708

# Submission time Handle Problem Language Result Execution time Memory
701708 2023-02-22T01:59:10 Z shmad Labels (NOI20_labels) C++17
0 / 100
 38 ms 6732 KB 
#pragma GCC optimize("O3", "unroll-loops") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 1e6 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

int n, d[N], a[N], p[N];

void solve () {
	cin >> n;
	for (int i = 1; i < n; i++) cin >> d[i], p[i] = p[i - 1] + d[i];
	int mx = 0;
	for (int i = 1; i < n; i++) mx = max(mx, p[i]);
	// (a[2] - a[1]) + (a[3] - a[2]) + ... (a[5] - a[4]) = a[5] - a[1]
	// p[i] = (a[i] - a[1]), a[i] = n, n - (n - a[1]) = a[1]
	a[1] = n - mx;
	bool ok = 1;
	for (int i = 2; i <= n; i++) a[i] = a[i - 1] + d[i - 1], ok &= (a[i] >= 1 && a[i] <= n);
	if (!ok) cout << "-1\n", exit(0);
	for (int i = 1; i <= n; i++) cout << a[i] << ' ';	
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef ONLINE_JUDGE
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 6352 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 37 ms 6732 KB Output is correct
4 Incorrect 38 ms 6708 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -