답안 #576812

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
576812	2022-06-13T14:48:22 Z	temporary_juggernaut	Newspapers (CEOI21_newspapers)	C++14	9 / 100	2 ms	1236 KB

newspapers

#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 a[20];
int n,m;
bool dp[1<<20];
pair<int,int>path[1<<20];
void go(int mask){
	dp[mask]=true;
	for(int i=0;i<n;i++)if(mask>>i&1){
		int new_mask=0;
		for(int j=0;j<n;j++)if((mask>>j&1)&&(i^j))new_mask|=a[j];
		if(dp[new_mask])continue;
		path[new_mask]=make_pair(mask,i);
		go(new_mask);
	}
}
int main(){
	scanf("%d%d",&n,&m);
	while(m--){
		int x,y;
		scanf("%d%d",&x,&y);
		x--;y--;
		a[x]|=(1<<y);
		a[y]|=(1<<x);
	}
	int mx=(1<<n)-1;
	go(mx);
	if(dp[0]){
		int cur_mask=0;
		vector<int>vec;
		while(cur_mask!=mx){
			vec.push_back(path[cur_mask].sc+1);
			cur_mask=path[cur_mask].fr;
		}
		reverse(vec.begin(),vec.end());
		puts("YES");
		printf("%d\n",(int)vec.size());
		for(int to:vec)printf("%d ",to);
	}else puts("NO");
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:35:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |  scanf("%d%d",&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~
newspapers.cpp:38:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   38 |   scanf("%d%d",&x,&y);
      |   ~~~~~^~~~~~~~~~~~~~

Subtask #1
9.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Partially correct	0 ms	304 KB	Provide a successful but not optimal strategy.
5	Correct	1 ms	212 KB	Output is correct
6	Partially correct	0 ms	212 KB	Provide a successful but not optimal strategy.
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
11	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
12	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
13	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
14	Correct	0 ms	212 KB	Output is correct
15	Partially correct	0 ms	300 KB	Provide a successful but not optimal strategy.
16	Partially correct	1 ms	304 KB	Provide a successful but not optimal strategy.
17	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
18	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
19	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
20	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
21	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
22	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
23	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
24	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
25	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
26	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
27	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
28	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
29	Correct	1 ms	340 KB	Output is correct
30	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
31	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
32	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
33	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
34	Correct	1 ms	340 KB	Output is correct
35	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
36	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
37	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
38	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
39	Partially correct	1 ms	596 KB	Provide a successful but not optimal strategy.
40	Partially correct	1 ms	724 KB	Provide a successful but not optimal strategy.
41	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
42	Partially correct	1 ms	596 KB	Provide a successful but not optimal strategy.
43	Partially correct	1 ms	692 KB	Provide a successful but not optimal strategy.
44	Partially correct	1 ms	592 KB	Provide a successful but not optimal strategy.
45	Correct	1 ms	564 KB	Output is correct
46	Correct	1 ms	468 KB	Output is correct
47	Correct	1 ms	596 KB	Output is correct
48	Partially correct	1 ms	1108 KB	Provide a successful but not optimal strategy.
49	Correct	1 ms	560 KB	Output is correct
50	Correct	1 ms	556 KB	Output is correct
51	Partially correct	1 ms	980 KB	Provide a successful but not optimal strategy.
52	Correct	1 ms	468 KB	Output is correct
53	Correct	1 ms	596 KB	Output is correct
54	Partially correct	1 ms	852 KB	Provide a successful but not optimal strategy.
55	Correct	1 ms	724 KB	Output is correct
56	Correct	1 ms	468 KB	Output is correct
57	Correct	1 ms	1236 KB	Output is correct
58	Correct	1 ms	692 KB	Output is correct
59	Correct	0 ms	212 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	1 ms	212 KB	Output is correct
62	Correct	0 ms	212 KB	Output is correct
63	Correct	1 ms	212 KB	Output is correct
64	Correct	0 ms	212 KB	Output is correct

Subtask #2
0.0 / 8.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	312 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
5	Correct	1 ms	212 KB	Output is correct
6	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
7	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
8	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
9	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
10	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
11	Incorrect	2 ms	212 KB	Output isn't correct
12	Halted	0 ms	0 KB	-

Subtask #3
0.0 / 80.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	304 KB	Output is correct
3	Correct	1 ms	308 KB	Output is correct
4	Partially correct	0 ms	304 KB	Provide a successful but not optimal strategy.
5	Correct	1 ms	212 KB	Output is correct
6	Partially correct	0 ms	212 KB	Provide a successful but not optimal strategy.
7	Correct	0 ms	212 KB	Output is correct
8	Correct	1 ms	212 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
11	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
12	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
13	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
14	Correct	0 ms	212 KB	Output is correct
15	Partially correct	0 ms	300 KB	Provide a successful but not optimal strategy.
16	Partially correct	1 ms	304 KB	Provide a successful but not optimal strategy.
17	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
18	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
19	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
20	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
21	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
22	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
23	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
24	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
25	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
26	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
27	Partially correct	1 ms	308 KB	Provide a successful but not optimal strategy.
28	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
29	Correct	1 ms	340 KB	Output is correct
30	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
31	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
32	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
33	Partially correct	1 ms	340 KB	Provide a successful but not optimal strategy.
34	Correct	1 ms	340 KB	Output is correct
35	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
36	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
37	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
38	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
39	Partially correct	1 ms	596 KB	Provide a successful but not optimal strategy.
40	Partially correct	1 ms	724 KB	Provide a successful but not optimal strategy.
41	Partially correct	1 ms	468 KB	Provide a successful but not optimal strategy.
42	Partially correct	1 ms	596 KB	Provide a successful but not optimal strategy.
43	Partially correct	1 ms	692 KB	Provide a successful but not optimal strategy.
44	Partially correct	1 ms	592 KB	Provide a successful but not optimal strategy.
45	Correct	1 ms	564 KB	Output is correct
46	Correct	1 ms	468 KB	Output is correct
47	Correct	1 ms	596 KB	Output is correct
48	Partially correct	1 ms	1108 KB	Provide a successful but not optimal strategy.
49	Correct	1 ms	560 KB	Output is correct
50	Correct	1 ms	556 KB	Output is correct
51	Partially correct	1 ms	980 KB	Provide a successful but not optimal strategy.
52	Correct	1 ms	468 KB	Output is correct
53	Correct	1 ms	596 KB	Output is correct
54	Partially correct	1 ms	852 KB	Provide a successful but not optimal strategy.
55	Correct	1 ms	724 KB	Output is correct
56	Correct	1 ms	468 KB	Output is correct
57	Correct	1 ms	1236 KB	Output is correct
58	Correct	1 ms	692 KB	Output is correct
59	Correct	0 ms	212 KB	Output is correct
60	Correct	1 ms	212 KB	Output is correct
61	Correct	1 ms	212 KB	Output is correct
62	Correct	0 ms	212 KB	Output is correct
63	Correct	1 ms	212 KB	Output is correct
64	Correct	0 ms	212 KB	Output is correct
65	Correct	1 ms	212 KB	Output is correct
66	Correct	1 ms	212 KB	Output is correct
67	Correct	1 ms	308 KB	Output is correct
68	Partially correct	1 ms	304 KB	Provide a successful but not optimal strategy.
69	Correct	1 ms	212 KB	Output is correct
70	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
71	Correct	1 ms	212 KB	Output is correct
72	Correct	1 ms	212 KB	Output is correct
73	Correct	1 ms	212 KB	Output is correct
74	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
75	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
76	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
77	Partially correct	1 ms	212 KB	Provide a successful but not optimal strategy.
78	Correct	1 ms	212 KB	Output is correct
79	Runtime error	1 ms	340 KB	Execution killed with signal 11
80	Halted	0 ms	0 KB	-

답안 #576812

Compilation message

Subtask #1 9.0 / 12.0

Subtask #2 0.0 / 8.0

Subtask #3 0.0 / 80.0

Subtask #1
9.0 / 12.0

Subtask #2
0.0 / 8.0

Subtask #3
0.0 / 80.0