Cod sursa(job #1051740)
| Utilizator | Data | 10 decembrie 2013 15:40:54 | |
|---|---|---|---|
| Problema | Arbore partial de cost minim | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <cstdio>
#include <bitset>
using namespace std;
const int inf=2<<30;
int n,m,h[400000],d[200000];
bitset<200000> nina;
struct NA
{
int x,c;
NA* u;
}*nod[200000];
void read()
{
freopen("apm.in","r",stdin);
int i,x,c;
NA *p;
scanf("%d%d",&n,&m);
for(i=0;i<m;++i)
{
scanf("%d",&x);
p=new NA;
p->u=nod[x];
nod[x]=p;
scanf("%d",&x);
p->x=x;
scanf("%d",&x);
p->c=x;
}
}
int main()
{
return 0;
}
