제출 #426326

#제출 시각아이디문제언어결과실행 시간메모리
426326TLP39Labels (NOI20_labels)C++14
100 / 100
98 ms5664 KiB
#include <stdio.h>
#include <math.h>
#include <utility>
#include <string.h>
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
using namespace std;
typedef long long int ll;

int main()
{
    int n;
    scanf("%d",&n);
    vector<int> ans;
    int a=0,ma=0,mi=0,d;
    ans.push_back(a);
    for(int i=1;i<n;i++)
    {
        scanf("%d",&d);
        a+=d;
        ma=max(ma,a);
        mi=min(mi,a);
        ans.push_back(a);
    }
    if(ma-mi !=n-1)
    {
        printf("-1");
        return 0;
    }
    for(int i=0;i<n;i++)
    {
        printf("%d ",ans[i]-mi+1);
    }
}

컴파일 시 표준 에러 (stderr) 메시지

Labels.cpp: In function 'int main()':
Labels.cpp:16:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   16 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
Labels.cpp:22:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |         scanf("%d",&d);
      |         ~~~~~^~~~~~~~~
#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...