제출 #522170

#제출 시각아이디문제언어결과실행 시간메모리
522170blueEaster Eggs (info1cup17_eastereggs)C++17
0 / 100
1 ms456 KiB
#include <vector>
#include "grader.h"
using namespace std;

using vi = vector<int>;
using pii = pair<int, int>;

const int mx = 512;

vi edge[1+mx];


// vi ord(1, 0);

// void dfs(int u, int p)
// {
//     ord.push_back(u);
//     for(int v : edge[u])
//     {
//         if(v != p) 
//             dfs(v, u);
//     }
// }


int findEgg (int N, vector < pair < int, int > > bridges)
{
    for(pii b: bridges)
    {
        edge[b.first].push_back(b.second);
        edge[b.second].push_back(b.first);
    }

    // dfs(1, 0);

    // int lo = 1, hi = N;
    // while(lo != hi)
    // {
    //     int mid = (lo+hi)/2;

    //     vi qr;
    //     for(int i = 1; i <= mid; i++)
    //         qr.push_back(ord[i]);

    //     if(query(qr))
    //         hi = mid;
    //     else
    //         lo = mid+1;
    // }

    // return ord[lo];
}

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

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:52:1: warning: no return statement in function returning non-void [-Wreturn-type]
   52 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...