제출 #284949

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
284949		toloraia	Labels (NOI20_labels)	C++17	100 / 100	114 ms	6776 KiB

Labels

#include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
//#define ll __int128
#define ll long long
#define int long long
#define LEFT(a) ((a)<<1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a,b) ((a+b)>>1)
#define MAX(a,b) ((a)>(b)?(a):(b))
#define MIN(a,b) ((a)<(b)?(a):(b))
#define y1 y122

#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
/*
#pragma GCC optimize ("O3")
#pragma GCC optimize("Ofast")

#pragma GCC target("avx2,fma")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC target ("avx2")
#pragma GCC optimization ("unroll-loops")

#pragma comment(linker, "/STACK: 20000000005")
*/

using namespace std;

const int N = 300005, MOD = 1e9+7;

int n;
int a[N];

main()
{
    //freopen ("in.in", "r", stdin);freopen ("out.out", "w", stdout);
    ios_base::sync_with_stdio(0);
    cin >> n;
    int x = 1, y = n;
    for (int i = 1; i < n; i++){
        cin >> a[i];
        a[i] += a[i-1];
        x = max (x, 1 - a[i]);
        y = min (y, n - a[i]);
    }
    if (x != y)
        cout << -1 << endl;
    else {
        for (int i = 0; i < n; i++)
            cout << x + a[i] << " ";
        cout << endl;
    }
}

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

Labels.cpp:18: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
   18 | #pragma GCC optimization ("unroll-loops")
      | 
Labels.cpp:38:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   38 | main()
      |      ^

• Subtask 1: 7 / 7
• Subtask 2: 15 / 15
• Subtask 3: 25 / 25
• Subtask 4: 18 / 18
• Subtask 5: 35 / 35