oj.uz

답안 #282349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
282349 2020-08-24T10:32:55 Z infinite_iq Amusement Park (CEOI19_amusementpark) C++14
19 / 100
 3000 ms 136240 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) ;
int n , m , yes ;
ll crnt , ans ;
vpi v [11] ;
unordered_map < ll , bool > Mask ;
int go [11][11] , a [11] , id [11] , done [11] ;
void dfs ( int 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 ;
}
ll on ( ll mask ) {
        ll ans = 0 ;
        for ( ll i = 0 ; i < m ; i ++ ) {
                ans +=  ((( mask & (ll)( 1ll << i) ) ) > 0ll ) ;
        }
        return  ans ;
}
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 } ) ;
        }
        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 = 0 ; i < n ; i ++ ) {
                        if ( ! done [i] ) {
                                dfs ( i ) ;
                        }
                }
                ans += ( yes && Mask [crnt] == 0 ) * ( on ( crnt ) ) ;
                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:69:23: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |                 scanf ("%d%d",&a ,&b );
      |                 ~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 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 256 KB Output is correct
26 Correct 1 ms 256 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 2 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 6 ms 256 KB Output is correct
34 Correct 10 ms 384 KB Output is correct
35 Correct 14 ms 512 KB Output is correct
36 Correct 13 ms 768 KB Output is correct
37 Correct 18 ms 1280 KB Output is correct
38 Correct 22 ms 2060 KB Output is correct
39 Correct 44 ms 256 KB Output is correct
40 Correct 54 ms 376 KB Output is correct
41 Correct 66 ms 504 KB Output is correct
42 Correct 80 ms 536 KB Output is correct
43 Correct 103 ms 1400 KB Output is correct
44 Correct 124 ms 2564 KB Output is correct
45 Correct 161 ms 5020 KB Output is correct
46 Correct 210 ms 9404 KB Output is correct
47 Correct 297 ms 15696 KB Output is correct
48 Correct 53 ms 376 KB Output is correct
49 Correct 74 ms 504 KB Output is correct
50 Correct 77 ms 512 KB Output is correct
51 Correct 79 ms 504 KB Output is correct
52 Correct 473 ms 376 KB Output is correct
53 Correct 590 ms 504 KB Output is correct
54 Correct 764 ms 684 KB Output is correct
55 Correct 915 ms 2040 KB Output is correct
56 Correct 1173 ms 8124 KB Output is correct
57 Correct 1498 ms 19376 KB Output is correct
58 Correct 2003 ms 40832 KB Output is correct
59 Correct 2739 ms 80200 KB Output is correct
60 Execution timed out 3088 ms 136240 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 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 256 KB Output is correct
26 Correct 1 ms 256 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 2 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 6 ms 256 KB Output is correct
34 Correct 10 ms 384 KB Output is correct
35 Correct 14 ms 512 KB Output is correct
36 Correct 13 ms 768 KB Output is correct
37 Correct 18 ms 1280 KB Output is correct
38 Correct 22 ms 2060 KB Output is correct
39 Correct 44 ms 256 KB Output is correct
40 Correct 54 ms 376 KB Output is correct
41 Correct 66 ms 504 KB Output is correct
42 Correct 80 ms 536 KB Output is correct
43 Correct 103 ms 1400 KB Output is correct
44 Correct 124 ms 2564 KB Output is correct
45 Correct 161 ms 5020 KB Output is correct
46 Correct 210 ms 9404 KB Output is correct
47 Correct 297 ms 15696 KB Output is correct
48 Correct 53 ms 376 KB Output is correct
49 Correct 74 ms 504 KB Output is correct
50 Correct 77 ms 512 KB Output is correct
51 Correct 79 ms 504 KB Output is correct
52 Correct 473 ms 376 KB Output is correct
53 Correct 590 ms 504 KB Output is correct
54 Correct 764 ms 684 KB Output is correct
55 Correct 915 ms 2040 KB Output is correct
56 Correct 1173 ms 8124 KB Output is correct
57 Correct 1498 ms 19376 KB Output is correct
58 Correct 2003 ms 40832 KB Output is correct
59 Correct 2739 ms 80200 KB Output is correct
60 Execution timed out 3088 ms 136240 KB Time limit exceeded
61 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 256 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 256 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 1 ms 256 KB Output is correct
21 Correct 1 ms 256 KB Output is correct
22 Correct 1 ms 256 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 256 KB Output is correct
26 Correct 1 ms 256 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 2 ms 384 KB Output is correct
31 Correct 3 ms 512 KB Output is correct
32 Correct 5 ms 256 KB Output is correct
33 Correct 6 ms 256 KB Output is correct
34 Correct 10 ms 384 KB Output is correct
35 Correct 14 ms 512 KB Output is correct
36 Correct 13 ms 768 KB Output is correct
37 Correct 18 ms 1280 KB Output is correct
38 Correct 22 ms 2060 KB Output is correct
39 Correct 44 ms 256 KB Output is correct
40 Correct 54 ms 376 KB Output is correct
41 Correct 66 ms 504 KB Output is correct
42 Correct 80 ms 536 KB Output is correct
43 Correct 103 ms 1400 KB Output is correct
44 Correct 124 ms 2564 KB Output is correct
45 Correct 161 ms 5020 KB Output is correct
46 Correct 210 ms 9404 KB Output is correct
47 Correct 297 ms 15696 KB Output is correct
48 Correct 53 ms 376 KB Output is correct
49 Correct 74 ms 504 KB Output is correct
50 Correct 77 ms 512 KB Output is correct
51 Correct 79 ms 504 KB Output is correct
52 Correct 473 ms 376 KB Output is correct
53 Correct 590 ms 504 KB Output is correct
54 Correct 764 ms 684 KB Output is correct
55 Correct 915 ms 2040 KB Output is correct
56 Correct 1173 ms 8124 KB Output is correct
57 Correct 1498 ms 19376 KB Output is correct
58 Correct 2003 ms 40832 KB Output is correct
59 Correct 2739 ms 80200 KB Output is correct
60 Execution timed out 3088 ms 136240 KB Time limit exceeded
61 Halted 0 ms 0 KB -