# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
484541 | 2021-11-04T11:17:13 Z | MohamedFaresNebili | Easter Eggs (info1cup17_eastereggs) | C++14 | 2 ms | 456 KB |
#include <bits/stdc++.h> /// #pragma GCC optimize ("Ofast") /// #pragma GCC target ("avx2") using namespace std; using ll = long long; using vi = vector<int>; #define pb push_back #define ff first #define ss second #define lb lower_bound #define all(x) (x).begin() , (x).end() #include "grader.h" int findEgg (int N, vector < pair < int, int > > bridges) { for(int l = 1; l <= N; l++) { if(query({l})) return l; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 2 ms | 200 KB | Number of queries: 16 |
2 | Partially correct | 2 ms | 200 KB | Number of queries: 16 |
3 | Partially correct | 1 ms | 200 KB | Number of queries: 16 |
4 | Partially correct | 2 ms | 200 KB | Number of queries: 16 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 456 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 456 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |