답안 #262881

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
262881	2020-08-13T10:28:20 Z	FutymyClone	Labels (NOI20_labels)	C++14	25 / 100	166 ms	25848 KB

Labels

#include <bits/stdc++.h>

using namespace std;

const int N = 3e5 + 5;

int n, d[N], a[N];
long long f[N];
map <long long, int> mm;

int main(){
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n;
    for (int i = 1; i <= n - 1; i++) cin >> d[i], f[i] = f[i - 1] + d[i];
    mm[f[0]] = 0;
    pair <int, int> temp = make_pair(-1, -1);

    for (int i = 1; i <= n; i++) {
        if (mm.count(f[i] - (n - 1))) {
            temp = make_pair(mm[f[i] - (n - 1)] + 1, i + 1);
            break;
        }

        mm[f[i]] = i;
    }

    if (temp.first == -1) return cout << -1 << "\n", 0;
    a[temp.first] = 1, a[temp.second] = n;
    for (int i = temp.first + 1; i < temp.second; i++) a[i] = d[i - 1] + a[i - 1];
    for (int i = temp.first - 1; i >= 1; i--) a[i] = a[i + 1] - d[i];
    for (int i = temp.second + 1; i <= n; i++) a[i] = a[i - 1] + d[i - 1];
    for (int i = 1; i <= n - 1; i++) if (a[i + 1] - a[i] != d[i]) return cout << -1 << "\n", 0;
    for (int i = 1; i <= n; i++) if (a[i] < 1 || a[i] > n) return cout << -1 << "\n", 0;
    for (int i = 1; i <= n; i++) cout << a[i] << " ";
    cout << "\n";
    return 0;
}

Subtask #1

7.0 / 7.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct

Subtask #2

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Incorrect	1 ms	384 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 25.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Incorrect	1 ms	384 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #4

18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	150 ms	25824 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	166 ms	25848 KB	Output is correct
4	Correct	22 ms	3840 KB	Output is correct
5	Correct	39 ms	3968 KB	Output is correct
6	Correct	118 ms	13304 KB	Output is correct
7	Correct	99 ms	13236 KB	Output is correct
8	Correct	46 ms	3960 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct

Subtask #5

0 / 35.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	384 KB	Output is correct
2	Correct	0 ms	384 KB	Output is correct
3	Correct	0 ms	384 KB	Output is correct
4	Correct	0 ms	384 KB	Output is correct
5	Correct	0 ms	384 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	0 ms	384 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	0 ms	384 KB	Output is correct
10	Correct	0 ms	384 KB	Output is correct
11	Correct	0 ms	384 KB	Output is correct
12	Correct	0 ms	384 KB	Output is correct
13	Correct	0 ms	384 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	0 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	0 ms	384 KB	Output is correct
18	Incorrect	1 ms	384 KB	Output isn't correct
19	Halted	0 ms	0 KB	-