제출 #857419

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
857419		chilinhxyzabc	Easter Eggs (info1cup17_eastereggs)	C++17	0 / 100	2 ms	504 KiB

eastereggs

#include <bits/stdc++.h>
#define ll long long
#define infInt (int)1e9 + 1
// #define infLL 0x3f3f3f3f3f3f
#define infLL (int)1e17
#define vt vector<int>
#define vtt vector<vt>
#define vttt vector<vtt>
#define vtttt vector<vttt>
#define pii pair<int, int>
#define vpii vector<pii>
#define endl '\n'
#define all(a) a.begin(), a.end()
#define _sort(a) sort(all(a))
#define bsUp(a, x) upper_bound(all(a), x) - a.begin()
#define bsLow(a, x) lower_bound(all(a), x) - a.begin()
#define rev(a) reverse(all(a))
#define uni(vals) vals.resize(distance(vals.begin(), unique(all(vals))))
// #define int ll
// #define in(a); ; 
// #define hi ;
// #include "/home/phamngocthi/cp/see.cpp"
using namespace std;
 
vt st;
vector<vector<int>> adj(600, vector<int>());
 
void dfs(int u, int p) {
    st.push_back(u);
    for(int v : adj[u]) {
        if(v == p)
            continue;
        dfs(v, u);
    }
}
 
int query(vector<int> islands);
 
int findEgg(int N, vector<pair<int,int>> bridges) {
    for(int i = 1; i <= N; i++)
        adj[i].clear();
    for(auto[u, v] : bridges) {
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    st.clear();
    dfs(1, 0);
    int l = 0, r = N - 1;
    while(l <= r) {
        int m = (l + r) / 2;
        vector<int> a;
        for(int i = 0; i <= m; i++)
            a.push_back(st[i]);
        if(query(a)) {
            r = m;
        } else {
            l = m + 1;
        }
        a.clear();
    }
    return st[l];
}
 
// signed main() {
//     ios_base::sync_with_stdio(false);cin.tie(NULL);
// }

• Subtask 1: 0 / 40
• Subtask 2: 0 / 40
• Subtask 3: 0 / 20