Cod sursa(job #2479672)
Utilizator | Arsenoiu Iulian iulianarsenoiu | Data | 24 octombrie 2019 10:40:01 |
---|---|---|---|
Problema | PScNv | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.83 kb |
#include <fstream>
using namespace std;
ifstream f("pscnv.in");
ofstream g("pscnv.out");
vector <int> v;
int main()
{
f>>n>>m>>xf>>yf;
for(int i=1; i<=m; i++)
{
f>>x>>y>>c;
G[x].push_back({c,y});
}
topsort();
for(int i=1; i<=n; i++)
{
if(!sel[v[i]]){
nrc++;
dfs(v[i]);
}
}
int componenta=0;
int cnt=0;
for(int i=1;i<=nrc;i++)
{
for(auto it : cc[i])
{
++cnt;
if(it==xf)
{
componenta=i;
p1=cnt;
}
if(it==yf)
{
p2=cnt;
break;
}
}
if(componenta)
break;
}
for(i=p1;i<=p2;i++)
{
}
return 0;
}