Submission #622444

#	Time	Username	Problem	Language	Result	Execution time	Memory
622444		Hanksburger	Easter Eggs (info1cup17_eastereggs)	C++17	100 / 100	21 ms	464 KiB

eastereggs

#include "grader.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[515], vec, tmp;
void dfs(int x, int p)
{
    vec.push_back(x);
    for (int y:adj[x])
        if (y!=p)
            dfs(y, x);
}
int findEgg(int n, vector<pair<int, int> > edge)
{
    for (int i=1; i<=n; i++)
        adj[i].clear();
    for (int i=0; i<edge.size(); i++)
    {
        int x=edge[i].first, y=edge[i].second;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    vec.clear();
    dfs(1, 1);
    int l=0, r=n-1;
    while (l<r)
    {
        int m=(l+r)/2;
        tmp.clear();
        for (int i=0; i<=m; i++)
            tmp.push_back(vec[i]);
        if (query(tmp))
            r=m;
        else
            l=m+1;
    }
    return vec[l];
}

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:16:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |     for (int i=0; i<edge.size(); i++)
      |                   ~^~~~~~~~~~~~

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