Submission #1321680

#	Time	Username	Problem	Language	Result	Execution time	Memory
1321680		ninstroyer	Easter Eggs (info1cup17_eastereggs)	C++20	0 / 100	1 ms	452 KiB

eastereggs

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

using namespace std;

const int nx = 530;

int act[nx],vis[nx];
vector<int> adj[nx];

int findEgg (int n, vector < pair < int, int > > bridges)
{
    for(int i = 0; i < nx; i++) vis[i]=0,adj[i].clear();
    for(int i = 0; i < n; i++)
    {
        auto [u,v] = bridges[i];
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    queue<int> q;
    q.push(1);
    vis[1] = 1;
    act[1] = 1;
    int cur = 2;
    while(!q.empty())
    {
        int u = q.front();
        q.pop();
        for(auto v : adj[u])
        {
            if(!vis[v])
            {
                vis[v] = 1;
                act[cur] = v;
                cur++;
                q.push(v);
            }
        }
    }
    int l = 1, r = n;
    while(l<r)
    {
        int md = (l+r)/2;
        vector<int> check;
        for(int i = l; i <= md; i++) check.push_back(act[i]);
        if(query(check)) r = md;
        else l = md+1;
    }
    cout<<l;
}

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:50:1: warning: no return statement in function returning non-void [-Wreturn-type]
   50 | }
      | ^

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