Submission #256198

#TimeUsernameProblemLanguageResultExecution timeMemory
256198BruteforcemanLabels (NOI20_labels)C++11
100 / 100
190 ms3684 KiB
#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
int a[maxn];

int main() {
  int n;
  cin >> n;
  int first = n;
  for(int i = 2; i <= n; i++) {
    int x;
    cin >> x;
    a[i] = a[i - 1] + x;
    if(abs(a[i]) >= n) {
      cout << -1 << endl;
      exit(0);
    }
    first = min(first, n - a[i]);
  }
  for(int i = 1; i <= n; i++) {
    a[i] += first;
    if(a[i] < 1 || n < a[i]) {
      cout << -1 << endl;
      exit(0);
    }
  }
  if(*min_element(a + 1, a + n + 1) != 1 || *max_element(a + 1, a + n + 1) != n) {
    cout << -1 << endl;
    exit(0);
  }
  for(int i = 1; i <= n; i++) cout << a[i] << " ";
  cout << endl;
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...