oj.uz

Submission #945635

# Submission time Handle Problem Language Result Execution time Memory
945635 2024-03-14T05:46:51 Z vjudge1 Amusement Park (CEOI19_amusementpark) C++17
19 / 100
 3000 ms 49240 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
bool YES(bool f){ if(f) cout << "Yes\n" ; else cout << "No\n" ; return f ; }
void YES(){YES(1);}
void NO(){YES(0);}
void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
//#define ordered_set tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ios ios_base::sync_with_stdio(0) ; cin.tie(0) ; cout.tie(0);
#define int long long
#define ld long double
#define pii pair <int , int>
#define all(x) x.begin() , x.end()
#define ff first
#define ss second
#define endl '\n'
 
const int N = 1e6 + 5 ;
const int inf = 1e16 ;
const int mod = 1e9 + 8 ;
const double eps = 1e-8 ;
 
template <class T>
bool chmax( T& x , const T& y ){
  bool f = 0 ;
  if ( x < y ) x = y , f = 1 ;
  return f ;
}
template <class T>
bool chmin( T &x , const T &y ){
  bool f = 0 ;
  if ( x > y ) x = y , f = 1 ;
  return f ;
}
 
//code
 
int n , m ;
vector <int> g[N] , r[N] ;
vector <pii> vec ;
bool vis[N] , ch[N] ;

bool dfs ( int v ){
	vis[v] = 1 , ch[v] = 1 ;
	for ( auto to : g[v] ){
		if ( ch[to] ) return 1 ;
		if ( !vis[to] && dfs(to) ) return 1 ;
	} ch[v] = 0 ;
	return 0 ;
}

void solve(){
	
	cin >> n >> m ;
	for ( int i = 0 ; i < m ; i ++ ){
		int x , y ; cin >> x >> y ;
		vec.push_back({x,y}) ;
	} int ans = 0 ;
	for ( int i = 0 ; i < ( 1 << m ) ; i ++ ){
		for ( int j = 1 ; j <= n ; j ++ ) g[j].clear() , vis[j] = 0 , ch[j] = 0 ;
		for ( int j = 0 ; j < m ; j ++ ){
			if ( ( 1 << j ) & i ) g[vec[j].ss].push_back(vec[j].ff) ;
			else g[vec[j].ff].push_back(vec[j].ss) ;
		} bool f = 0 ;
		for ( int j = 1 ; j <= n ; j ++ ){
			if ( !vis[j] ) f |= dfs(j) ;
			if (f) break ;
		}
		if ( !f ){
			int res = 0 ;
			for ( int j = 0 ; j < m ; j ++ ) if ( (1<<j)&i ) res ++ ;
			ans = (ans+res)%mod ;
		}
	}
	cout << ans ;
}

signed main(){
    ios ;
	int t = 1 ;
	//cin >> t ;
	while ( t -- ) solve() ;
}

Compilation message

