Submission #796279

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
796279	2023-07-28T08:49:01 Z	t6twotwo	Fountain Parks (IOI21_parks)	C++17	5 / 100	48 ms	7108 KB

parks

#include "parks.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int construct_roads(vector<int> X, vector<int> Y) {
    int N = X.size();
    vector<int> ord(N);
    iota(ord.begin(), ord.end(), 0);
    sort(ord.begin(), ord.end(), [&](int i, int j) {
        return Y[i] < Y[j];
    });
    vector<int> u, v, a, b;
    for (int i = 0; i < N - 1; i++) {
        if (Y[ord[i]] + 2 != Y[ord[i + 1]]) {
            return 0;
        }
        u.push_back(ord[i]);
        v.push_back(ord[i + 1]);
        a.push_back(1);
        b.push_back(Y[ord[i]] + 1);
    }
    build(u, v, a, b);
    return 1;
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	47 ms	7108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	24 ms	4052 KB	Output is correct
12	Correct	6 ms	1492 KB	Output is correct
13	Correct	7 ms	1876 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	48 ms	7100 KB	Output is correct

Subtask #2

0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	47 ms	7108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	24 ms	4052 KB	Output is correct
12	Correct	6 ms	1492 KB	Output is correct
13	Correct	7 ms	1876 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	48 ms	7100 KB	Output is correct
17	Incorrect	0 ms	212 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	47 ms	7108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	24 ms	4052 KB	Output is correct
12	Correct	6 ms	1492 KB	Output is correct
13	Correct	7 ms	1876 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	48 ms	7100 KB	Output is correct
17	Incorrect	0 ms	212 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	47 ms	7108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	24 ms	4052 KB	Output is correct
12	Correct	6 ms	1492 KB	Output is correct
13	Correct	7 ms	1876 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	48 ms	7100 KB	Output is correct
17	Incorrect	0 ms	212 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	47 ms	7108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	24 ms	4052 KB	Output is correct
12	Correct	6 ms	1492 KB	Output is correct
13	Correct	7 ms	1876 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	48 ms	7100 KB	Output is correct
17	Incorrect	41 ms	4172 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	47 ms	7108 KB	Output is correct
10	Correct	4 ms	1108 KB	Output is correct
11	Correct	24 ms	4052 KB	Output is correct
12	Correct	6 ms	1492 KB	Output is correct
13	Correct	7 ms	1876 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	340 KB	Output is correct
16	Correct	48 ms	7100 KB	Output is correct
17	Incorrect	0 ms	212 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-