Submission #1189864

#	Time	Username	Problem	Language	Result	Execution time	Memory
1189864		racha555	Easter Eggs (info1cup17_eastereggs)	C++20	0 / 100	1 ms	1584 KiB

eastereggs

#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
vector<int> adj[513],path[513];
int disc=1;
void dfs(int u){
    for(auto v:adj[u]){
        if(path[v].empty()){
            path[v]=path[u];
       
            path[v].emplace_back(v);
            dfs(v);
        }
    }
}
int  findEgg (int N, vector < pair < int, int > > bridges)
{
    for(auto [u,v]:bridges){
          adj[u].emplace_back(v);
          adj[v].emplace_back(u);
    }
    path[1].emplace_back(1);
    dfs(1);
    for(int i=1;i<=N;i++){
        for(auto v:path[i]){
            cout<<v<<" ";
        }
        cout<<"\n";
    }
    path[1].emplace_back(1);
    int l=0,mid,r=N;
    // while(l<r){
    //     int  mid=l+(r-l)/2;
    //     if(query(path[mid])==1){
    //         r=mid;
    //     }
    //     else{
    //         l=mid+1;
    //     }
    // }
    return r;
    // if (query ({1})) return 1;
    // return N;

}
// int main(){
//     findEgg(5,{{1,2},{1,3},{2,4},{4,5}});
// }

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