oj.uz

Submission #389456

# Submission time Handle Problem Language Result Execution time Memory
389456 2021-04-14T06:20:07 Z abc864197532 Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 5 ms 584 KB 
#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define test(x) cout << #x << ' ' << x << endl
#define printv(x) { \
    for (auto a : x) cout << a << ' '; \
    cout << endl; \
}
#define pii pair<int, int>
#define pll pair<lli, lli>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
const int N = 513, abc = 864197532;

vector <int> adj[N];

int query(vector <int> islands);

int findEgg(int n, vector <pii> bridges) {
    for (pii i : bridges) {
        adj[i.X].pb(i.Y);
        adj[i.Y].pb(i.X);
    }
    vector <bool> dead(n + 1, false);
    dead[0] = true;
    while (count(all(dead), false) > 1) {
        n = count(all(dead), false);
        vector <int> cur;
        int not_dead_cnt = 0;
        function<void(int, int)> dfs = [&](int v, int pa) {
            if (not_dead_cnt < n / 2) cur.pb(v), not_dead_cnt += !dead[v];
            for (int u : adj[v]) if (u != pa) {
                dfs(u, v);
            }
        };
        dfs(1, -1);
        int ans = query(cur);
        for (int i = 1; i <= n; ++i) if (!dead[i] && count(all(cur), i) != ans) {
            dead[i] = true;
        }
    }
    return find(all(dead), true) - dead.begin();
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 456 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 456 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 5 ms 584 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -