Cod sursa(job #586250)
| Utilizator | Data | 30 aprilie 2011 14:15:40 | |
|---|---|---|---|
| Problema | Guvern | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Algoritmiada 2011, Runda Finală, Clasele 10-12 | Marime | 0.54 kb |
#include <algorithm>
#include <fstream>
#include <vector>
using namespace std;
const int Dim = 200001;
int N;
int gc[Dim];
vector <int> v[Dim];
int main() {
ifstream fin( "guvern.in" );
ofstream fout( "guvern.out" );
int i, x, y;
fin >> N;
for( i = 1; i <= N - 1; ++i ) {
fin >> x, fin >> y;
v[x].push_back( y );
v[y].push_back( x );
}
for( i = 1; i <= N; ++i )
fin >> gc[i];
fout << N;
fin.close();
fout.close();
return 0;
}
