oj.uz

답안 #759499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
759499 2023-06-16T10:52:35 Z drdilyor 분수 공원 (IOI21_parks) C++17
5 / 100
 377 ms 27056 KB 
#include<bits/stdc++.h>
#include "parks.h"
using namespace std;

struct DSU {
    int n;
    vector<int> parent;
    vector<int> size;

    DSU(int n) : n(n), parent(n), size(n, 1) {
        iota(parent.begin(), parent.end(), 0);
    }

    int get(int i) {
        return parent[i] == i ? i : parent[i] = get(parent[i]);
    }

    void merge(int v, int u) {
        v = get(v);
        u = get(u);
        if (u == v) return;
        if (size[v] < size[u]) swap(v, u);
        parent[u] = v;
        size[v] += size[u];
    }
};


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

    int n = x.size();

    std::vector<int> u, v, a, b;
    map<pair<int,int>, int> ft;
    for (int i = 0; i < n;i ++)
        ft[{x[i], y[i]}] = i;
    set<pair<int,int>> bench;

    for (int i = 0; i < n; i++) {
        for (auto [dx, dy] : {pair{0, -2}, {0, +2}, {-2, 0}, {+2, 0}}) {
            pair pos{x[i]+dx, y[i]+dy};
            if (!ft.count(pos)) continue;
            int j = ft[pos];
            if (j < i) continue;
            u.push_back(i);
            v.push_back(j);
            vector<pair<int,int>> pos_bench;
            if (dx) {
                pos_bench = {{x[i]+dx/2, y[i]+1}, {x[i]+dx/2, y[i]-1}};
            } else {
                pos_bench = {{x[i]+1, y[i]+dy/2}, {x[i]-1, y[i]+dy/2}};
            }
            bool done = 0;
            for (auto pos : pos_bench) {
                if (bench.count(pos) == 0) {
                    done = 1;
                    a.push_back(pos.first);
                    b.push_back(pos.second);
                    break;
                }
                bench.insert(pos);
            }
            if (!done) return 0;
        }
    }
    a.resize(u.size());
    b.resize(u.size());
    DSU cc(n);
    for (int i = 0; i < (int)u.size(); i++) {
        cc.merge(u[i], v[i]);
    }
    if (cc.size[cc.get(0)] != n) return 0;

    build(u, v, a, b);

    return 1;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 1 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 167 ms 13700 KB Output is correct
10 Correct 9 ms 1876 KB Output is correct
11 Correct 57 ms 7612 KB Output is correct
12 Correct 13 ms 2516 KB Output is correct
13 Correct 35 ms 4904 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 191 ms 13664 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 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 1 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 167 ms 13700 KB Output is correct
10 Correct 9 ms 1876 KB Output is correct
11 Correct 57 ms 7612 KB Output is correct
12 Correct 13 ms 2516 KB Output is correct
13 Correct 35 ms 4904 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 191 ms 13664 KB Output is correct
17 Incorrect 1 ms 212 KB Tree @(3, 3) appears more than once: for edges on positions 2 and 3
18 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 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 1 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 167 ms 13700 KB Output is correct
10 Correct 9 ms 1876 KB Output is correct
11 Correct 57 ms 7612 KB Output is correct
12 Correct 13 ms 2516 KB Output is correct
13 Correct 35 ms 4904 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 191 ms 13664 KB Output is correct
17 Incorrect 1 ms 212 KB Tree @(3, 3) appears more than once: for edges on positions 2 and 3
18 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 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 1 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 167 ms 13700 KB Output is correct
10 Correct 9 ms 1876 KB Output is correct
11 Correct 57 ms 7612 KB Output is correct
12 Correct 13 ms 2516 KB Output is correct
13 Correct 35 ms 4904 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 191 ms 13664 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Incorrect 377 ms 27040 KB Tree @(192371, 7633) appears more than once: for edges on positions 2 and 3
21 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 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 1 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 167 ms 13700 KB Output is correct
10 Correct 9 ms 1876 KB Output is correct
11 Correct 57 ms 7612 KB Output is correct
12 Correct 13 ms 2516 KB Output is correct
13 Correct 35 ms 4904 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 191 ms 13664 KB Output is correct
17 Incorrect 366 ms 27056 KB Tree @(3, 3) appears more than once: for edges on positions 41980 and 161740
18 Halted 0 ms 0 KB -

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 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 1 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 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 167 ms 13700 KB Output is correct
10 Correct 9 ms 1876 KB Output is correct
11 Correct 57 ms 7612 KB Output is correct
12 Correct 13 ms 2516 KB Output is correct
13 Correct 35 ms 4904 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 191 ms 13664 KB Output is correct
17 Incorrect 1 ms 212 KB Tree @(3, 3) appears more than once: for edges on positions 2 and 3
18 Halted 0 ms 0 KB -