Submission #579429

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
579429	2022-06-19T06:58:05 Z	temporary_juggernaut	Amusement Park (CEOI19_amusementpark)	C++14	19 / 100	84 ms	10004 KB

amusementpark

#include<bits/stdc++.h>
#define fr first
#define sc second
using namespace std;
typedef long long ll;
typedef long double ld;
#define USING_ORDERED_SET 0
#if USING_ORDERED_SET
#include<bits/extc++.h>
using namespace __gnu_pbds;
template<class T>using ordered_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#endif
template<class T>void umax(T &a,T b){if(a<b)a=b;}
template<class T>void umin(T &a,T b){if(b<a)a=b;}
#ifdef juggernaut
    #define printl(args...) printf(args)
#else
    #define printl(args...) 0
#endif
int x[999],y[999];
ll mod=998244353;
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=0;i^m;i++)scanf("%d%d",&x[i],&y[i]);
	unordered_set<int>st;
	vector<int>vec(n);
	iota(vec.begin(),vec.end(),1);
	ll ans=0;
	do{
		ll tmp=0;
		for(int i=0;i^m;i++)tmp|=(vec[x[i]-1]<vec[y[i]-1])<<i;
		if(!st.count(tmp)){
			st.insert(tmp);
			ans+=__builtin_popcount(tmp);
		}
	}while(next_permutation(vec.begin(),vec.end()));
	ans%=mod;
	cout<<ans;
}

Compilation message

amusementpark.cpp: In function 'int main()':
amusementpark.cpp:24:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
amusementpark.cpp:25:27: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   25 |  for(int i=0;i^m;i++)scanf("%d%d",&x[i],&y[i]);
      |                      ~~~~~^~~~~~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	1 ms	212 KB	Output is correct
6	Correct	1 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	0 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	1 ms	212 KB	Output is correct
6	Correct	1 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	0 ms	212 KB	Output is correct
13	Correct	1 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	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 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	0 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	1 ms	212 KB	Output is correct
6	Correct	1 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	0 ms	212 KB	Output is correct
13	Correct	1 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	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	2 ms	212 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	3 ms	468 KB	Output is correct
36	Correct	4 ms	852 KB	Output is correct
37	Correct	6 ms	1364 KB	Output is correct
38	Correct	7 ms	1840 KB	Output is correct
39	Correct	6 ms	304 KB	Output is correct
40	Correct	10 ms	212 KB	Output is correct
41	Correct	15 ms	344 KB	Output is correct
42	Correct	23 ms	564 KB	Output is correct
43	Correct	29 ms	1408 KB	Output is correct
44	Correct	33 ms	2676 KB	Output is correct
45	Correct	44 ms	5316 KB	Output is correct
46	Correct	77 ms	10004 KB	Output is correct
47	Incorrect	84 ms	9896 KB	Output isn't correct
48	Halted	0 ms	0 KB	-

Subtask #4
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	1 ms	212 KB	Output is correct
6	Correct	1 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	0 ms	212 KB	Output is correct
13	Correct	1 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	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	2 ms	212 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	3 ms	468 KB	Output is correct
36	Correct	4 ms	852 KB	Output is correct
37	Correct	6 ms	1364 KB	Output is correct
38	Correct	7 ms	1840 KB	Output is correct
39	Correct	6 ms	304 KB	Output is correct
40	Correct	10 ms	212 KB	Output is correct
41	Correct	15 ms	344 KB	Output is correct
42	Correct	23 ms	564 KB	Output is correct
43	Correct	29 ms	1408 KB	Output is correct
44	Correct	33 ms	2676 KB	Output is correct
45	Correct	44 ms	5316 KB	Output is correct
46	Correct	77 ms	10004 KB	Output is correct
47	Incorrect	84 ms	9896 KB	Output isn't correct
48	Halted	0 ms	0 KB	-

Subtask #5
0 / 37.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	1 ms	212 KB	Output is correct
6	Correct	1 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	0 ms	212 KB	Output is correct
13	Correct	1 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	1 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	340 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	1 ms	212 KB	Output is correct
28	Correct	1 ms	340 KB	Output is correct
29	Correct	1 ms	340 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	1 ms	468 KB	Output is correct
32	Correct	1 ms	212 KB	Output is correct
33	Correct	2 ms	212 KB	Output is correct
34	Correct	3 ms	340 KB	Output is correct
35	Correct	3 ms	468 KB	Output is correct
36	Correct	4 ms	852 KB	Output is correct
37	Correct	6 ms	1364 KB	Output is correct
38	Correct	7 ms	1840 KB	Output is correct
39	Correct	6 ms	304 KB	Output is correct
40	Correct	10 ms	212 KB	Output is correct
41	Correct	15 ms	344 KB	Output is correct
42	Correct	23 ms	564 KB	Output is correct
43	Correct	29 ms	1408 KB	Output is correct
44	Correct	33 ms	2676 KB	Output is correct
45	Correct	44 ms	5316 KB	Output is correct
46	Correct	77 ms	10004 KB	Output is correct
47	Incorrect	84 ms	9896 KB	Output isn't correct
48	Halted	0 ms	0 KB	-

Submission #579429

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