-
Notifications
You must be signed in to change notification settings - Fork 59
/
Copy pathmvc.cpp
61 lines (52 loc) · 1.14 KB
/
mvc.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
# include <fstream>
# include <algorithm>
# include <vector>
# define NR 400
# define INF 999999999
using namespace std;
ifstream f("rmvc.in");
ofstream g("rmvc.out");
struct elem {
int ci, cs;
}a[NR];
int i,j,n,m,x,y,maxx,minn;
int st[NR], ap[NR], sol[NR];
void back (int k, int muchie) {
if (k-1>=minn) return;
int ok=1;
for (int i=muchie; i<=m && ok; ++i)
if (! ap[a[i].ci] && ! ap[a[i].cs]) ok=0;
if (ok) {
minn=k-1;
for (int i=1; i<=k-1; ++i)
sol[i]=st[i];
return;
}
for (int i=muchie; i<=m; ++i) {
if (! ap[a[i].ci] && ! ap[a[i].cs]) {
//stanga
st[k]=a[i].ci; ap[a[i].ci]=1;
back(k+1, i+1);
st[k]=0; ap[a[i].ci]=0;
//dreapta
st[k]=a[i].cs; ap[a[i].cs]=1;
back(k+1, i+1);
st[k]=0; ap[a[i].cs]=0;
break;
}
}
}
int main ()
{
f>>n>>m;
for (i=1; i<=m; ++i)
f>>a[i].ci>>a[i].cs;
random_shuffle(a+1, a+m+1);
minn=20;
back (1, 1);
g<<minn<<"\n";
for (int i=1; i<=minn; ++i)
g<<sol[i]<<" ";
g<<"\n";
return 0;
}