#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
#include "grader.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 515;
vv(ll) g[N];
ll sub[N], used[N], tot = 0, d[N], f[N], timer;
void dfs(ll v, ll par = 0)
{
d[v] = timer++;
sub[v] = 1;
for (ll to : g[v])
if (to != par and !used[to])
dfs(to, v), sub[v] += sub[to];
f[v] = timer++;
}
bool parent(ll a, ll b)
{
return d[a] <= d[b] and f[b] <= f[a];
}
int findEgg(int n, vector<pair<int, int>> e)
{
for (ll i = 1; i <= n; i++)
used[i] = 0, g[i].clear();
for (ll i = 0; i < n - 1; i++)
g[e[i].F].pb(e[i].S), g[e[i].S].pb(e[i].F);
tot = n;
while (tot > 1)
{
ll opt = -1, optv = 1, subv = -1e9;
for (ll i = 1; i <= n; i++)
if (!used[i])
{
timer = 1;
dfs(i);
for (ll j = 1; j <= n; j++)
if (opt == -1 or (!used[j] and abs(sub[j] - (tot - sub[j])) < abs(subv - (tot - subv))))
opt = i, optv = j, subv = sub[j];
}
dfs(opt);
vv(int) v;
for (ll i = 1; i <= n; i++)
if (parent(optv, i))
v.pb(i);
// cout << opt << " " << optv << " " << subv << " ";
// for (ll i : v)
// cout << i << " ";
// cout << endl;
if (query(v))
{
for (ll i = 1; i <= n; i++)
used[i] = 1;
for (ll i : v)
used[i] = 0;
}
else
for (ll i : v)
used[i] = 1;
tot = 0;
for (ll i = 1; i <= n; i++)
tot += !used[i];
}
for (ll i = 1; i <= n; i++)
if (!used[i])
return i;
}
Compilation message
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:106:1: warning: control reaches end of non-void function [-Wreturn-type]
106 | }
| ^
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
1 ms |
208 KB |
Number of queries: 4 |
| 2 |
Partially correct |
1 ms |
208 KB |
Number of queries: 5 |
| 3 |
Partially correct |
2 ms |
208 KB |
Number of queries: 9 |
| 4 |
Runtime error |
1 ms |
464 KB |
Execution killed with signal 6 |
| 5 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
336 KB |
Number of queries: 8 |
| 2 |
Runtime error |
7 ms |
464 KB |
Execution killed with signal 6 |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
406 ms |
336 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
