Submission #1353323

#TimeUsernameProblemLanguageResultExecution timeMemory
1353323nataliaaEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms344 KiB
#include <bits/stdc++.h>
#include "grader.h"
#define ff first
#define sc second
using namespace std;
vector<int> ok;
vector<int> v[515];
int vis[515];
int dfs(int u){
    vis[u] = 1;
    ok.push_back(u);
    for(auto i : v[u]){
        if(vis[i]==0) dfs(i);
    }
}
int findEgg (int n, vector < pair < int, int > > v1){
    for(int i = 0; i < n; i++) {
        int x = v1[i].ff, y = v1[i].sc;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    dfs(1);
    int l = 1, r = n-1;
    int x = n;

    while(l<r){
        vector<int>ans ;
        //if (query ({1})) return 1;
        int m = (l+r)/2;
        for(int i  = l-1; i < m; i++) ans.push_back(ok[i]);
        if(query(ans)) {r = m-1; x = m;}
        else l = m+1;
    }
    return ok[x-1];
}

Compilation message (stderr)

eastereggs.cpp: In function 'int dfs(int)':
eastereggs.cpp:15:1: warning: no return statement in function returning non-void [-Wreturn-type]
   15 | }
      | ^
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...