oj.uz

Submission #999199

# Submission time Handle Problem Language Result Execution time Memory
999199 2024-06-15T08:05:36 Z crafticat Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>

using namespace std;
vector<vector<int>> g;
int MAX_DEP = 0;

vector<int> ans;

void dfs(int x, int p) {
    ans.push_back(x);
    for (auto child : g[x]) {
        if (child == p) continue;
        ans.push_back(x);
        dfs(child,x);
    }
    ans.push_back(x);
}

int main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);

    int n, m; cin >> n >> m;

    g.resize(n + 1);
    for (int i = 0; i < m; ++i) {
        int a, b; cin >> a >> b;
        g[a].push_back(b);
        g[b].push_back(a);
    }
    if (m != n -1) {
        cout << "NO\n";
        return 0;
    }


    dfs(1,0);
    cout << "YES\n";
    cout << ans.size() << "\n";
    for (int an : ans) {
        cout << an << " ";
    }

    return 0;
}

Subtask #1
0.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 600 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
4 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 604 KB Failed to provide a successful strategy.
12 Partially correct 1 ms 344 KB Failed to provide a successful strategy.
13 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
14 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
15 Partially correct 1 ms 348 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 600 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 604 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 604 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 604 KB Failed to provide a successful strategy.
20 Partially correct 0 ms 604 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# Verdict Execution time Memory Grader output
1 Partially correct 0 ms 600 KB Provide a successful but not optimal strategy.
2 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
3 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
6 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
7 Correct 0 ms 348 KB Output is correct
8 Partially correct 0 ms 348 KB Failed to provide a successful strategy.
9 Incorrect 0 ms 348 KB Output isn't correct
10 Halted 0 ms 0 KB -