Submission #153524

#	Time	Username	Problem	Language	Result	Execution time	Memory
153524		nicolaalexandra	Easter Eggs (info1cup17_eastereggs)	C++14	100 / 100	21 ms	380 KiB

eastereggs

#include <iostream>
#include "grader.h"
#include <vector>
#include <algorithm>
#define DIM 1000
using namespace std;
vector <int> E,v,L[DIM];

/*int query (vector <int> v){
    for (int i=0;i<v.size();i++)
        cout<<v[i]<<" ";
    cout<<endl;
    int ans;
    cin>>ans;
    return ans;
}*/

void dfs (int nod, int tata){
    E.push_back(nod);
    for (int i=0;i<L[nod].size();i++){
        int vecin = L[nod][i];
        if (vecin != tata)
            dfs (vecin,nod);
    }
    //E.push_back(nod);
}
int verif (int poz1, int poz2){
    v.clear();
    for (int i=poz1;i<=poz2;i++)
        v.push_back(E[i]);
    //sort (v.begin(),v.end());
    //v.resize(unique(v.begin(),v.end())-v.begin());
    return query (v);
}
int findEgg (int n, vector <pair<int,int> > mch){
    for (int i=1;i<=n;i++)
        L[i].clear();
    for (int i=0;i<n-1;i++){
        int x = mch[i].first, y = mch[i].second;
        L[x].push_back(y);
        L[y].push_back(x);
    }
    E.clear();
    dfs (1,0);
    int st = 0, dr = E.size()-1;
    while (st < dr){
        int mid = (st+dr)>>1;
        if (verif (0,mid))
            dr = mid;
        else st = mid+1;
    }
    return E[st];
}
/*int main (){

    cin>>n;
    for (i=1;i<n;i++){
        cin>>x>>y;
        mch.push_back(make_pair(x,y));
    }
    cout<<findEgg (n,mch);


    return 0;
}*/

Compilation message (stderr)

eastereggs.cpp: In function 'void dfs(int, int)':
eastereggs.cpp:20:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0;i<L[nod].size();i++){
                  ~^~~~~~~~~~~~~~

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