# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
82988 |
2018-11-03T13:28:29 Z |
l_zg |
Geppetto (COCI15_geppetto) |
C++14 |
|
122 ms |
720 KB |
#include <iostream>
#include <cstdio>
using namespace std;
int a[405],b[405],x[20],sol;
int main(){
int n,m;
cin >> n >> m;
for( int i = 0; i < m; i ++ ){
int x,y;
cin >> x >> y;
a[i] = max(x,y);
b[i] = min(x,y);
}
for ( int i = 0; i < ( 1 << n ); i ++ ){
int t = 1;
for ( int j = 0; j < n; j ++ ){
if ( i & ( 1 << j ) ) x[j] = 1;
}
for ( int j = 0; j < m; j ++ ){
if ( x[a[j] - 1 ] && x[b[j] - 1] ){
t = 0;
break;
}
}
for ( int j = 0; j < n; j ++ ) {
// cout << x[j] << " ";
x[j] = 0;
}
//
// cout << t << endl;
sol += t;
}
cout << sol;
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
376 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
115 ms |
524 KB |
Output is correct |
4 |
Correct |
110 ms |
528 KB |
Output is correct |
5 |
Correct |
115 ms |
528 KB |
Output is correct |
6 |
Correct |
110 ms |
552 KB |
Output is correct |
7 |
Correct |
110 ms |
688 KB |
Output is correct |
8 |
Correct |
113 ms |
720 KB |
Output is correct |
9 |
Correct |
122 ms |
720 KB |
Output is correct |
10 |
Correct |
105 ms |
720 KB |
Output is correct |