oj.uz

Submission #957237

# Submission time Handle Problem Language Result Execution time Memory
957237 2024-04-03T09:33:20 Z LucaIlie Newspapers (CEOI21_newspapers) C++17
77 / 100
 149 ms 4780 KB 
#include <bits/stdc++.h>

using namespace std;

const int MAX_N = 1e3;
int n;
int depth[MAX_N + 1], parent[MAX_N + 1], maxDepth[MAX_N + 1], lf[MAX_N + 1], sizee[MAX_N + 1];
vector<int> adj[MAX_N + 1];

int findCentroid( int u, int p ) {
    int c = 0, mx = 0;
    sizee[u] = 1;
    for ( int v: adj[u] ) {
        if ( v == p )
            continue;
        int x = findCentroid( v, u );
        if ( x != 0 )
            c = x;
        sizee[u] += sizee[v];
        mx = max( mx, sizee[v] );
    }
    mx = max( mx, n - sizee[u] );
    if ( mx <= n / 2 )
        c = u;
    return c;
}

bool ok = true;
void check( int u, int p ) {
    depth[u] = depth[p] + 1;
    maxDepth[u] = depth[u];
    int c = 0;
    for ( int v: adj[u] ) {
        if ( v == p )
            continue;
        check( v, u );
        maxDepth[u] = max( maxDepth[u], maxDepth[v] );
        if ( maxDepth[v] - depth[u] > 2 )
            c++;
    }
    if ( (depth[u] >= 3 && c >= 2) || (c >= 3) )
        ok = false;
}

bool isOnDiam[MAX_N + 1];
vector<int> diam;
int diamLen = 0, x = 0, y = 0, l = 0;
void dfs( int u, int p ) {
    int mx1 = -1, a = u, mx2 = -1, b = 0;

    parent[u] = p;
    for ( int v: adj[u] ) {
        if ( v == p )
            continue;

        dfs( v, u );
        if ( depth[v] > mx1 ) {
            mx2 = mx1;
            b = a;
            mx1 = depth[v];
            a = lf[v];
        } else if ( depth[v] > mx2 ) {
            mx2 = depth[v];
            b = lf[v];
        }
    }


    depth[u] = mx1 + 1;
    lf[u] = a;
    if ( mx1 + mx2 + 2 > diamLen ) {
        diamLen = mx1 + mx2 + 2;
        x = a;
        y = b;
        l = u;
    }
    //printf( "%d %d %d %d\n", u, mx1, mx2, depth[u] );
}

int main() {
    int m;

    cin >> n >> m;
    for ( int i = 0; i < m; i++ ) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back( v );
        adj[v].push_back( u );
    }

    if ( m != n - 1 ) {
        cout << "NO\n";
        return 0;
    }

    if ( n == 1 ) {
        cout << "YES\n1\n1\n";
        return 0;
    }
    if ( n <= 3 ) {
        cout << "YES\n2\n2 2\n";
        return 0;
    }

    int c = findCentroid( 1, 0 );
    check( c, 0 );

    if ( !ok ) {
        cout << "NO\n";
        return 0;
    }

    dfs( c, 0 );

    while ( x != l ) {
        diam.push_back( x );
        isOnDiam[x] = true;
        x = parent[x];
    }
    diam.push_back( l );
    isOnDiam[l] = true;

    vector<int> a;
    while ( y != l ) {
        a.push_back( y );
        isOnDiam[y] = true;
        y = parent[y];
    }
    reverse( a.begin(), a.end() );
    for ( int u: a )
        diam.push_back( u );

    vector<int> sol;
    for ( int i = 1; i <= diam.size() - 2; i++ ) {
        int v = diam[i];
        sol.push_back( v );
        for ( int u: adj[v] ) {
            if ( isOnDiam[u] )
                continue;
            sol.push_back( u );
            sol.push_back( v );
        }
    }
    reverse( diam.begin(), diam.end() );
    for ( int i = 1; i <= diam.size() - 2; i++ ) {
        int v = diam[i];
        sol.push_back( v );
        for ( int u: adj[v] ) {
            if ( isOnDiam[u] )
                continue;
            sol.push_back( u );
            sol.push_back( v );
        }
    }

    cout << "YES\n";
    cout << sol.size() << "\n";
    for ( int v: sol )
        cout << v << " ";

    return 0;
}

