Razvan's wiki

*2005-2009 Liceul International de informatica Bucuresti *2009-prezent Universitatea Politehnica Bucuresti

*sunt smecher ce sa mai….

Mircea Ghideu

Mitra M. George-Daniel

#include<stdio.h>
#include<assert.h>
#include<vector>
#include<algorithm>
#define pb push_back
#define mkp make_pair

using namespace std;
const int maxn = 340;

vector<short> VECT[maxn];
vector<pair<short,short> > ANS,AUX,VEC;
short N,MOVE,COST;
short VER[maxn];
short NRT,TATA[maxn];
short D[maxn][maxn],M[maxn][maxn];

bool cmpf(pair<short,short> p1,pair<short,short> p2)
{
	short n1 = p1.first;
	short n2 = p2.first;
	short i1 = p1.second;
	short i2 = p2.second;
	for(;i1 <= N && i2 <= N;++i1,++i2)
	{
		if (D[n1][i1] != D[n2][i2]) return D[n1][i1] < D[n2][i2];
                if (D[n1][i1] == 0) return false;
        }
	return false;
}