oj.uz

답안 #613941

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
613941 2022-07-30T14:01:18 Z dxz05 분수 공원 (IOI21_parks) C++17
15 / 100
 394 ms 37332 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;
#define MP make_pair
#define all(x) (x).begin(), (x).end()

struct dsu {
    vector<int> p, sz;
    dsu(int n) {
        p.assign(n, 0);
        sz.assign(n, 1);
        iota(p.begin(), p.end(), 0);
    }

    int find(int x) {
        return (x == p[x] ? x : p[x] = find(p[x]));
    }

    bool unite(int x, int y) {
        x = find(x);
        y = find(y);
        if (x == y) return false;
        if (sz[x] > sz[y]) swap(x, y);
        p[x] = y;
        sz[y] += sz[x];
        return true;
    }
};

int construct_roads(vector<int> x, vector<int> y) {
    int n = (int)x.size();
    if (n == 1) {
	    build({}, {}, {}, {});
        return 1;
    }

    map<pair<int, int>, int> id;
    for (int i = 0; i < n; i++) id[MP(x[i], y[i])] = i;

    vector<int> U, V, A, B;
    
    vector<int> perm(n);
    iota(all(perm), 0);
    sort(all(perm), [&](int i, int j){
        return MP(x[i], y[i]) < MP(x[j], y[j]);
    });

    dsu d(n);
    for (int i : perm){
        if (id.find(MP(x[i], y[i] + 2)) == id.end()) continue;
        int j = id[MP(x[i], y[i] + 2)];
        if (d.unite(i, j)){
            U.push_back(i);
            V.push_back(j);
        }
    }

    for (int i : perm) {
        if (id.find(MP(x[i] + 2, y[i])) == id.end()) continue;
        int j = id[MP(x[i] + 2, y[i])];
        if (d.unite(i, j)) {
            U.push_back(i);
            V.push_back(j);
        }
    }

    if (U.size() != n - 1) return 0;

    A.resize(n - 1);
    B.resize(n - 1);

    set<pair<int, int>> benches;

    for (int it = 0; it < n - 1; it++){
        int i = U[it], j = V[it];
        if (x[i] == x[j]){
            if (x[i] == 2 || x[i] == 6){
                A[it] = (x[i] == 2 ? 1 : 7);
                B[it] = (y[i] + y[j]) / 2;
                benches.insert(MP(A[it], B[it]));
            }
        } else {
            int xx = (x[i] + x[j]) / 2;
            if (xx == 3){
                A[it] = xx;
                B[it] = y[i] - 1;
            } else {
                A[it] = xx;
                B[it] = y[i] + 1;
            }
            benches.insert(MP(A[it], B[it]));
        }
    }

    for (int it = 0; it < n - 1; it++) {
        int i = U[it], j = V[it];
        if (x[i] == x[j] && x[i] == 4) {
            int yy = (y[i] + y[j]) / 2;
            B[it] = yy;
            if (!benches.count(MP(x[i] - 1, yy))){
                A[it] = x[i] - 1;
            } else {
                A[it] = x[i] + 1;
            }
            benches.insert(MP(A[it], B[it]));
        }
    }

    build(U, V, A, B);
    return 1;
}

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:68:18: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   68 |     if (U.size() != n - 1) return 0;
      |         ~~~~~~~~~^~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 144 ms 18744 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 64 ms 10264 KB Output is correct
12 Correct 16 ms 3372 KB Output is correct
13 Correct 32 ms 4972 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 169 ms 18744 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 144 ms 18744 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 64 ms 10264 KB Output is correct
12 Correct 16 ms 3372 KB Output is correct
13 Correct 32 ms 4972 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 169 ms 18744 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 304 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 394 ms 37332 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 436 KB Output is correct
26 Correct 3 ms 628 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 128 ms 15184 KB Output is correct
29 Correct 202 ms 22492 KB Output is correct
30 Correct 292 ms 29896 KB Output is correct
31 Correct 358 ms 37144 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 304 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 296 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 193 ms 18788 KB Output is correct
46 Correct 235 ms 27028 KB Output is correct
47 Correct 268 ms 27084 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 144 ms 18744 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 64 ms 10264 KB Output is correct
12 Correct 16 ms 3372 KB Output is correct
13 Correct 32 ms 4972 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 169 ms 18744 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 304 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 394 ms 37332 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 436 KB Output is correct
26 Correct 3 ms 628 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 128 ms 15184 KB Output is correct
29 Correct 202 ms 22492 KB Output is correct
30 Correct 292 ms 29896 KB Output is correct
31 Correct 358 ms 37144 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 304 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 296 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 193 ms 18788 KB Output is correct
46 Correct 235 ms 27028 KB Output is correct
47 Correct 268 ms 27084 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 296 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 300 KB Output is correct
53 Incorrect 1 ms 212 KB Tree @(5, 3) appears more than once: for edges on positions 1 and 5
54 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 144 ms 18744 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 64 ms 10264 KB Output is correct
12 Correct 16 ms 3372 KB Output is correct
13 Correct 32 ms 4972 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 169 ms 18744 KB Output is correct
17 Incorrect 1 ms 292 KB a[0] = 0 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 144 ms 18744 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 64 ms 10264 KB Output is correct
12 Correct 16 ms 3372 KB Output is correct
13 Correct 32 ms 4972 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 169 ms 18744 KB Output is correct
17 Incorrect 350 ms 35092 KB a[50000] = 0 is not an odd integer
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 1 ms 296 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 144 ms 18744 KB Output is correct
10 Correct 11 ms 2388 KB Output is correct
11 Correct 64 ms 10264 KB Output is correct
12 Correct 16 ms 3372 KB Output is correct
13 Correct 32 ms 4972 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 169 ms 18744 KB Output is correct
17 Correct 0 ms 296 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 0 ms 304 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 394 ms 37332 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 436 KB Output is correct
26 Correct 3 ms 628 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 128 ms 15184 KB Output is correct
29 Correct 202 ms 22492 KB Output is correct
30 Correct 292 ms 29896 KB Output is correct
31 Correct 358 ms 37144 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 304 KB Output is correct
37 Correct 1 ms 304 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 0 ms 296 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 3 ms 468 KB Output is correct
44 Correct 3 ms 596 KB Output is correct
45 Correct 193 ms 18788 KB Output is correct
46 Correct 235 ms 27028 KB Output is correct
47 Correct 268 ms 27084 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 296 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 300 KB Output is correct
53 Incorrect 1 ms 212 KB Tree @(5, 3) appears more than once: for edges on positions 1 and 5
54 Halted 0 ms 0 KB -