oj.uz

Submission #282291

# Submission time Handle Problem Language Result Execution time Memory
282291 2020-08-24T08:54:27 Z infinite_iq Amusement Park (CEOI19_amusementpark) C++14
19 / 100
 305 ms 15840 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
    #include <bits/stdc++.h>
    using namespace std;
    #define sqr 340
    #define mp make_pair
    #define mid (l+r)/2
    #define le node * 2 
    #define ri node * 2 + 1 
    #define pb push_back
    #define ppb pop_back
    #define fi first
    #define se second
    #define lb lower_bound
    #define ub upper_bound
    #define ins insert
    #define era erase
    #define C continue
    #define mem(dp,i) memset(dp,i,sizeof(dp))
    #define mset multiset
    #define all(x) x.begin(), x.end()
    #define gc getchar_unlocked
    typedef long long ll;
    typedef short int si;
    typedef long double ld;
    typedef pair<int,int> pi;
    typedef pair<ll,ll> pll;
    typedef vector<int> vi;
    typedef vector<ll> vll;
    typedef vector<pi> vpi;
    typedef vector<pll> vpll;
    typedef pair<double,ll>pdi;
    const ll inf=1e18;
    const ll mod=998244353;
    const ld Pi=acos(-1) ;
    ll n , m , yes ;
    ll crnt , ans ;
    vpll v [101] ;
    unordered_map < ll , bool > Mask ;
    ll go [101][101] , a [101] , id [101] , done [101] ;
    void dfs ( ll node ) {
            if ( yes == 0 ) return ;
            done [node] = 1 ;
            for ( auto u : v [node] ) {
                    if ( id [node] > id [u.fi] ) C ;
                    if ( done [u.fi] == 1 ) {
                            yes = 0 ;
                            return ;
                    }
                    if ( ( 1 - go [node][u.fi] ) ) {
                            crnt |= (ll)( 1ll << u.se ) ;
                    }
                    if ( done [u.fi] == 2 ) C ;
                    dfs ( u .fi ) ;
                    if ( yes == 0 ) return ;
            }
            done [node] = 2 ;
    }
    int main () {
            cin >> n >> m ;
            for ( int i = 0 ; i < m ; i ++ ) {
                    int a , b ;
                    scanf ("%d%d",&a ,&b );
                    a -- , b -- ;
                    go [a][b] = 1 ;
                    v  [a] .pb ( { b , i } ) ;
                    v  [b] .pb ( { a , i } ) ;
            }
      if ( m > 60 ) while ( 1 ) {}
            for ( int i = 0 ; i < n ; i ++ ) a [i] = i ;
            do {
                    yes = 1 , crnt = 0 ;
                    for ( int i = 0 ; i < n ; i ++ ) {
                            done [i] = 0 ;
                            id [ a [i] ] = i ;
                    }
                    for ( int i = n-1 ; i >=0 ; i -- ) {
                            if ( ! done [i] ) {
                                    dfs ( i ) ;
                            }
                    }
                    ans += (ll)( yes && Mask [crnt] == 0 ) * (ll)( __builtin_popcount ( crnt ) ) ;
             ans %= mod ;
                    if ( yes ) Mask [crnt] = 1 ;
     
            } while ( next_permutation ( a , a + n ) ) ;
            cout << ans % mod << endl ;
    }

Compilation message

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:62:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   62 |                     scanf ("%d%d",&a ,&b );
      |                     ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 416 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 416 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 7 ms 384 KB Output is correct
35 Correct 10 ms 512 KB Output is correct
36 Correct 17 ms 768 KB Output is correct
37 Correct 16 ms 1280 KB Output is correct
38 Correct 25 ms 2060 KB Output is correct
39 Correct 41 ms 376 KB Output is correct
40 Correct 49 ms 384 KB Output is correct
41 Correct 66 ms 420 KB Output is correct
42 Correct 72 ms 504 KB Output is correct
43 Correct 95 ms 1400 KB Output is correct
44 Correct 111 ms 2436 KB Output is correct
45 Correct 146 ms 4980 KB Output is correct
46 Correct 198 ms 9404 KB Output is correct
47 Incorrect 305 ms 15840 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 416 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 7 ms 384 KB Output is correct
35 Correct 10 ms 512 KB Output is correct
36 Correct 17 ms 768 KB Output is correct
37 Correct 16 ms 1280 KB Output is correct
38 Correct 25 ms 2060 KB Output is correct
39 Correct 41 ms 376 KB Output is correct
40 Correct 49 ms 384 KB Output is correct
41 Correct 66 ms 420 KB Output is correct
42 Correct 72 ms 504 KB Output is correct
43 Correct 95 ms 1400 KB Output is correct
44 Correct 111 ms 2436 KB Output is correct
45 Correct 146 ms 4980 KB Output is correct
46 Correct 198 ms 9404 KB Output is correct
47 Incorrect 305 ms 15840 KB Output isn't correct
48 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 416 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 384 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 2 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 7 ms 384 KB Output is correct
34 Correct 7 ms 384 KB Output is correct
35 Correct 10 ms 512 KB Output is correct
36 Correct 17 ms 768 KB Output is correct
37 Correct 16 ms 1280 KB Output is correct
38 Correct 25 ms 2060 KB Output is correct
39 Correct 41 ms 376 KB Output is correct
40 Correct 49 ms 384 KB Output is correct
41 Correct 66 ms 420 KB Output is correct
42 Correct 72 ms 504 KB Output is correct
43 Correct 95 ms 1400 KB Output is correct
44 Correct 111 ms 2436 KB Output is correct
45 Correct 146 ms 4980 KB Output is correct
46 Correct 198 ms 9404 KB Output is correct
47 Incorrect 305 ms 15840 KB Output isn't correct
48 Halted 0 ms 0 KB -