Submission #697101

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
697101	2023-02-08T10:05:47 Z	Alihan_8	Amusement Park (CEOI19_amusementpark)	C++17	19 / 100	526 ms	17336 KB

amusementpark

#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;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, m; cin >> n >> m;
	vector <int> a(m), b(m);
	for ( int i = 0; i < m; i++ ){
        cin >> a[i] >> b[i];
        a[i]--, b[i]--;
	}
	const int Mod = 998244353;
	vector <int> p(n);
	iota(all(p), 0);
	set <int> st;
	do{
        vector <int> g[n], pos(n);
        for ( int i = 0; i < n; i++ ) pos[p[i]] = i;
        int rev = 0, mask = 0;
        for ( int i = 0; i < m; i++ ){
            if ( pos[a[i]] > pos[b[i]] ){
                g[b[i]].pb(a[i]);
                mask |= 1ll << i;
            }
            else g[a[i]].pb(b[i]);
        }
        vector <int> used(n);
        function <bool(int)> dfs = [&](int x){
            used[x] = true;
            for ( auto to: g[x] ){
                if ( !used[to] ){
                    if ( dfs(to) ) return true;
                }
                else if ( used[to] == 1 ) return true;
            }
            used[x] = 2;
            return false;
        };
        bool flag = true;
        for ( int i = 0; i < n; i++ ){
            if ( !used[i] and dfs(i) ){
                flag = false;
                break;
            }
        }
        if ( flag ) st.insert(mask);
	} while ( next_permutation(all(p)) );
    int cnt = 0;
    auto f = [&](int x){
        return __builtin_popcount(x);
    };
    for ( auto i: st ) cnt = (cnt+f(i))%Mod;
    cout << cnt;

	cout << '\n';
}

Compilation message

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:30:13: warning: unused variable 'rev' [-Wunused-variable]
   30 |         int rev = 0, mask = 0;
      |             ^~~
amusementpark.cpp: In function 'void IO(std::string)':
amusementpark.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
amusementpark.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	2 ms	212 KB	Output is correct
26	Correct	2 ms	212 KB	Output is correct
27	Correct	3 ms	212 KB	Output is correct
28	Correct	3 ms	340 KB	Output is correct
29	Correct	5 ms	340 KB	Output is correct
30	Correct	6 ms	340 KB	Output is correct
31	Correct	6 ms	468 KB	Output is correct
32	Correct	13 ms	212 KB	Output is correct
33	Correct	25 ms	328 KB	Output is correct
34	Correct	26 ms	380 KB	Output is correct
35	Correct	33 ms	492 KB	Output is correct
36	Correct	37 ms	740 KB	Output is correct
37	Correct	44 ms	1392 KB	Output is correct
38	Correct	49 ms	2156 KB	Output is correct
39	Correct	109 ms	292 KB	Output is correct
40	Correct	164 ms	308 KB	Output is correct
41	Correct	216 ms	348 KB	Output is correct
42	Correct	263 ms	532 KB	Output is correct
43	Correct	322 ms	1644 KB	Output is correct
44	Correct	368 ms	2752 KB	Output is correct
45	Correct	419 ms	5860 KB	Output is correct
46	Correct	473 ms	10808 KB	Output is correct
47	Incorrect	526 ms	17336 KB	Output isn't correct
48	Halted	0 ms	0 KB	-

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	2 ms	212 KB	Output is correct
26	Correct	2 ms	212 KB	Output is correct
27	Correct	3 ms	212 KB	Output is correct
28	Correct	3 ms	340 KB	Output is correct
29	Correct	5 ms	340 KB	Output is correct
30	Correct	6 ms	340 KB	Output is correct
31	Correct	6 ms	468 KB	Output is correct
32	Correct	13 ms	212 KB	Output is correct
33	Correct	25 ms	328 KB	Output is correct
34	Correct	26 ms	380 KB	Output is correct
35	Correct	33 ms	492 KB	Output is correct
36	Correct	37 ms	740 KB	Output is correct
37	Correct	44 ms	1392 KB	Output is correct
38	Correct	49 ms	2156 KB	Output is correct
39	Correct	109 ms	292 KB	Output is correct
40	Correct	164 ms	308 KB	Output is correct
41	Correct	216 ms	348 KB	Output is correct
42	Correct	263 ms	532 KB	Output is correct
43	Correct	322 ms	1644 KB	Output is correct
44	Correct	368 ms	2752 KB	Output is correct
45	Correct	419 ms	5860 KB	Output is correct
46	Correct	473 ms	10808 KB	Output is correct
47	Incorrect	526 ms	17336 KB	Output isn't correct
48	Halted	0 ms	0 KB	-

Subtask #5
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	0 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	212 KB	Output is correct
7	Correct	0 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	0 ms	212 KB	Output is correct
11	Correct	0 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	340 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	2 ms	212 KB	Output is correct
26	Correct	2 ms	212 KB	Output is correct
27	Correct	3 ms	212 KB	Output is correct
28	Correct	3 ms	340 KB	Output is correct
29	Correct	5 ms	340 KB	Output is correct
30	Correct	6 ms	340 KB	Output is correct
31	Correct	6 ms	468 KB	Output is correct
32	Correct	13 ms	212 KB	Output is correct
33	Correct	25 ms	328 KB	Output is correct
34	Correct	26 ms	380 KB	Output is correct
35	Correct	33 ms	492 KB	Output is correct
36	Correct	37 ms	740 KB	Output is correct
37	Correct	44 ms	1392 KB	Output is correct
38	Correct	49 ms	2156 KB	Output is correct
39	Correct	109 ms	292 KB	Output is correct
40	Correct	164 ms	308 KB	Output is correct
41	Correct	216 ms	348 KB	Output is correct
42	Correct	263 ms	532 KB	Output is correct
43	Correct	322 ms	1644 KB	Output is correct
44	Correct	368 ms	2752 KB	Output is correct
45	Correct	419 ms	5860 KB	Output is correct
46	Correct	473 ms	10808 KB	Output is correct
47	Incorrect	526 ms	17336 KB	Output isn't correct
48	Halted	0 ms	0 KB	-

Submission #697101

Compilation message

Subtask #1 7.0 / 7.0

Subtask #2 12.0 / 12.0

Subtask #3 0 / 23.0

Subtask #4 0 / 21.0

Subtask #5 0 / 37.0

Subtask #1
7.0 / 7.0

Subtask #2
12.0 / 12.0

Subtask #3
0 / 23.0

Subtask #4
0 / 21.0

Subtask #5
0 / 37.0