Compilation message

newspapers.cpp: In function 'int main()':
newspapers.cpp:134:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  134 |     for ( int i = 1; i <= diam.size() - 2; i++ ) {
      |                      ~~^~~~~~~~~~~~~~~~~~
newspapers.cpp:145:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |     for ( int i = 1; i <= diam.size() - 2; i++ ) {
      |                      ~~^~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
16 Partially correct 1 ms 600 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
18 Partially correct 0 ms 600 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
20 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
21 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
22 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
23 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
24 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
25 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
26 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
27 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
28 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
29 Correct 0 ms 348 KB Output is correct
30 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
31 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
33 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
34 Correct 0 ms 348 KB Output is correct
35 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
36 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
37 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
38 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
39 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
40 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
41 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
43 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
44 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 600 KB Output is correct

Subtask #3
60.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
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 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
12 Correct 0 ms 348 KB Output is correct
13 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
14 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
15 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
16 Partially correct 1 ms 600 KB Provide a successful but not optimal strategy.
17 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
18 Partially correct 0 ms 600 KB Provide a successful but not optimal strategy.
19 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
20 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
21 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
22 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
23 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
24 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
25 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
26 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
27 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
28 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
29 Correct 0 ms 348 KB Output is correct
30 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
31 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
32 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
33 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
34 Correct 0 ms 348 KB Output is correct
35 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
36 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
37 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
38 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
39 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
40 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
41 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
42 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
43 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
44 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Partially correct 0 ms 344 KB Provide a successful but not optimal strategy.
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 1 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 0 ms 348 KB Output is correct
67 Correct 1 ms 412 KB Output is correct
68 Correct 0 ms 348 KB Output is correct
69 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
70 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
71 Correct 0 ms 348 KB Output is correct
72 Correct 0 ms 348 KB Output is correct
73 Correct 1 ms 348 KB Output is correct
74 Correct 0 ms 348 KB Output is correct
75 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
76 Correct 1 ms 348 KB Output is correct
77 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
78 Partially correct 0 ms 348 KB Provide a successful but not optimal strategy.
79 Correct 1 ms 348 KB Output is correct
80 Correct 1 ms 344 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 1 ms 348 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 1 ms 348 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 1 ms 500 KB Output is correct
89 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
90 Partially correct 2 ms 348 KB Provide a successful but not optimal strategy.
91 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
92 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
93 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
94 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
95 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
96 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
97 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
98 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
99 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
100 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
101 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
102 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
103 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
104 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
105 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
106 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
107 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
108 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
109 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
110 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
111 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
112 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
113 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
114 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
115 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
116 Partially correct 2 ms 344 KB Provide a successful but not optimal strategy.
117 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
118 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
119 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
120 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
121 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
122 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
123 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
124 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
125 Partially correct 1 ms 344 KB Provide a successful but not optimal strategy.
126 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
127 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
128 Partially correct 1 ms 348 KB Provide a successful but not optimal strategy.
129 Correct 1 ms 344 KB Output is correct
130 Correct 1 ms 348 KB Output is correct
131 Correct 1 ms 348 KB Output is correct
132 Correct 1 ms 348 KB Output is correct
133 Correct 1 ms 348 KB Output is correct
134 Correct 34 ms 1408 KB Output is correct
135 Correct 24 ms 1372 KB Output is correct
136 Correct 64 ms 3932 KB Output is correct
137 Correct 42 ms 2388 KB Output is correct
138 Correct 74 ms 2908 KB Output is correct
139 Correct 134 ms 4696 KB Output is correct
140 Correct 18 ms 1116 KB Output is correct
141 Correct 7 ms 604 KB Output is correct
142 Correct 124 ms 4312 KB Output is correct
143 Correct 149 ms 4780 KB Output is correct
144 Correct 1 ms 600 KB Output is correct
145 Correct 1 ms 600 KB Output is correct