Submission #1145767

#TimeUsernameProblemLanguageResultExecution timeMemory
1145767tishoEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms428 KiB
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
#include "grader.h"
#define endl '\n'
#define ll long long
int findEgg(int n, vector < pair < int, int > > bridges)
{
    int i=1;
    while(i<=n)
    {
        vector<int>v;
        v.push_back(i);
        v.push_back(i+1);
        int isThere = query(v);
        if(isThere==1)
        {
            v.clear();
            v.push_back(i);
            if(query(v)==1)
            {
                return i;
            }
            v.clear();
            v.push_back(i+1);
            if(query(v)==1)
            {
                return i;
            }
        }
        else
        {
            i++;
        }
        i++;
    }
}

Compilation message (stderr)

eastereggs.cpp: In function 'int findEgg(int, std::vector<std::pair<int, int> >)':
eastereggs.cpp:39:1: warning: control reaches end of non-void function [-Wreturn-type]
   39 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...