-
Notifications
You must be signed in to change notification settings - Fork 0
/
uva11742.cpp
54 lines (41 loc) · 1.1 KB
/
uva11742.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
#include <iostream>
#include <algorithm>
using namespace std;
struct Contstraint{
int p1, p2, c;
Contstraint(){
}
Contstraint(int p1, int p2, int c){
this->p1 = p1;
this->p2 = p2;
this->c = c;
}
};
int main(){
int n, m;
while(cin>>n>>m && !(n == 0 && m == 0)){
Contstraint cons[m];
int arrang[n];
int counter(0);
for(int i = 0; i < n; i++){
arrang[i] = i;
}
for(int j = 0; j < m; j++){
cin>>cons[j].p1; cin>>cons[j].p2; cin>>cons[j].c;
}
do{
bool valid = true;
for(int i = 0; i < m; i++){
if((cons[i].c < 0 && abs(arrang[cons[i].p1] - arrang[cons[i].p2]) >= -cons[i].c) || (cons[i].c > 0 && abs(arrang[cons[i].p1] - arrang[cons[i].p2]) <= cons[i].c)){
}else{
valid = false;
}
}
if(valid){
counter++;
}
}while(next_permutation(arrang, arrang + n));
cout<<counter<<endl;
}
return 0;
}