Cod sursa(job #2075065)
| Utilizator | Data | 25 noiembrie 2017 11:13:31 | |
|---|---|---|---|
| Problema | Paduri de multimi disjuncte | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream fin("disjoint.in");
ofstream fout("disjoint.out");
int n,m,cod,x,y,a[10000][10000];
int main() {
fin >> n >> m;
for(int i=1;i<=n;i++) {
a[i][i]=1;
}
for(int i=1;i<=m;i++) {
fin >> cod >> x >> y;
if(cod==1) {
for(int j=1;j<=n;j++)
if(a[y][j]==1) a[x][j]=1;
} else {
if(a[x][y]==1) fout << "DA\n";
else fout << "NU\n";
}
}
return 0;
}
