#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
// type
//#define int long long
typedef long long ll;
typedef long double ld;
// loop
//#define For(i, l, r, x) for (int i = l; i < r; i+=x)
//#define ForE(i, l, r, x) for (int i = l; i <= r; i+=x)
//#define Ford(i, r, l) for (int i = r; i > l; i--)
//#define FordE(i, r, l) for (int i = r; i >= l; i--)
//#define Fora(i, a) for (auto i : a)
// I/O
#define openfile(file) freopen(file".in", "r", stdin); freopen(file".out", "w", stdout);
#define testinput(file) freopen(file".txt", "r", stdin);
#define FAST_IO std::ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
//#define PrintV(a) Fora(ii, a) cout << ii << ' '; cout << rl;
//#define PrintVl(a) Fora(ii, a) cout << ii << rl;
//#define PrintA(a, l, r) for (int ii = l; ii <= r; ii++) cout << a[ii] << ' '; cout << rl;
//#define PrintAl(a, l, r) for (int ii = l; ii <= r; ii++) cout << a[ii] << rl;
//#define Ptest(x) return cout << x, 0;
#define setpre(n) fixed << setprecision(n)
// pair
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
// vector & !!?(string)
#define eb emplace_back
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define sz(a) a.size()
#define len(a) a.length()
// geometry calc
#define pi acos(-1.0)
#define g_sin(a) sin(a*pi/180)
#define g_cos(a) cos(a*pi/180)
#define g_tan(a) tan(a*pi/180)
// set val
#define ms0(a) memset(a, 0, sizeof(a));
#define ms1(a) memset(a, 1, sizeof(a));
#define msn1(a) memset(a, -1, sizeof(a));
#define msinf(a) memset(a, 0x3f3f3f, sizeof(a));
// constant
const int mod1 = 998244353, mod = 1e9+7;
const int MAXN = 1000005, MAXM = 200010;
// code
vector<int> adj[600], ask;
bool egg[600];
int nxt, range, cur;
void dfs(int u, int p){
if (nxt == cur) return;
if (egg[u]) cur ++;
for (auto v:adj[u])
dfs(v, u);
}
int findEgg(int N, vector<pii> bridges){
range = N;
for (int i = 1; i <= N; i++){
adj[i].clear();
}
for(int i = 0; i < N-1; i++){
adj[bridges[i].F].pb(bridges[i].S);
adj[bridges[i].S].pb(bridges[i].F);
}
for (int i = 1; i <= N; i++)
egg[i] = true;
while(range != 1){
nxt = (range+1)/2, cur = 0;
ask.clear();
dfs(1, 0);
if(query(ask)){
bool new_egg[600];
for (int i = 1; i <= N; i++)
new_egg[i] = false;
for(auto v:ask) new_egg[v] = egg[v];
for(int i = 1; i <= N; i++)
egg[i] = new_egg[i];
range = nxt;
}else{
for(auto v:ask) egg[v] = 0;
range -= nxt;
}
}
for(int i = 1; i <= N; i++)
if(egg[i]) return i;
}
//signed main(){
// FAST_IO;
// int TC = 1;
// //cin >> TC;
// while(TC--) Solve();
// cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
// return 0;
//}
Compilation message
eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:93:1: warning: control reaches end of non-void function [-Wreturn-type]
}
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
5 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
5 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Runtime error |
5 ms |
640 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
