oj.uz

답안 #593981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
593981 2022-07-11T19:14:25 Z vladislav11 Newspapers (CEOI21_newspapers) C++14
20 / 100
 2 ms 2772 KB 
#include <bits/stdc++.h>

using namespace std;

int n, m;
vector< vector<int> > grp;
vector<int> used;

void dfs ( int v, int p )
{
    used[v] = 1;

    for ( auto& to : grp[v] )
    if ( to != p )
    {
        if ( used[to] )
        {
            cout << "NO\n";
            exit(0);
        }

        dfs( to, v );
    }
}

const int N = 1<<20;
pair<int,int> pre[N];

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

    cin >> n >> m;

    grp.resize( n+1 );

    for ( int i=0; i<m; i++ )
    {
        int u, v;
        cin >> u >> v;

        grp[u].push_back( v );
        grp[v].push_back( u );
    }

    used.assign( n+1, 0 );

    dfs( 1, -1 );

    if ( n <= 20 )
    {
        queue<int> q;
        q.push( (1<<n)-1 );

        while ( q.size() && pre[0].second == 0 )
        {
            int v = q.front();
            q.pop();

            int x = 0;

            for ( int i=0; i<n; i++ )
            if ( (v>>i) & 1 )
            for ( auto& to : grp[i+1] )
                x |= 1 << (to-1);

            for ( int i=0; i<n; i++ )
            if ( pre[ x & (~(1<<i)) ].second == 0 )
            {
                pre[ x & (~(1<<i)) ] = { v, i+1 };
                q.push( x & (~(1<<i)) );

                if ( ( x & (~(1<<i)) ) == 0 )
                    break;
            }
        }

        if ( pre[0].second == 0 )
        {
            cout << "NO\n";
            return 0;
        }

        vector<int> ans;

        int pos = 0;

        while ( pos != (1<<n)-1 )
        {
            ans.push_back( pre[pos].second );
            pos = pre[pos].first;
        }

        cout << "YES\n";

        cout << ans.size() << '\n';

        while ( ans.size() )
        {
            cout << ans.back() << ' ';
            ans.pop_back();
        }

        return 0;
    }

    cout << "YES\n";

    if ( n == 1 )
    {
        cout << "1 1";
        return 0;
    }

    if ( n == 2 )
    {
        cout << "2 1 1";
        return 0;
    }

    cout << 2*(n-2) << '\n';

    for ( int i=2; i<n; i++ )
        cout << i << ' ';

    for ( int i=n-1; i>1; i-- )
        cout << i << ' ';

    return 0;
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 580 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 1 ms 724 KB Output is correct
43 Correct 1 ms 1092 KB Output is correct
44 Correct 1 ms 852 KB Output is correct
45 Correct 1 ms 852 KB Output is correct
46 Correct 1 ms 840 KB Output is correct
47 Correct 1 ms 1236 KB Output is correct
48 Correct 2 ms 1748 KB Output is correct
49 Correct 1 ms 1108 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 2 ms 2260 KB Output is correct
52 Correct 1 ms 1364 KB Output is correct
53 Correct 1 ms 1492 KB Output is correct
54 Correct 1 ms 1864 KB Output is correct
55 Correct 1 ms 1748 KB Output is correct
56 Correct 1 ms 1088 KB Output is correct
57 Correct 2 ms 2772 KB Output is correct
58 Correct 1 ms 1748 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 328 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 328 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 328 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
0.0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 328 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 580 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 724 KB Output is correct
40 Correct 1 ms 724 KB Output is correct
41 Correct 1 ms 596 KB Output is correct
42 Correct 1 ms 724 KB Output is correct
43 Correct 1 ms 1092 KB Output is correct
44 Correct 1 ms 852 KB Output is correct
45 Correct 1 ms 852 KB Output is correct
46 Correct 1 ms 840 KB Output is correct
47 Correct 1 ms 1236 KB Output is correct
48 Correct 2 ms 1748 KB Output is correct
49 Correct 1 ms 1108 KB Output is correct
50 Correct 1 ms 1108 KB Output is correct
51 Correct 2 ms 2260 KB Output is correct
52 Correct 1 ms 1364 KB Output is correct
53 Correct 1 ms 1492 KB Output is correct
54 Correct 1 ms 1864 KB Output is correct
55 Correct 1 ms 1748 KB Output is correct
56 Correct 1 ms 1088 KB Output is correct
57 Correct 2 ms 2772 KB Output is correct
58 Correct 1 ms 1748 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 328 KB Output is correct
62 Correct 0 ms 212 KB Output is correct
63 Correct 0 ms 212 KB Output is correct
64 Correct 0 ms 212 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 0 ms 212 KB Output is correct
68 Correct 0 ms 212 KB Output is correct
69 Correct 1 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 1 ms 220 KB Output is correct
72 Correct 0 ms 212 KB Output is correct
73 Correct 0 ms 212 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 1 ms 212 KB Output is correct
76 Correct 0 ms 216 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Incorrect 1 ms 340 KB Output isn't correct
80 Halted 0 ms 0 KB -