oj.uz

Submission #516184

# Submission time Handle Problem Language Result Execution time Memory
516184 2022-01-20T14:56:33 Z mosiashvililuka Newspapers (CEOI21_newspapers) C++14
52 / 100
 71 ms 5096 KB 
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,p[5009],pi,kl[1003][1003],DP[1009],l[5009],li,bo[5009];
int CH[1009][1009];
vector <int> v[1009];
void print(){
	cout<<"YES\n";
	cout<<pi<<"\n";
	for(i=1; i<=pi; i++){
		cout<<p[i]<<" ";
	}
	/*
	cout<<"\n";
	for(i=1; i<=a; i++) CH[0][i]=1;
	for(j=1; j<=pi; j++){
		for(i=1; i<=a; i++){
			CH[j][i]=0;
			for(vector <int>::iterator it=v[i].begin(); it!=v[i].end(); it++){
				if(p[j]!=(*it)&&CH[j-1][(*it)]==1){
					CH[j][i]=1;break;
				}
			}
		}
	}
	e=0;
	for(i=1; i<=a; i++){
		if(CH[pi][i]==1) e++;
	}
	cout<<"WRONG: "<<e;
	*/
	exit(0);
}
void dfs(int q, int w, int rr){
	e=max(e,rr);
	for(vector <int>::iterator it=v[q].begin(); it!=v[q].end(); it++){
		if((*it)==w) continue;
		dfs((*it),q,rr+1);
	}
}
void dfs2(int q, int w){
	li++;l[li]=q;bo[q]=1;
	if(DP[q]-kl[q][w]==0){
		pi=0;
		for(j=1; j<=li; j++){
			pi++;p[pi]=l[j];
			for(vector <int>::iterator it=v[l[j]].begin(); it!=v[l[j]].end(); it++){
				if(bo[(*it)]==1) continue;
				if(v[(*it)].size()!=1){
					pi++;p[pi]=(*it);
				}
				pi++;p[pi]=l[j];
			}
		}
		for(i=pi; i>=1; i--){
			pi++;p[pi]=p[i];
		}
		print();
	}
	for(vector <int>::iterator it=v[q].begin(); it!=v[q].end(); it++){
		if((*it)==w) continue;
		if(DP[q]-kl[q][w]-kl[q][(*it)]!=0) continue;
		dfs2((*it),q);
	}
	li--;bo[q]=0;
}
int main(){
	ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin>>a>>b;
	for(i=1; i<=b; i++){
		cin>>c>>d;
		v[c].push_back(d);
		v[d].push_back(c);
	}
	if(a==1){
		pi=1;p[1]=1;
		print();
	}
	if(a==2){
		pi=2;p[1]=1;p[2]=1;
		print();
	}
	if(b!=a-1){
		cout<<"NO";
		return 0;
	}
	for(i=1; i<=a; i++){
		for(vector <int>::iterator it=v[i].begin(); it!=v[i].end(); it++){
			e=0;
			dfs((*it),i,1);
			if(e>2){
				kl[i][(*it)]=1;DP[i]++;
			}
		}
	}
	for(i=1; i<=a; i++){
		dfs2(i,0);
	}
	cout<<"NO";
	return 0;
}

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
7 Correct 1 ms 344 KB Output is correct
8 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
9 Correct 1 ms 332 KB Output is correct
10 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
11 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
13 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
14 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
20 Partially correct 0 ms 336 KB Failed to provide a successful strategy.
21 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
22 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
24 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
25 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
26 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
27 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
28 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
29 Correct 1 ms 344 KB Output is correct
30 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
31 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
32 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
33 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
34 Correct 1 ms 332 KB Output is correct
35 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
39 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
43 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
44 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 0 ms 332 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct

Subtask #2
6.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
4 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
7 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
8 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
9 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
10 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
11 Partially correct 11 ms 4192 KB Provide a successful but not optimal strategy.
12 Partially correct 4 ms 2380 KB Provide a successful but not optimal strategy.
13 Partially correct 4 ms 2764 KB Provide a successful but not optimal strategy.
14 Partially correct 6 ms 2892 KB Provide a successful but not optimal strategy.
15 Partially correct 6 ms 3020 KB Provide a successful but not optimal strategy.
16 Partially correct 11 ms 4364 KB Provide a successful but not optimal strategy.
17 Partially correct 11 ms 4300 KB Provide a successful but not optimal strategy.
18 Partially correct 10 ms 4300 KB Provide a successful but not optimal strategy.
19 Partially correct 11 ms 4392 KB Provide a successful but not optimal strategy.
20 Partially correct 11 ms 4428 KB Provide a successful but not optimal strategy.

