답안 #1062598

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1062598	2024-08-17T08:59:09 Z	j_vdd16	분수 공원 (IOI21_parks)	C++17	5 / 100	67 ms	8616 KB

parks

#include "parks.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

int construct_roads(std::vector<int> x, std::vector<int> y) {
    int n = x.size();
    vector<pair<ii, int>> benches(n);

    loop(i, n) {
        benches[i].first.first = y[i];
        benches[i].first.second = x[i];
        benches[i].second = i;
    }
    sort(all(benches));

    int diff = benches.back().first.first - benches[0].first.first;
    if (diff / 2 + 1 != n) 
        return 0;

    int m = n - 1;
    vi u(m), v(m), a(m), b(m);
    loop(i, n - 1) {
        u[i] = benches[i].second;
        v[i] = benches[i + 1].second;

        a[i] = 3;
        b[i] = benches[i].first.first + 1;
    }

    build(u, v, a, b);
    return 1;
}

Subtask #1

5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	34 ms	8508 KB	Output is correct
10	Correct	6 ms	1208 KB	Output is correct
11	Correct	17 ms	4700 KB	Output is correct
12	Correct	5 ms	1708 KB	Output is correct
13	Correct	10 ms	1884 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	45 ms	8616 KB	Output is correct

Subtask #2

0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	34 ms	8508 KB	Output is correct
10	Correct	6 ms	1208 KB	Output is correct
11	Correct	17 ms	4700 KB	Output is correct
12	Correct	5 ms	1708 KB	Output is correct
13	Correct	10 ms	1884 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	45 ms	8616 KB	Output is correct
17	Incorrect	0 ms	348 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #3

0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	34 ms	8508 KB	Output is correct
10	Correct	6 ms	1208 KB	Output is correct
11	Correct	17 ms	4700 KB	Output is correct
12	Correct	5 ms	1708 KB	Output is correct
13	Correct	10 ms	1884 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	45 ms	8616 KB	Output is correct
17	Incorrect	0 ms	348 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #4

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	34 ms	8508 KB	Output is correct
10	Correct	6 ms	1208 KB	Output is correct
11	Correct	17 ms	4700 KB	Output is correct
12	Correct	5 ms	1708 KB	Output is correct
13	Correct	10 ms	1884 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	45 ms	8616 KB	Output is correct
17	Incorrect	0 ms	344 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #5

0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	34 ms	8508 KB	Output is correct
10	Correct	6 ms	1208 KB	Output is correct
11	Correct	17 ms	4700 KB	Output is correct
12	Correct	5 ms	1708 KB	Output is correct
13	Correct	10 ms	1884 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	45 ms	8616 KB	Output is correct
17	Incorrect	67 ms	7860 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-

Subtask #6

0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	392 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	34 ms	8508 KB	Output is correct
10	Correct	6 ms	1208 KB	Output is correct
11	Correct	17 ms	4700 KB	Output is correct
12	Correct	5 ms	1708 KB	Output is correct
13	Correct	10 ms	1884 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	604 KB	Output is correct
16	Correct	45 ms	8616 KB	Output is correct
17	Incorrect	0 ms	348 KB	Solution announced impossible, but it is possible.
18	Halted	0 ms	0 KB	-