amusementpark.cpp: In function 'void fopn(std::string)':
amusementpark.cpp:10:31: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
amusementpark.cpp:10:72: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 | void fopn(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 48988 KB Output is correct
2 Correct 10 ms 48988 KB Output is correct
3 Correct 11 ms 48988 KB Output is correct
4 Correct 11 ms 48988 KB Output is correct
5 Correct 10 ms 48988 KB Output is correct
6 Correct 10 ms 49196 KB Output is correct
7 Correct 10 ms 48988 KB Output is correct
8 Correct 11 ms 49136 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 48988 KB Output is correct
2 Correct 10 ms 48988 KB Output is correct
3 Correct 11 ms 48988 KB Output is correct
4 Correct 11 ms 48988 KB Output is correct
5 Correct 10 ms 48988 KB Output is correct
6 Correct 10 ms 49196 KB Output is correct
7 Correct 10 ms 48988 KB Output is correct
8 Correct 11 ms 49136 KB Output is correct
9 Correct 11 ms 48988 KB Output is correct
10 Correct 11 ms 49164 KB Output is correct
11 Correct 14 ms 49196 KB Output is correct
12 Correct 11 ms 48988 KB Output is correct
13 Correct 11 ms 48988 KB Output is correct
14 Correct 12 ms 48988 KB Output is correct
15 Correct 11 ms 48984 KB Output is correct
16 Correct 10 ms 49080 KB Output is correct
17 Correct 11 ms 49200 KB Output is correct
18 Correct 12 ms 48988 KB Output is correct
19 Correct 12 ms 48988 KB Output is correct
20 Correct 10 ms 49104 KB Output is correct
21 Correct 11 ms 48984 KB Output is correct
22 Correct 11 ms 48984 KB Output is correct
23 Correct 11 ms 48988 KB Output is correct
24 Correct 14 ms 49152 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 48988 KB Output is correct
2 Correct 10 ms 48988 KB Output is correct
3 Correct 11 ms 48988 KB Output is correct
4 Correct 11 ms 48988 KB Output is correct
5 Correct 10 ms 48988 KB Output is correct
6 Correct 10 ms 49196 KB Output is correct
7 Correct 10 ms 48988 KB Output is correct
8 Correct 11 ms 49136 KB Output is correct
9 Correct 11 ms 48988 KB Output is correct
10 Correct 11 ms 49164 KB Output is correct
11 Correct 14 ms 49196 KB Output is correct
12 Correct 11 ms 48988 KB Output is correct
13 Correct 11 ms 48988 KB Output is correct
14 Correct 12 ms 48988 KB Output is correct
15 Correct 11 ms 48984 KB Output is correct
16 Correct 10 ms 49080 KB Output is correct
17 Correct 11 ms 49200 KB Output is correct
18 Correct 12 ms 48988 KB Output is correct
19 Correct 12 ms 48988 KB Output is correct
20 Correct 10 ms 49104 KB Output is correct
21 Correct 11 ms 48984 KB Output is correct
22 Correct 11 ms 48984 KB Output is correct
23 Correct 11 ms 48988 KB Output is correct
24 Correct 14 ms 49152 KB Output is correct
25 Correct 12 ms 49192 KB Output is correct
26 Correct 11 ms 49240 KB Output is correct
27 Correct 12 ms 48988 KB Output is correct
28 Correct 13 ms 48988 KB Output is correct
29 Correct 14 ms 48988 KB Output is correct
30 Correct 37 ms 48984 KB Output is correct
31 Correct 236 ms 49176 KB Output is correct
32 Correct 10 ms 48988 KB Output is correct
33 Correct 10 ms 48988 KB Output is correct
34 Correct 11 ms 48984 KB Output is correct
35 Correct 19 ms 48988 KB Output is correct
36 Correct 131 ms 49180 KB Output is correct
37 Correct 1954 ms 49180 KB Output is correct
38 Execution timed out 3009 ms 48984 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 48988 KB Output is correct
2 Correct 10 ms 48988 KB Output is correct
3 Correct 11 ms 48988 KB Output is correct
4 Correct 11 ms 48988 KB Output is correct
5 Correct 10 ms 48988 KB Output is correct
6 Correct 10 ms 49196 KB Output is correct
7 Correct 10 ms 48988 KB Output is correct
8 Correct 11 ms 49136 KB Output is correct
9 Correct 11 ms 48988 KB Output is correct
10 Correct 11 ms 49164 KB Output is correct
11 Correct 14 ms 49196 KB Output is correct
12 Correct 11 ms 48988 KB Output is correct
13 Correct 11 ms 48988 KB Output is correct
14 Correct 12 ms 48988 KB Output is correct
15 Correct 11 ms 48984 KB Output is correct
16 Correct 10 ms 49080 KB Output is correct
17 Correct 11 ms 49200 KB Output is correct
18 Correct 12 ms 48988 KB Output is correct
19 Correct 12 ms 48988 KB Output is correct
20 Correct 10 ms 49104 KB Output is correct
21 Correct 11 ms 48984 KB Output is correct
22 Correct 11 ms 48984 KB Output is correct
23 Correct 11 ms 48988 KB Output is correct
24 Correct 14 ms 49152 KB Output is correct
25 Correct 12 ms 49192 KB Output is correct
26 Correct 11 ms 49240 KB Output is correct
27 Correct 12 ms 48988 KB Output is correct
28 Correct 13 ms 48988 KB Output is correct
29 Correct 14 ms 48988 KB Output is correct
30 Correct 37 ms 48984 KB Output is correct
31 Correct 236 ms 49176 KB Output is correct
32 Correct 10 ms 48988 KB Output is correct
33 Correct 10 ms 48988 KB Output is correct
34 Correct 11 ms 48984 KB Output is correct
35 Correct 19 ms 48988 KB Output is correct
36 Correct 131 ms 49180 KB Output is correct
37 Correct 1954 ms 49180 KB Output is correct
38 Execution timed out 3009 ms 48984 KB Time limit exceeded
39 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 48988 KB Output is correct
2 Correct 10 ms 48988 KB Output is correct
3 Correct 11 ms 48988 KB Output is correct
4 Correct 11 ms 48988 KB Output is correct
5 Correct 10 ms 48988 KB Output is correct
6 Correct 10 ms 49196 KB Output is correct
7 Correct 10 ms 48988 KB Output is correct
8 Correct 11 ms 49136 KB Output is correct
9 Correct 11 ms 48988 KB Output is correct
10 Correct 11 ms 49164 KB Output is correct
11 Correct 14 ms 49196 KB Output is correct
12 Correct 11 ms 48988 KB Output is correct
13 Correct 11 ms 48988 KB Output is correct
14 Correct 12 ms 48988 KB Output is correct
15 Correct 11 ms 48984 KB Output is correct
16 Correct 10 ms 49080 KB Output is correct
17 Correct 11 ms 49200 KB Output is correct
18 Correct 12 ms 48988 KB Output is correct
19 Correct 12 ms 48988 KB Output is correct
20 Correct 10 ms 49104 KB Output is correct
21 Correct 11 ms 48984 KB Output is correct
22 Correct 11 ms 48984 KB Output is correct
23 Correct 11 ms 48988 KB Output is correct
24 Correct 14 ms 49152 KB Output is correct
25 Correct 12 ms 49192 KB Output is correct
26 Correct 11 ms 49240 KB Output is correct
27 Correct 12 ms 48988 KB Output is correct
28 Correct 13 ms 48988 KB Output is correct
29 Correct 14 ms 48988 KB Output is correct
30 Correct 37 ms 48984 KB Output is correct
31 Correct 236 ms 49176 KB Output is correct
32 Correct 10 ms 48988 KB Output is correct
33 Correct 10 ms 48988 KB Output is correct
34 Correct 11 ms 48984 KB Output is correct
35 Correct 19 ms 48988 KB Output is correct
36 Correct 131 ms 49180 KB Output is correct
37 Correct 1954 ms 49180 KB Output is correct
38 Execution timed out 3009 ms 48984 KB Time limit exceeded
39 Halted 0 ms 0 KB -