# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
46270 | hiddentesla | Easter Eggs (info1cup17_eastereggs) | C++14 | 67 ms | 936 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<vector<int>> adj;
int findEgg (int n, vector < pair < int, int > > bridges)
{
adj.resize(n+1);
int temp,temp2;
for(temp=0;temp<bridges.size();temp++)
{
int x=bridges[temp].first,y=bridges[temp].second;
adj[x].push_back(y);
adj[y].push_back(x);
}
bool cntbisa[n+1]; int sisacnt=n;
memset(cntbisa,true,sizeof(cntbisa));
while(sisacnt>1)
{
//cout<<sisacnt<<"\n";
queue<int> q;
bool visited[n+1]; memset(visited,false,sizeof(visited));
q.push(1);
vector<int> stk;
int udh=0;
while(!q.empty())
{
int pos=q.front();
q.pop();
if(visited[pos]) continue;
visited[pos]=true;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |