oj.uz

Submission #1067458

# Submission time Handle Problem Language Result Execution time Memory
1067458 2024-08-20T17:18:09 Z Andrey Newspapers (CEOI21_newspapers) C++14
100 / 100
 49 ms 8340 KB 
#include<bits/stdc++.h>
using namespace std;

vector<int> haha[10000];
int n,m;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> m;
    int a,b;
    for(int i = 0; i < m; i++) {
        cin >> a >> b;
        haha[a].push_back(b);
        haha[b].push_back(a);
    }
    if(m > n-1) {
        cout << "NO" << endl;
        return 0;
    }
    vector<int> br(n+1);
    for(int i = 1; i <= n; i++) {
        br[i] = haha[i].size();
    }
    for(int i = 1; i <= n; i++) {
        if(haha[i].size() == 1) {
            br[haha[i][0]]--;
            br[i] = -1;
        }
    }
    vector<int> br1(n+1);
    for(int i = 1; i <= n; i++) {
        br1[i] = br[i];
    }
    bool yeah = false;
    for(int i = 1; i <= n; i++) {
        if(br1[i] <= 1 && br1[i] >= 0) {
            for(int v: haha[i]) {
                br[v]--;
            }
            br[i] = -1;
        }
    }
    for(int i = 1; i <= n; i++) {
        if(br[i] > 2) {
            yeah = true;
        }
    }
    if(yeah) {
        cout << "NO\n";
    }
    else {
        cout << "YES\n";
        if(n == 1) {
            cout << 1 << endl << 1 << endl;
            return 0;
        }
        else if(n == 2) {
            cout << 2 << endl;
            cout << 1 << " " << 1 << endl;
            return 0;
        }
        int y = -1;
        for(int i = 1; i <= n; i++) {
            if(br[i] == 1 || br[i] == 0) {
                y = i;
            }
        }
        vector<int> ans(0);
        if(y == -1) {
            for(int i = 1; i <= n; i++) {
                if(br1[i] >= 0) {
                    ans.push_back(i);
                }
            }
        }
        else {
            vector<int> wow(0);
            while(true) {
                wow.push_back(y);
                bool yeah = false;
                for(int v: haha[y]) {
                    if(br[v] >= 1 && (wow.size() == 1 || wow[wow.size()-2] != v)) {
                        y = v;
                        yeah = true;
                        break;
                    }
                }
                if(!yeah) {
                    break;
                }
            }
            for(int i = 0; i < wow.size(); i++) {
                int a = wow[i];
                if(i > 0) {
                    ans.push_back(a);
                }
                for(int v: haha[a]) {
                    if(br1[v] == 1) {
                        ans.push_back(v);
                        ans.push_back(a);
                    }
                }
            }
            ans.pop_back();
        }
        cout << ans.size()*2 << endl;
        for(int i = 0; i < ans.size(); i++) {
            cout << ans[i] << " ";
        }
        if(ans.size()%2) {
            for(int i = 0; i < ans.size(); i++) {
                cout << ans[i] << " ";
            }
        }
        else {
            for(int i = ans.size()-1; i >= 0; i--) {
                cout << ans[i] << " ";
            }
        }
        cout << endl;
    }
    return 0;
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:95:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |             for(int i = 0; i < wow.size(); i++) {
      |                            ~~^~~~~~~~~~~~
newspapers.cpp:110:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |         for(int i = 0; i < ans.size(); i++) {
      |                        ~~^~~~~~~~~~~~
newspapers.cpp:114:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |             for(int i = 0; i < ans.size(); i++) {
      |                            ~~^~~~~~~~~~~~

Subtask #1
12.0 / 12.0

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

Subtask #2
8.0 / 8.0

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

Subtask #3
80.0 / 80.0

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