제출 #282348

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
282348		infinite_iq	Amusement Park (CEOI19_amusementpark)	C++14	0 / 100	1 ms	256 KiB

amusementpark

#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 ) ) ;
        }
        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 ;
}

컴파일 시 표준 에러 (stderr) 메시지

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: 0 / 7
• Subtask 2: 0 / 12
• Subtask 3: 0 / 23
• Subtask 4: 0 / 21
• Subtask 5: 0 / 37