제출 #1253103

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253103		kkzyr	장애물 (IOI25_obstacles)	C++20	10 / 100	74 ms	7496 KiB

obstacles

#include <iostream>
#include <vector>
using namespace std;

int parent[1000000];

int find(int x){
    if (parent[x] == -1){
        return x;
    }
    int ans = find(parent[x]);
    parent[x] = ans;
    return ans;
}

void merge(int x, int y){
    int component1 = find(x), component2 = find(y);
    if (component1 != component2){
        parent[component1] = component2;
    }
}

void initialize(std::vector<int> T, std::vector<int> H){
    for (int i = 0;i < H.size();i++){
        parent[i] = -1;
    }
    for (int i = 0;i < H.size();i++){
        if (T[0] > H[i]){
            if (i >= 1 and T[0] > H[i - 1]){
                merge(i, i - 1);
            }
            if (i < (H.size() - 1) and T[0] > H[i + 1]){
                merge(i, i + 1);
            }
        }
    }
}

bool can_reach(int L, int R, int S, int D){
    if (find(S) == find(D)){
        return true;
    }
    return false;
}

• Subtask 0: 0 / 0
• Subtask 1: 10 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 13
• Subtask 4: 0 / 21
• Subtask 5: 0 / 25
• Subtask 6: 0 / 17