Submission #282397

#	Time	Username	Problem	Language	Result	Execution time	Memory
282397		infinite_iq	Amusement Park (CEOI19_amusementpark)	C++14	42 / 100	3043 ms	148136 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 ;
unordered_map < ll , bool > Mask ;
int a [101] , b [101] , ord [11] ; 
int main () {
        cin >> n >> m ;
        for ( int i = 0 ; i < m ; i ++ ) {
                cin >> a [i] >> b [i] ;
                a [i] -- , b [i] -- ;
        }
        for ( int i = 0 ; i < n ; i ++ ) ord [i] = i ;
        do {
                crnt = 0 ;
                for ( ll i = 0 ; i < m ; i ++ ) {
                        if ( ord [a[i]] < ord [b[i]] ) {
                                crnt |= ( 1ll << i ) ;
                        }
                }       
                ans += ( Mask [crnt] == 0 ) * ( __builtin_popcountll (crnt) ) ;
                Mask [crnt] = 1 ;

        } while ( next_permutation ( ord , ord + n ) ) ;
        cout << ans % mod << endl ;
}

• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 23 / 23
• Subtask 4: 0 / 21
• Subtask 5: 0 / 37