oj.uz

답안 #869119

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
869119 2023-11-03T09:00:21 Z tvladm2009 Labels (NOI20_labels) C++17
0 / 100
 29 ms 6972 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
const int N = (int) 3e5 + 7;
ll n, a[N], pre[N];

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

  // freopen("input", "r", stdin);

  cin >> n;
  for (int i = 1; i < n; i++) {
    cin >> a[i];
  }
  ll mx = 0, mn = 0;
  for (int i = 1; i < n; i++) {
    pre[i] = pre[i - 1] + a[i];
    mx = max(mx, pre[i]);
    mn = min(mn, pre[i]);
  }
  ll low = (mn <= 0 ? mn + 1 : 1), high = n - mx;
  if (low == high) {
    cout << low << " ";
    for (int i = 1; i < n; i++) {
      low += a[i];
      cout << low << " ";
    }
    cout << "\n";
    return 0;
  }
  cout << "-1\n";
  return 0;
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 6972 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Incorrect 14 ms 4956 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Incorrect 0 ms 2396 KB Output isn't correct
3 Halted 0 ms 0 KB -