제출 #433813

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
433813		Mounir	다리 (APIO19_bridges)	C++14	0 / 100	399 ms	8704 KiB

bridges

#include <bits/stdc++.h>
#define chmax(x, v) x = max(x, v)
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define int long long
using namespace std;
     
const int N = 1e5;

struct Arete {
    int noeud, voisin, poids;
    bool isArete;

    bool operator < (const Arete &autre) const {
        if (poids != autre.poids)
            return poids < autre.poids;
        if (isArete != autre.isArete)
            return isArete;
        if (noeud != autre.noeud)
            return noeud < autre.noeud;
        return voisin < autre.voisin;
    }
};

int ens[N], taille[N];

int getEns(int noeud){
    if (ens[noeud] != noeud)
        ens[noeud] = getEns(ens[noeud]);
    return ens[noeud];
}

int ans[N];

     
signed main(){
    int nNoeuds, nAretes; cin >> nNoeuds >> nAretes;
    vector<Arete> aretes;
    for (int iArete = 0; iArete < nAretes; ++iArete){
    	int noeud, voisin, poids; cin >> noeud >> voisin >> poids;
    	--noeud, --voisin;
        aretes.pb({noeud, voisin, poids, true});
    }
    
    int nReqs; cin >> nReqs;
    for (int iReq = 0; iReq < nReqs; ++iReq){
        int type, noeud, poids; cin >> type >> noeud >> poids;
        aretes.pb({noeud - 1, iReq, poids, false});
    }

    for (int noeud = 0; noeud < nNoeuds; ++noeud)
        ens[noeud] = noeud, taille[noeud] = 1;

    sort(all(aretes));
    for (Arete& arete : aretes){
        if (arete.isArete){
            arete.noeud = getEns(arete.noeud);
            arete.voisin = getEns(arete.voisin);

            if (arete.noeud != arete.voisin){
                ens[arete.noeud] = arete.voisin;
                taille[arete.voisin] += taille[arete.noeud];
            }
        }
        else 
            ans[arete.voisin] = taille[getEns(arete.noeud)];
    }

    for (int iReq = 0; iReq < nReqs; ++iReq){
        cout << ans[iReq] << endl;
    }
	return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 16
• Subtask 3: 0 / 17
• Subtask 4: 0 / 14
• Subtask 5: 0 / 13
• Subtask 6: 0 / 27