제출 #1336979

#제출 시각아이디문제언어결과실행 시간메모리
1336979michael12Easter Eggs (info1cup17_eastereggs)C++20
0 / 100
383 ms196608 KiB
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include "grader.h"
#include<bits/stdc++.h>
#define endl '\n'
#define ff first
#define ss second
using namespace std;
const int maxn = 5e5 + 5;
vector<int> s;
vector<int> adj[maxn];
vector<int> all;
void dfs(int u, int p){
    all.push_back(u);
    for(auto v : adj[u]){
        if(v == p) continue;
        dfs(v, u);
    }
}
int findEgg(int N, vector<pair<int, int>> bridges){
    for(int i = 0; i < bridges.size(); i++){
        adj[bridges[i].ff].push_back(bridges[i].ss);
        adj[bridges[i].ss].push_back(bridges[i].ff);
    }
    dfs(1, - 1);
    vector<int> st;
    for(int i = 0; i < all.size(); i++){
        st.push_back(all[i]);
        if(query(st)){
            return all[i];
        }
    }
}

컴파일 시 표준 에러 (stderr) 메시지

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:33:1: warning: control reaches end of non-void function [-Wreturn-type]
   33 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...