Submission #1253097

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253097		kkzyr	Obstacles for a Llama (IOI25_obstacles)	C++20	23 / 100	70 ms	10568 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 < ((int)T.size() * (int)H.size());i++){
        parent[i] = -1;
    }
    for (int i = 0;i < T.size();i++){
        for (int j = 0;j < H.size();j++){
            if (T[i] > H[j]){
                if (i >= 1 and T[i - 1] > H[j]){
                    merge(i * (int)H.size() + j, (i - 1) * (int)H.size() + j);
                }
                if (i < (T.size() - 1) and T[i + 1] > H[j]){
                    merge(i * (int)H.size() + j, (i + 1) * (int)H.size() + j);
                }
                if (j >= 1 and T[i] > H[j - 1]){
                    merge(i * (int)H.size() + j, i * (int)H.size() + (j - 1));
                }
                if (j < (H.size() - 1) and T[i] > H[j + 1]){
                    merge(i * (int)H.size() + j, i * (int)H.size() + (j + 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: 13 / 13
• Subtask 4: 0 / 21
• Subtask 5: 0 / 25
• Subtask 6: 0 / 17