Submission #1167909

#	Time	Username	Problem	Language	Result	Execution time	Memory
1167909		kungfulon	Drivers (BOI24_drivers)	C++20	0 / 100	599 ms	1114112 KiB

Main

#include <bits/stdc++.h>
using namespace std;

int n,m,u;

struct edge{
    int u, v, w;
    edge(int u, int v, int w): u(u), v(v), w(w) {}

    bool operator<(const edge& other) const {
        return w < other.w;
    }
};

int dsu[200001];

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

int main(){
    if(fopen("inp.txt", "r")){
        freopen("inp.txt", "r", stdin);
    }
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> m >> u;

    vector<edge> edges;
    for(int i = 0; i < m; i++){
        int u, v, w;
        cin >> u >> v >> w;
        edges.push_back(edge(u, v, w));
    }

    sort(edges.begin(), edges.end());

    vector<edge> query;

    for(int i = 0; i < u; i++){
        int u, v, w;
        cin >> u >> v >> w;
        query.push_back(edge(u, v, w));
    }   

    vector<int> idx(u);
    vector<bool> res (u, false);

    for(int i = 0; i < u; i++){
        idx[i] = i;
    }

    sort(idx.begin(), idx.end(), [&](int a, int b){
        return query[a] < query[b];
    });

    int id = 0;

    for(int i = 0; i < u; i++){
        while(id < m && edges[id].w < query[idx[i]].w){
            dsu[find(edges[id].u)] = find(edges[id].v);
            id++;
        }

        res[idx[i]] = find(query[idx[i]].u) == find(query[idx[i]].v);
    }

    for(int i = 0; i < u; i++){
        cout << (res[i] ? "TAIP\n" : "NE\n");
    }
}

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:23:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         freopen("inp.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 23
• Subtask 5: 0 / 45