oj.uz

답안 #967002

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967002 2024-04-20T21:42:09 Z shadow_sami Amusement Park (CEOI19_amusementpark) C++17
42 / 100
 3000 ms 174956 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcountll(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"

// ==========================(debug)============================================================================================== //

#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif

void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };

// ==========================(debug)============================================================================================== //

ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 998244353;

// ==========================(MOD)=============================================================================================== //

ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }

// ==========================(MOD)=============================================================================================== //

bool f = false;
ll l[mx];
ll r[mx];
ll id[mx];

int main(){
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    // #ifndef ONLINE_JUDGE
    //     freopen("input1.txt", "r", stdin);
    //     freopen("output1.txt", "w", stdout);
    //     freopen("error1.txt", "w", stderr);
    // #endif // ONLINE_JUDGE

        cin>>n>>m;
        vi v;
        fip(1,n+1)
        	v.push_back(i);
        fip(0,m)
        	cin>>l[i]>>r[i];
        set<ll> st;
        ans = 0;
        do{
        	fip(0,n)
        		id[v[i]] = i;
        	tp = 0;
        	fip(0,m)
        		if(id[l[i]] > id[r[i]])
        			tp |= (1ll<<i);
        	st.insert(tp);
        }while(next_permutation(begin(v),end(v)));        
        fx(st)
        	ans = mod_add(ans,totalOne(x));
        cout<<ans<<nli;
        
    cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
    return 0;
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 4 ms 4440 KB Output is correct
35 Correct 4 ms 4700 KB Output is correct
36 Correct 6 ms 4956 KB Output is correct
37 Correct 9 ms 5464 KB Output is correct
38 Correct 11 ms 6236 KB Output is correct
39 Correct 7 ms 4564 KB Output is correct
40 Correct 12 ms 4444 KB Output is correct
41 Correct 19 ms 4444 KB Output is correct
42 Correct 25 ms 4804 KB Output is correct
43 Correct 37 ms 5700 KB Output is correct
44 Correct 52 ms 6900 KB Output is correct
45 Correct 64 ms 10068 KB Output is correct
46 Correct 86 ms 14932 KB Output is correct
47 Correct 116 ms 21588 KB Output is correct
48 Correct 11 ms 4572 KB Output is correct
49 Correct 23 ms 4748 KB Output is correct
50 Correct 23 ms 4696 KB Output is correct
51 Correct 22 ms 4700 KB Output is correct
52 Correct 69 ms 4444 KB Output is correct
53 Correct 132 ms 4580 KB Output is correct
54 Correct 204 ms 4948 KB Output is correct
55 Correct 295 ms 5972 KB Output is correct
56 Correct 437 ms 13152 KB Output is correct
57 Correct 567 ms 26708 KB Output is correct
58 Correct 762 ms 52544 KB Output is correct
59 Correct 1056 ms 98992 KB Output is correct
60 Correct 1392 ms 174956 KB Output is correct
61 Correct 139 ms 4568 KB Output is correct
62 Correct 218 ms 4948 KB Output is correct
63 Correct 220 ms 4944 KB Output is correct
64 Correct 219 ms 5008 KB Output is correct

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 4 ms 4440 KB Output is correct
35 Correct 4 ms 4700 KB Output is correct
36 Correct 6 ms 4956 KB Output is correct
37 Correct 9 ms 5464 KB Output is correct
38 Correct 11 ms 6236 KB Output is correct
39 Correct 7 ms 4564 KB Output is correct
40 Correct 12 ms 4444 KB Output is correct
41 Correct 19 ms 4444 KB Output is correct
42 Correct 25 ms 4804 KB Output is correct
43 Correct 37 ms 5700 KB Output is correct
44 Correct 52 ms 6900 KB Output is correct
45 Correct 64 ms 10068 KB Output is correct
46 Correct 86 ms 14932 KB Output is correct
47 Correct 116 ms 21588 KB Output is correct
48 Correct 11 ms 4572 KB Output is correct
49 Correct 23 ms 4748 KB Output is correct
50 Correct 23 ms 4696 KB Output is correct
51 Correct 22 ms 4700 KB Output is correct
52 Correct 69 ms 4444 KB Output is correct
53 Correct 132 ms 4580 KB Output is correct
54 Correct 204 ms 4948 KB Output is correct
55 Correct 295 ms 5972 KB Output is correct
56 Correct 437 ms 13152 KB Output is correct
57 Correct 567 ms 26708 KB Output is correct
58 Correct 762 ms 52544 KB Output is correct
59 Correct 1056 ms 98992 KB Output is correct
60 Correct 1392 ms 174956 KB Output is correct
61 Correct 139 ms 4568 KB Output is correct
62 Correct 218 ms 4948 KB Output is correct
63 Correct 220 ms 4944 KB Output is correct
64 Correct 219 ms 5008 KB Output is correct
65 Execution timed out 3029 ms 12452 KB Time limit exceeded
66 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 2 ms 4440 KB Output is correct
5 Correct 1 ms 4440 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 2 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4696 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 1 ms 4444 KB Output is correct
16 Correct 2 ms 4444 KB Output is correct
17 Correct 1 ms 4444 KB Output is correct
18 Correct 1 ms 4440 KB Output is correct
19 Correct 1 ms 4440 KB Output is correct
20 Correct 1 ms 4444 KB Output is correct
21 Correct 1 ms 4444 KB Output is correct
22 Correct 1 ms 4444 KB Output is correct
23 Correct 1 ms 4444 KB Output is correct
24 Correct 1 ms 4696 KB Output is correct
25 Correct 1 ms 4444 KB Output is correct
26 Correct 1 ms 4444 KB Output is correct
27 Correct 1 ms 4444 KB Output is correct
28 Correct 1 ms 4444 KB Output is correct
29 Correct 2 ms 4444 KB Output is correct
30 Correct 2 ms 4700 KB Output is correct
31 Correct 2 ms 4700 KB Output is correct
32 Correct 1 ms 4444 KB Output is correct
33 Correct 2 ms 4444 KB Output is correct
34 Correct 4 ms 4440 KB Output is correct
35 Correct 4 ms 4700 KB Output is correct
36 Correct 6 ms 4956 KB Output is correct
37 Correct 9 ms 5464 KB Output is correct
38 Correct 11 ms 6236 KB Output is correct
39 Correct 7 ms 4564 KB Output is correct
40 Correct 12 ms 4444 KB Output is correct
41 Correct 19 ms 4444 KB Output is correct
42 Correct 25 ms 4804 KB Output is correct
43 Correct 37 ms 5700 KB Output is correct
44 Correct 52 ms 6900 KB Output is correct
45 Correct 64 ms 10068 KB Output is correct
46 Correct 86 ms 14932 KB Output is correct
47 Correct 116 ms 21588 KB Output is correct
48 Correct 11 ms 4572 KB Output is correct
49 Correct 23 ms 4748 KB Output is correct
50 Correct 23 ms 4696 KB Output is correct
51 Correct 22 ms 4700 KB Output is correct
52 Correct 69 ms 4444 KB Output is correct
53 Correct 132 ms 4580 KB Output is correct
54 Correct 204 ms 4948 KB Output is correct
55 Correct 295 ms 5972 KB Output is correct
56 Correct 437 ms 13152 KB Output is correct
57 Correct 567 ms 26708 KB Output is correct
58 Correct 762 ms 52544 KB Output is correct
59 Correct 1056 ms 98992 KB Output is correct
60 Correct 1392 ms 174956 KB Output is correct
61 Correct 139 ms 4568 KB Output is correct
62 Correct 218 ms 4948 KB Output is correct
63 Correct 220 ms 4944 KB Output is correct
64 Correct 219 ms 5008 KB Output is correct
65 Execution timed out 3029 ms 12452 KB Time limit exceeded
66 Halted 0 ms 0 KB -