#include <bits/stdc++.h>
#include "grader.h"
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
/*int query(vector < int > islands){
return 1;
}*/
vector<int> g[600];
int ok[600];
int sz[600];
void calcsz(int v, int prt){
sz[v] = 1;
for(auto u : g[v]){
if(u == prt || ok[u] == 0) continue;
calcsz(u, v);
sz[v] += sz[u];
}
}
vector<int> curv, othv;
void get(int v, int prt, vector<int> &curv){
curv.pb(v);
for(auto u : g[v]){
if(u == prt || ok[u] == 0) continue;
get(u, v, curv);
}
}
int dfs(int v, int prt){
vector<pii> child;
child.pb({-1, -1});
for(auto u : g[v])
if(ok[u])
child.pb({sz[u], u});
vector<bitset<600>> bs(child.size());
bs[0][0] = 1;
for(int i = 1; i < child.size(); ++i)
bs[i] = (bs[i-1]|(bs[i-1]<<child[i].ff));
int cur;
if(bs[child.size()-1][(sz[v]-1)/2])
cur = (sz[v]-1)/2;
else if(bs[child.size()-1][(sz[v])/2])
cur = (sz[v])/2;
else{
for(auto u : g[v]){
if(u == prt || ok[u] == 0) continue;
int bef = sz[u];
sz[u] = sz[v];
sz[v] -= bef;
if(dfs(u, v))
return 1;
sz[v] += bef;
sz[u] = bef;
}
return 0;
}
curv.clear(); othv.clear();
curv.pb(v);
othv.pb(v);
for(int i = child.size()-1; i >= 1; --i){
if(cur-child[i].ff >= 0 && bs[i-1][cur-child[i].ff]){
get(child[i].ss, v, curv);
cur -= child[i].ff;
}
else
get(child[i].ss, v, othv);
}
if(query(curv) == 0)
swap(curv, othv);
return 1;
}
int findEgg(int N, vector<pair<int, int>> bridges){
for(auto u : bridges){
g[u.ff].pb(u.ss);
g[u.ss].pb(u.ff);
}
for(int i = 1; i <= N; ++i)
curv.pb(i);
while(1){
int befsize = curv.size();
if(curv.size() == 1) return curv[0];
if(curv.size() == 2){
if(query({curv[0]}))
return curv[0];
return curv[1];
}
for(int i = 1; i <= N; ++i)
ok[i] = 0;
for(auto u : curv)
ok[u] = 1;
int root = curv[0];
calcsz(root, 0);
dfs(root, 0);
assert(curv.size() < befsize);
}
}
/*int main(){
srand(time(NULL));
cout << findEgg(10, {{1, 2}, {1, 3}, {1, 4}, {1, 5}, {1, 6}, {1, 7}, {1, 8}, {1, 9}, {1, 10}}) << '\n';
cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds ";
}*/
Compilation message
eastereggs.cpp: In function 'int dfs(int, int)':
eastereggs.cpp:46:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for(int i = 1; i < child.size(); ++i)
| ~~^~~~~~~~~~~~~~
In file included from /usr/include/c++/9/cassert:44,
from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:33,
from grader.h:1,
from eastereggs.cpp:2:
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:104:28: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
104 | assert(curv.size() < befsize);
| ~~~~~~~~~~~~^~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
401 ms |
888 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3068 ms |
384 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3075 ms |
512 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
