oj.uz

답안 #678299

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
678299 2023-01-05T12:14:31 Z stanislavpolyn Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>

//#pragma GCC optimize("O3")

#define fr(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, a, b) for (int i = (a); i >= (b); --i)
#define fe(x, y) for (auto& x : y)

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define mt make_tuple

#define all(x) (x).begin(), (x).end()
#define pw(x) (1LL << (x))
#define sz(x) (int)(x).size()

using namespace std;

//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

mt19937_64 rng(228);

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define fbo find_by_order
#define ook order_of_key

template <typename T>
bool umn(T& a, T b) {
    return a > b ? a = b, 1 : 0;
}
template <typename T>
bool umx(T& a, T b) {
    return a < b ? a = b, 1 : 0;
}

using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename T>
using ve = vector<T>;

const int N = 1005;

int n, m;
ve<int> g[N];
int vis[N];

void dfs(int v) {
    vis[v] = 1;
    fe (to, g[v]) {
        if (!vis[to]) {
            dfs(to);
        } else {
            if (vis[to] == 1) {
                cout << "NO\n";
                exit(0);
            }
        }
    }
    vis[v] = 2;
}

int main() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
    ios::sync_with_stdio(0);
    cin.tie(0);
#endif
//    cout << "YES\n";
//    return 0;

    cin >> n >> m;
    fr (i, 1, m) {
        int a, b;
        cin >> a >> b;

        g[a].pb(b);
        g[b].pb(a);
    }
//
//    fr (i, 1, n) {
//        if (!vis[i]) {
//            dfs(i);
//        }
//    }

    cout << "YES\n";
    ve<int> ans;

    fr (i, 1, n) ans.pb(i);

    cout << sz(ans) << "\n";
    fe (x, ans) {
        cout << x << " ";
    }
    cout << "\n";


    return 0;
}

Subtask #1
0.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
4.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
8 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
9 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
10 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
11 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
12 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
13 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
14 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
15 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
16 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
17 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
18 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
19 Partially correct 1 ms 340 KB Failed to provide a successful strategy.
20 Partially correct 1 ms 340 KB Failed to provide a successful strategy.

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
3 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
4 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
5 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
6 Partially correct 0 ms 340 KB Failed to provide a successful strategy.
7 Incorrect 1 ms 340 KB Output isn't correct
8 Halted 0 ms 0 KB -