Submission #82988

#TimeUsernameProblemLanguageResultExecution timeMemory
82988l_zgGeppetto (COCI15_geppetto)C++14
80 / 80
122 ms720 KiB
#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 timeMemoryGrader output
Fetching results...