| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1145739 | sash01 | Easter Eggs (info1cup17_eastereggs) | C++20 | 1 ms | 428 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int findEgg (int n, vector < pair < int, int > > bridges)
{
int l=1;
for(int i=1;i<n/2;i++)if(query({i}))return i;
if(n%2==0)
{
if(query({n/2}))return n/2;
l=2;
}
for(int i=n/2+l;i<=n;i++)if(query({i}))return i;
return n/2+l-1;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
