| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1337235 | yusifm | Easter Eggs (info1cup17_eastereggs) | C++20 | 1 ms | 436 KiB |
//#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
int findEgg(int n,vector<pair<int,int>>Nums)
{
int left=0,right=n-1,middle;
vector<int>_;
while(left<=right)
{
middle=(left+right)/2,_.clear();
for(int i=1;i<=middle;i++)
{
_.push_back(i);
}
if(!query(_))
{
left=middle+1;
}
else
{
right=middle-1;
}
}
return left;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
