oj.uz

답안 #588057

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
588057 2022-07-02T16:47:23 Z Clan328 분수 공원 (IOI21_parks) C++17
5 / 100
 59 ms 11300 KB 
#include "parks.h"
#include <bits/stdc++.h>

using namespace std;

#define pb push_back

struct Coord {
    int x, y, i;

    bool operator<(Coord other) const  {
        if (y == other.y) {
            return x < other.x;
        }
        return y < other.y;
    }
};

int n;
vector<Coord> coords;
std::vector<int> u, v, a, b;

void connect(int i, int j) {
    if (coords[i].x == coords[j].x) {
        u.pb(coords[i].i);
        v.pb(coords[j].i);
        a.pb(coords[i].x+1);
        b.pb(coords[i].y+1);
    } else if (coords[i].y == coords[j].y) {
        u.pb(coords[i].i);
        v.pb(coords[j].i);
        a.pb(coords[i].x+1);
        b.pb(coords[i].y-1);
    }
}

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

    n = x.size();

    vector<pair<int, int>> yi(n);
    coords = vector<Coord>(n);
    for (int i = 0; i < n; i++) {
        coords[i] = {x[i], y[i], i};
    }

    sort(coords.begin(), coords.end());
    bool res = true;
    vector<int> visited(n);
    visited[0] = true;
    for (int i = 0; i < n-1; i++) {
        res &= visited[i];
        if ((coords[i].y+2 == coords[i+1].y && coords[i].x == coords[i+1].x) || (coords[i].y == coords[i+1].y && coords[i].x+2 == coords[i+1].x)) {
            connect(i, i+1);
            visited[i+1] = true;
        }
        if (i+2 < n && ((coords[i].y+2 == coords[i+2].y && coords[i].x == coords[i+2].x) || (coords[i].y == coords[i+2].y && coords[i].x+2 == coords[i+2].x))) {
            connect(i, i+2);
            visited[i+2] = true;
        }
    }
    res &= visited[n-1];

    if (!res) return 0;

    
    // int maxY = 0;
    // for (int i = 0; i < y.size(); i++) maxY = max(maxY, y[i]);

    // vvi mat(maxY/2-1, vi(3)), matIdx(maxY/2-1, vi(3));
    // for (int i = 0; i < x.size(); i++) {
    //     mat[x[i]/2-1][y[i]/2-1] = 1;
    //     matIdx[x[i]/2-1][y[i]/2-1] = i;
    // }



    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 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 56 ms 9060 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 27 ms 5076 KB Output is correct
12 Correct 8 ms 1876 KB Output is correct
13 Correct 9 ms 2900 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 53 ms 8988 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 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 56 ms 9060 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 27 ms 5076 KB Output is correct
12 Correct 8 ms 1876 KB Output is correct
13 Correct 9 ms 2900 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 53 ms 8988 KB Output is correct
17 Incorrect 0 ms 212 KB Tree @(3, 3) appears more than once: for edges on positions 1 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 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 56 ms 9060 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 27 ms 5076 KB Output is correct
12 Correct 8 ms 1876 KB Output is correct
13 Correct 9 ms 2900 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 53 ms 8988 KB Output is correct
17 Incorrect 0 ms 212 KB Tree @(3, 3) appears more than once: for edges on positions 1 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 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 56 ms 9060 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 27 ms 5076 KB Output is correct
12 Correct 8 ms 1876 KB Output is correct
13 Correct 9 ms 2900 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 53 ms 8988 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Incorrect 0 ms 212 KB Solution announced impossible, but it is possible.
19 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 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 56 ms 9060 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 27 ms 5076 KB Output is correct
12 Correct 8 ms 1876 KB Output is correct
13 Correct 9 ms 2900 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 53 ms 8988 KB Output is correct
17 Incorrect 59 ms 11300 KB Solution announced impossible, but it is possible.
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 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 56 ms 9060 KB Output is correct
10 Correct 6 ms 1364 KB Output is correct
11 Correct 27 ms 5076 KB Output is correct
12 Correct 8 ms 1876 KB Output is correct
13 Correct 9 ms 2900 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 53 ms 8988 KB Output is correct
17 Incorrect 0 ms 212 KB Tree @(3, 3) appears more than once: for edges on positions 1 and 3
18 Halted 0 ms 0 KB -