oj.uz

Submission #531583

# Submission time Handle Problem Language Result Execution time Memory
531583 2022-03-01T04:28:44 Z eecs Newspapers (CEOI21_newspapers) C++17
77 / 100
 2 ms 436 KB 
#include <bits/stdc++.h>
using namespace std;

const int maxn = 1010;
int n, m, d[maxn], pre[maxn];
vector<int> path, ans, G[maxn];

int main() {
    scanf("%d %d", &n, &m);
    if (m >= n) puts("NO"), exit(0);
    if (n == 1) puts("YES\n1\n1"), exit(0);
    if (n == 2) puts("YES\n2\n1 1"), exit(0);
    while (m--) {
        int u, v;
        scanf("%d %d", &u, &v);
        G[u].push_back(v), G[v].push_back(u);
    }
    auto bfs = [&]() {
        queue<int> Q;
        for (int i = 1; i <= n; i++) {
            if (!d[i]) Q.push(i);
        }
        while (!Q.empty()) {
            int u = Q.front(); Q.pop();
            for (int v : G[u]) if (!~d[v]) {
                Q.push(v), d[v] = d[u] + 1, pre[v] = u;
            }
        }
    };
    memset(d, -1, sizeof(d));
    d[1] = 0, bfs();
    int s = max_element(d + 1, d + n + 1) - d;
    memset(d, -1, sizeof(d));
    d[s] = 0, bfs();
    int t = max_element(d + 1, d + n + 1) - d;
    for (int i = t; i ^ s; i = pre[i]) path.push_back(i);
    path.push_back(s);
    memset(d, -1, sizeof(d));
    for (int i : path) d[i] = 0;
    bfs();
    if (*max_element(d + 1, d + n + 1) > 2) puts("NO"), exit(0);
    for (int i = 1; i + 1 < path.size(); i++) {
        for (int j : G[path[i]]) if (d[j] == 1) {
            ans.push_back(path[i]), ans.push_back(j);
        }
        ans.push_back(path[i]);
    }
    printf("YES\n%d\n", 2 * ans.size());
    for (int x : ans) printf("%d ", x);
    reverse(ans.begin(), ans.end());
    for (int x : ans) printf("%d ", x);
    return 0;
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:42:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 1; i + 1 < path.size(); i++) {
      |                     ~~~~~~^~~~~~~~~~~~~
newspapers.cpp:48:19: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wformat=]
   48 |     printf("YES\n%d\n", 2 * ans.size());
      |                  ~^     ~~~~~~~~~~~~~~
      |                   |       |
      |                   int     std::vector<int>::size_type {aka long unsigned int}
      |                  %ld
newspapers.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
newspapers.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d %d", &u, &v);
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 12.0

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

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 320 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 2 ms 332 KB Output is correct

Subtask #3
60.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
6 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
12 Correct 0 ms 204 KB Output is correct
13 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
16 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
17 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
18 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
20 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
21 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
22 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
23 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
24 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
25 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
26 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
27 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
28 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
29 Correct 0 ms 204 KB Output is correct
30 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
31 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
33 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
34 Correct 1 ms 204 KB Output is correct
35 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
36 Partially correct 1 ms 252 KB Provide a successful but not optimal strategy.
37 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
38 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
39 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
40 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
41 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
43 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
44 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
45 Correct 0 ms 204 KB Output is correct
46 Correct 0 ms 204 KB Output is correct
47 Correct 0 ms 204 KB Output is correct
48 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
49 Correct 0 ms 204 KB Output is correct
50 Correct 0 ms 204 KB Output is correct
51 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
52 Correct 0 ms 204 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
55 Correct 1 ms 204 KB Output is correct
56 Correct 0 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 0 ms 204 KB Output is correct
59 Correct 0 ms 204 KB Output is correct
60 Correct 0 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 1 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 0 ms 204 KB Output is correct
66 Correct 0 ms 204 KB Output is correct
67 Correct 0 ms 204 KB Output is correct
68 Correct 0 ms 204 KB Output is correct
69 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
70 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
71 Correct 0 ms 204 KB Output is correct
72 Correct 0 ms 204 KB Output is correct
73 Correct 0 ms 204 KB Output is correct
74 Correct 0 ms 204 KB Output is correct
75 Partially correct 1 ms 204 KB Provide a successful but not optimal strategy.
76 Correct 0 ms 204 KB Output is correct
77 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
78 Partially correct 0 ms 204 KB Provide a successful but not optimal strategy.
79 Correct 1 ms 332 KB Output is correct
80 Correct 1 ms 332 KB Output is correct
81 Correct 1 ms 332 KB Output is correct
82 Correct 1 ms 332 KB Output is correct
83 Correct 1 ms 332 KB Output is correct
84 Correct 1 ms 332 KB Output is correct
85 Correct 1 ms 332 KB Output is correct
86 Correct 1 ms 332 KB Output is correct
87 Correct 2 ms 332 KB Output is correct
88 Correct 1 ms 332 KB Output is correct
89 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
90 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
91 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
92 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
93 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
94 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
95 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
96 Partially correct 2 ms 384 KB Provide a successful but not optimal strategy.
97 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
98 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
99 Partially correct 2 ms 332 KB Provide a successful but not optimal strategy.
100 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
101 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
102 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
103 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
104 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
105 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
106 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
107 Partially correct 2 ms 332 KB Provide a successful but not optimal strategy.
108 Partially correct 2 ms 332 KB Provide a successful but not optimal strategy.
109 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
110 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
111 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
112 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
113 Partially correct 2 ms 332 KB Provide a successful but not optimal strategy.
114 Partially correct 2 ms 332 KB Provide a successful but not optimal strategy.
115 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
116 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
117 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
118 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
119 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
120 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
121 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
122 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
123 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
124 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
125 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
126 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
127 Partially correct 2 ms 332 KB Provide a successful but not optimal strategy.
128 Partially correct 1 ms 332 KB Provide a successful but not optimal strategy.
129 Correct 1 ms 332 KB Output is correct
130 Correct 1 ms 332 KB Output is correct
131 Correct 1 ms 332 KB Output is correct
132 Correct 1 ms 332 KB Output is correct
133 Correct 1 ms 332 KB Output is correct
134 Correct 0 ms 204 KB Output is correct
135 Correct 0 ms 204 KB Output is correct
136 Correct 0 ms 204 KB Output is correct
137 Correct 0 ms 204 KB Output is correct
138 Correct 0 ms 204 KB Output is correct
139 Correct 1 ms 204 KB Output is correct
140 Correct 0 ms 204 KB Output is correct
141 Correct 0 ms 204 KB Output is correct
142 Correct 0 ms 204 KB Output is correct
143 Correct 0 ms 204 KB Output is correct
144 Correct 1 ms 436 KB Output is correct
145 Correct 1 ms 332 KB Output is correct