Submission #926171

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
926171	2024-02-12T16:26:00 Z	GrindMachine	Newspapers (CEOI21_newspapers)	C++17	50 / 100	52 ms	12240 KB

newspapers

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<ll> adj[N];
set<ll> st[N];
vector<ll> par(N);

void dfs1(ll u, ll p){
    par[u] = p;
    st[u].clear();
    bool leaf = true;

    trav(v,adj[u]){
        if(v == p) conts;
        dfs1(v,u);
        leaf = false;
    }

    if(!leaf and p != -1){
        ll parp = par[p];
        if(parp != -1){
            st[parp].insert(p);
        }
    }
}

void solve(int test_case)
{
    ll n,m; cin >> n >> m;
    rep1(i,m){
        ll u,v; cin >> u >> v;
        adj[u].pb(v), adj[v].pb(u);
    }

    if(m != n-1){
        no;
        return;
    }

    if(n == 1){
        yes;
        cout << 1 << endl << 1 << endl;
        return;
    }

    rep1(i,n){
        dfs1(i,-1);
        bool ok = true;
        rep1(u,n){
            if(sz(st[u]) >= 2){
                ok = false;
            }
        }

        if(ok){
            yes;
            cout << 1 << endl << 1 << endl;
            return;
        }
    }

    no;

    // yes;
    // vector<ll> ans;
    // for(int i = 2; i <= n; ++i){
    //     ans.pb(i);
    // }
    // if(!((n-1)&1)){
    //     ans.pb(1);
    // }
    // for(int i = 2; i <= n; ++i){
    //     ans.pb(i);
    // }

    // cout << sz(ans) << endl;
    // trav(x,ans) cout << x << " ";
    // cout << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
6.0 / 12.0

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

Subtask #2
4.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
3	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
4	Partially correct	1 ms	344 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	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
8	Partially correct	1 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	344 KB	Failed to provide a successful strategy.
11	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
12	Partially correct	0 ms	604 KB	Failed to provide a successful strategy.
13	Partially correct	0 ms	428 KB	Failed to provide a successful strategy.
14	Partially correct	0 ms	604 KB	Failed to provide a successful strategy.
15	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
16	Partially correct	1 ms	604 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	1 ms	604 KB	Failed to provide a successful strategy.

Subtask #3
40.0 / 80.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
3	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
4	Partially correct	1 ms	344 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	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	348 KB	Failed to provide a successful strategy.
11	Partially correct	0 ms	348 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	344 KB	Failed to provide a successful strategy.
14	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
15	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
16	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
17	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
18	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
19	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
20	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
21	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
22	Partially correct	1 ms	344 KB	Failed to provide a successful strategy.
23	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
24	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
25	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
26	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
27	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
28	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
29	Correct	0 ms	348 KB	Output is correct
30	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
31	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
32	Partially correct	0 ms	536 KB	Failed to provide a successful strategy.
33	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
34	Correct	0 ms	348 KB	Output is correct
35	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
36	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
37	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
38	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
39	Partially correct	0 ms	544 KB	Failed to provide a successful strategy.
40	Partially correct	0 ms	600 KB	Failed to provide a successful strategy.
41	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
42	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
43	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
44	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
45	Correct	1 ms	532 KB	Output is correct
46	Correct	1 ms	344 KB	Output is correct
47	Correct	0 ms	344 KB	Output is correct
48	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	344 KB	Output is correct
51	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
52	Correct	0 ms	348 KB	Output is correct
53	Correct	1 ms	348 KB	Output is correct
54	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
55	Correct	0 ms	536 KB	Output is correct
56	Correct	1 ms	348 KB	Output is correct
57	Correct	0 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	1 ms	344 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	0 ms	344 KB	Output is correct
65	Correct	1 ms	356 KB	Output is correct
66	Partially correct	0 ms	356 KB	Failed to provide a successful strategy.
67	Partially correct	0 ms	356 KB	Failed to provide a successful strategy.
68	Partially correct	0 ms	344 KB	Failed to provide a successful strategy.
69	Partially correct	0 ms	356 KB	Failed to provide a successful strategy.
70	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
71	Correct	1 ms	344 KB	Output is correct
72	Partially correct	1 ms	348 KB	Failed to provide a successful strategy.
73	Correct	0 ms	348 KB	Output is correct
74	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
75	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
76	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
77	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
78	Partially correct	0 ms	348 KB	Failed to provide a successful strategy.
79	Correct	12 ms	348 KB	Output is correct
80	Correct	15 ms	348 KB	Output is correct
81	Correct	16 ms	348 KB	Output is correct
82	Correct	14 ms	344 KB	Output is correct
83	Correct	14 ms	348 KB	Output is correct
84	Correct	13 ms	348 KB	Output is correct
85	Correct	13 ms	588 KB	Output is correct
86	Correct	12 ms	348 KB	Output is correct
87	Correct	14 ms	592 KB	Output is correct
88	Correct	11 ms	344 KB	Output is correct
89	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
90	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
91	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
92	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
93	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
94	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
95	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
96	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
97	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
98	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
99	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
100	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
101	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
102	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
103	Partially correct	0 ms	604 KB	Failed to provide a successful strategy.
104	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
105	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
106	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
107	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
108	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
109	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
110	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
111	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
112	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
113	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
114	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
115	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
116	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
117	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
118	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
119	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
120	Partially correct	1 ms	608 KB	Failed to provide a successful strategy.
121	Partially correct	1 ms	612 KB	Failed to provide a successful strategy.
122	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
123	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
124	Partially correct	1 ms	856 KB	Failed to provide a successful strategy.
125	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
126	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
127	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
128	Partially correct	1 ms	600 KB	Failed to provide a successful strategy.
129	Correct	17 ms	348 KB	Output is correct
130	Correct	17 ms	348 KB	Output is correct
131	Correct	17 ms	348 KB	Output is correct
132	Correct	19 ms	592 KB	Output is correct
133	Correct	16 ms	348 KB	Output is correct
134	Correct	11 ms	3000 KB	Output is correct
135	Correct	9 ms	3164 KB	Output is correct
136	Correct	27 ms	9020 KB	Output is correct
137	Correct	16 ms	5208 KB	Output is correct
138	Correct	26 ms	7260 KB	Output is correct
139	Correct	46 ms	12112 KB	Output is correct
140	Correct	7 ms	2140 KB	Output is correct
141	Correct	3 ms	1116 KB	Output is correct
142	Correct	42 ms	11612 KB	Output is correct
143	Correct	52 ms	12240 KB	Output is correct
144	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.
145	Partially correct	1 ms	604 KB	Failed to provide a successful strategy.

Submission #926171

Compilation message

Subtask #1 6.0 / 12.0

Subtask #2 4.0 / 8.0

Subtask #3 40.0 / 80.0

Subtask #1
6.0 / 12.0

Subtask #2
4.0 / 8.0

Subtask #3
40.0 / 80.0