Pagini recente » Cod sursa (job #1723364) | Cod sursa (job #273820) | Istoria paginii runda/tryhardereala_v2 | Cod sursa (job #2079271) | Cod sursa (job #1729307)
#include <iostream>
#include <queue>
#include <cstdio>
#include <bitset>
#define NMax 50005
using namespace std;
priority_queue < pair < int, int > Q;
vector < pair <int, int > G[NMax];
int N,M;
void citire()
{
printf("%d%d", &N, &M);
int x,y,c;
for(i=1; i<=M; i++)
{
printf("%d%d", &x, &y, &c+);
G[x].push_back(make_pair(c,y));
}
}
int main()
{
citire();
return 0;
}
/*
roy floyd
rfinv
rf*/