oj.uz

답안 #955481

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955481 2024-03-30T14:19:10 Z yoav_s Newspapers (CEOI21_newspapers) C++17
4 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> v;
typedef vector<v> vv;
typedef vector<vv> vvv;
typedef pair<ll,ll> p;
typedef vector<p> vp;
typedef vector<vp> vvp;
typedef vector<vvp> vvvp;
typedef pair<ll, p> tri;
typedef vector<tri> vtri;
typedef vector<vtri> vvtri;
typedef vector<vvtri> vvvtri;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;

#define f first
#define s second
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()

const ll INF = 1e18;
const ll mod = 1e9 + 7;

int main()
{
    ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    ll N, M;
    cin >> N >> M;
    vv graph(N);
    for (ll i=  0; i < M; i++)
    {
        ll a, b;
        cin >> a >> b;
        graph[a-1].pb(b-1);
        graph[b-1].pb(a-1);
    }
    cout<<"YES\n";
    if (N == 1)
    {
        cout<<"1\n1\n";
    }
    else if (N == 2 || N == 3)
    {
        cout << "2\n2 2\n";
    }
    else
    {
        cout << 2 * N - 4 << "\n";
        for (ll i = 1; i < N - 1; i++) cout << i + 1 << " ";
        for (ll i = 1; i < N - 1; i++) cout << i + 1 << " ";
        cout << "\n";
    }
    return 0;
}

Subtask #1
0.0 / 12.0

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

Subtask #2
4.0 / 8.0

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

Subtask #3
0.0 / 80.0

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