oj.uz

Submission #533957

# Submission time Handle Problem Language Result Execution time Memory
533957 2022-03-07T18:02:50 Z AaronJ Newspapers (CEOI21_newspapers) C++
100 / 100
 2 ms 332 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] && G[j].size() > 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:31: 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:23: 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:14: 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:18: 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
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 216 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 320 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 316 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 324 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 316 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 0 ms 316 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 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 320 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 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 328 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 1 ms 332 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 316 KB Output is correct
7 Correct 1 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 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 328 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 332 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 0 ms 320 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 320 KB Output is correct
28 Correct 1 ms 204 KB Output is correct
29 Correct 0 ms 332 KB Output is correct
30 Correct 0 ms 216 KB Output is correct
31 Correct 1 ms 316 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 0 ms 204 KB Output is correct
36 Correct 1 ms 204 KB Output is correct
37 Correct 1 ms 332 KB Output is correct
38 Correct 1 ms 204 KB Output is correct
39 Correct 0 ms 320 KB Output is correct
40 Correct 0 ms 204 KB Output is correct
41 Correct 0 ms 204 KB Output is correct
42 Correct 1 ms 316 KB Output is correct
43 Correct 0 ms 332 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 332 KB Output is correct
47 Correct 1 ms 204 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 320 KB Output is correct
50 Correct 1 ms 332 KB Output is correct
51 Correct 0 ms 204 KB Output is correct
52 Correct 1 ms 332 KB Output is correct
53 Correct 1 ms 204 KB Output is correct
54 Correct 1 ms 204 KB Output is correct
55 Correct 1 ms 324 KB Output is correct
56 Correct 1 ms 204 KB Output is correct
57 Correct 1 ms 204 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 316 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 1 ms 204 KB Output is correct
62 Correct 0 ms 316 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 1 ms 204 KB Output is correct
65 Correct 1 ms 204 KB Output is correct
66 Correct 1 ms 204 KB Output is correct
67 Correct 1 ms 204 KB Output is correct
68 Correct 1 ms 204 KB Output is correct
69 Correct 1 ms 204 KB Output is correct
70 Correct 1 ms 204 KB Output is correct
71 Correct 0 ms 204 KB Output is correct
72 Correct 1 ms 204 KB Output is correct
73 Correct 1 ms 332 KB Output is correct
74 Correct 1 ms 204 KB Output is correct
75 Correct 1 ms 332 KB Output is correct
76 Correct 1 ms 204 KB Output is correct
77 Correct 1 ms 320 KB Output is correct
78 Correct 1 ms 204 KB Output is correct
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 320 KB Output is correct
86 Correct 1 ms 332 KB Output is correct
87 Correct 1 ms 324 KB Output is correct
88 Correct 1 ms 332 KB Output is correct
89 Correct 1 ms 320 KB Output is correct
90 Correct 1 ms 332 KB Output is correct
91 Correct 1 ms 332 KB Output is correct
92 Correct 1 ms 332 KB Output is correct
93 Correct 1 ms 324 KB Output is correct
94 Correct 1 ms 332 KB Output is correct
95 Correct 1 ms 332 KB Output is correct
96 Correct 1 ms 332 KB Output is correct
97 Correct 2 ms 332 KB Output is correct
98 Correct 1 ms 332 KB Output is correct
99 Correct 1 ms 320 KB Output is correct
100 Correct 1 ms 332 KB Output is correct
101 Correct 1 ms 332 KB Output is correct
102 Correct 1 ms 332 KB Output is correct
103 Correct 1 ms 284 KB Output is correct
104 Correct 1 ms 332 KB Output is correct
105 Correct 1 ms 332 KB Output is correct
106 Correct 1 ms 324 KB Output is correct
107 Correct 1 ms 332 KB Output is correct
108 Correct 1 ms 332 KB Output is correct
109 Correct 1 ms 332 KB Output is correct
110 Correct 1 ms 332 KB Output is correct
111 Correct 1 ms 332 KB Output is correct
112 Correct 2 ms 332 KB Output is correct
113 Correct 1 ms 332 KB Output is correct
114 Correct 1 ms 332 KB Output is correct
115 Correct 1 ms 332 KB Output is correct
116 Correct 1 ms 332 KB Output is correct
117 Correct 1 ms 332 KB Output is correct
118 Correct 1 ms 324 KB Output is correct
119 Correct 1 ms 332 KB Output is correct
120 Correct 1 ms 332 KB Output is correct
121 Correct 1 ms 332 KB Output is correct
122 Correct 1 ms 332 KB Output is correct
123 Correct 1 ms 332 KB Output is correct
124 Correct 1 ms 332 KB Output is correct
125 Correct 1 ms 332 KB Output is correct
126 Correct 1 ms 324 KB Output is correct
127 Correct 1 ms 320 KB Output is correct
128 Correct 1 ms 332 KB Output is correct
129 Correct 1 ms 332 KB Output is correct
130 Correct 1 ms 332 KB Output is correct
131 Correct 2 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 1 ms 204 KB Output is correct
135 Correct 1 ms 204 KB Output is correct
136 Correct 1 ms 204 KB Output is correct
137 Correct 1 ms 204 KB Output is correct
138 Correct 1 ms 204 KB Output is correct
139 Correct 1 ms 332 KB Output is correct
140 Correct 1 ms 332 KB Output is correct
141 Correct 1 ms 332 KB Output is correct
142 Correct 1 ms 332 KB Output is correct
143 Correct 1 ms 332 KB Output is correct
144 Correct 1 ms 332 KB Output is correct
145 Correct 1 ms 332 KB Output is correct