Pagini recente » Cod sursa (job #967391) | Cod sursa (job #972154) | Monitorul de evaluare | Cod sursa (job #1725377) | Cod sursa (job #1613462)
#include<fstream>
#include<vector>
#include<bitset>
#define DIM 8200
using namespace std;
int n, m, i, ok, x, y, nr;
vector<int> v[DIM];
int a[DIM], b[DIM], sa[DIM], sb[DIM];
bitset<DIM> viz;
ifstream fin("felinare.in");
ofstream fout("felinare.out");
int cupleaza(int nod){
if(viz[nod] == 1){
return 0;
}
viz[nod] = 1;
int vecin, i;
for(i = 0; i < v[nod].size(); i++){
vecin = v[nod][i];
if(b[vecin] == 0){
a[nod] = vecin;
b[vecin] = nod;
return 1;
}
}
for(i = 0; i < v[nod].size(); i++){
vecin = v[nod][i];
if( cupleaza(b[vecin]) ){
a[nod] = vecin;
b[vecin] = nod;
return 1;
}
}
return 0;
}
void suport(int nod){
for(int i = 0; i < v[nod].size(); i++){
int vecin = v[nod][i];
if(sb[vecin] == 0){
sb[vecin] = 1;
sa[ b[vecin] ] = 0;
suport(b[vecin]);
}
}
}
int main(){
fin>> n >> m;
for(i = 1; i <= m; i++){
fin>> x >> y;
v[x].push_back(y);
}
do{
ok = 0;
viz.reset();
for(i = 1; i <= n; i++){
if(a[i] == 0 && cupleaza(i)){
ok = 1;
}
}
}while(ok == 1);
for(i = 1; i <= n; i++){
if(a[i] != 0){
sa[i] = 1;
}
}
for(i = 1; i <= n; i++){
if(sa[i] == 0){
suport(i);
}
}
for(i = 1; i <= n; i++){
if(sa[i] == 0){
nr++;
}
if(sb[i] == 0){
nr++;
}
}
fout<< nr <<"\n";
for(i = 1; i <= n; i++){
if(sa[i] == 0 && sb[i] == 0){
fout<<"3\n";
}
else{
if(sa[i] == 1 && sb[i] == 1){
fout<<"0\n";
}
else{
if(sa[i] == 0){
fout<<"1\n";
}
else{
fout<<"2\n";
}
}
}
}
return 0;
}