Subtask #3
40.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
5 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
7 Correct 1 ms 344 KB Output is correct
8 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
9 Correct 1 ms 332 KB Output is correct
10 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
11 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
13 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
14 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
16 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
18 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
20 Partially correct 0 ms 336 KB Failed to provide a successful strategy.
21 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
22 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
23 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
24 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
25 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
26 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
27 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
28 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
29 Correct 1 ms 344 KB Output is correct
30 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
31 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
32 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
33 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
34 Correct 1 ms 332 KB Output is correct
35 Partially correct 0 ms 344 KB Failed to provide a successful strategy.
36 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
37 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
38 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
39 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
40 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
41 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
43 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
44 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
45 Correct 1 ms 332 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 0 ms 332 KB Output is correct
48 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
49 Correct 1 ms 332 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
52 Correct 0 ms 332 KB Output is correct
53 Correct 0 ms 332 KB Output is correct
54 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
55 Correct 1 ms 332 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 0 ms 332 KB Output is correct
58 Correct 0 ms 332 KB Output is correct
59 Correct 0 ms 344 KB Output is correct
60 Correct 1 ms 332 KB Output is correct
61 Correct 0 ms 332 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 332 KB Output is correct
64 Correct 1 ms 332 KB Output is correct
65 Correct 1 ms 332 KB Output is correct
66 Correct 0 ms 332 KB Output is correct
67 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
68 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
69 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
70 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
71 Correct 0 ms 332 KB Output is correct
72 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
73 Correct 0 ms 332 KB Output is correct
74 Partially correct 0 ms 332 KB Provide a successful but not optimal strategy.
75 Partially correct 0 ms 332 KB Failed to provide a successful strategy.
76 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
77 Partially correct 1 ms 332 KB Failed to provide a successful strategy.
78 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
79 Correct 10 ms 3404 KB Output is correct
80 Correct 9 ms 3532 KB Output is correct
81 Correct 10 ms 3488 KB Output is correct
82 Correct 14 ms 3804 KB Output is correct
83 Correct 11 ms 3636 KB Output is correct
84 Correct 10 ms 3536 KB Output is correct
85 Correct 10 ms 3532 KB Output is correct
86 Correct 10 ms 3532 KB Output is correct
87 Correct 11 ms 3592 KB Output is correct
88 Correct 9 ms 3256 KB Output is correct
89 Partially correct 18 ms 3788 KB Failed to provide a successful strategy.
90 Partially correct 15 ms 3404 KB Failed to provide a successful strategy.
91 Partially correct 13 ms 3404 KB Failed to provide a successful strategy.
92 Partially correct 11 ms 3148 KB Failed to provide a successful strategy.
93 Partially correct 18 ms 3836 KB Failed to provide a successful strategy.
94 Partially correct 14 ms 3284 KB Failed to provide a successful strategy.
95 Partially correct 20 ms 3916 KB Failed to provide a successful strategy.
96 Partially correct 19 ms 3844 KB Failed to provide a successful strategy.
97 Partially correct 11 ms 3148 KB Failed to provide a successful strategy.
98 Partially correct 18 ms 3792 KB Failed to provide a successful strategy.
99 Partially correct 15 ms 3420 KB Failed to provide a successful strategy.
100 Partially correct 14 ms 3520 KB Failed to provide a successful strategy.
101 Partially correct 15 ms 3416 KB Failed to provide a successful strategy.
102 Partially correct 14 ms 3404 KB Failed to provide a successful strategy.
103 Partially correct 15 ms 3420 KB Failed to provide a successful strategy.
104 Partially correct 11 ms 3040 KB Failed to provide a successful strategy.
105 Partially correct 12 ms 3276 KB Failed to provide a successful strategy.
106 Partially correct 18 ms 3648 KB Failed to provide a successful strategy.
107 Partially correct 12 ms 3244 KB Failed to provide a successful strategy.
108 Partially correct 18 ms 3788 KB Failed to provide a successful strategy.
109 Partially correct 14 ms 3532 KB Failed to provide a successful strategy.
110 Partially correct 14 ms 3532 KB Failed to provide a successful strategy.
111 Partially correct 15 ms 3200 KB Failed to provide a successful strategy.
112 Partially correct 13 ms 3276 KB Failed to provide a successful strategy.
113 Partially correct 23 ms 3896 KB Failed to provide a successful strategy.
114 Partially correct 19 ms 3572 KB Failed to provide a successful strategy.
115 Partially correct 13 ms 3332 KB Failed to provide a successful strategy.
116 Partially correct 16 ms 3476 KB Failed to provide a successful strategy.
117 Partially correct 20 ms 3888 KB Failed to provide a successful strategy.
118 Partially correct 17 ms 3504 KB Failed to provide a successful strategy.
119 Partially correct 14 ms 3404 KB Failed to provide a successful strategy.
120 Partially correct 17 ms 3652 KB Failed to provide a successful strategy.
121 Partially correct 16 ms 3612 KB Failed to provide a successful strategy.
122 Partially correct 13 ms 3276 KB Failed to provide a successful strategy.
123 Partially correct 12 ms 3276 KB Failed to provide a successful strategy.
124 Partially correct 19 ms 3832 KB Failed to provide a successful strategy.
125 Partially correct 10 ms 3020 KB Failed to provide a successful strategy.
126 Partially correct 11 ms 3148 KB Failed to provide a successful strategy.
127 Partially correct 13 ms 3104 KB Failed to provide a successful strategy.
128 Partially correct 18 ms 3808 KB Failed to provide a successful strategy.
129 Correct 13 ms 4044 KB Output is correct
130 Correct 13 ms 3980 KB Output is correct
131 Correct 14 ms 3932 KB Output is correct
132 Correct 13 ms 4188 KB Output is correct
133 Correct 13 ms 3992 KB Output is correct
134 Correct 14 ms 1552 KB Output is correct
135 Correct 12 ms 1568 KB Output is correct
136 Correct 32 ms 4144 KB Output is correct
137 Correct 22 ms 2500 KB Output is correct
138 Correct 33 ms 3244 KB Output is correct
139 Correct 66 ms 5096 KB Output is correct
140 Correct 9 ms 1240 KB Output is correct
141 Correct 4 ms 616 KB Output is correct
142 Correct 57 ms 4884 KB Output is correct
143 Correct 71 ms 4896 KB Output is correct
144 Partially correct 11 ms 4300 KB Provide a successful but not optimal strategy.
145 Partially correct 11 ms 4316 KB Provide a successful but not optimal strategy.