# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
956217 | 2024-04-01T10:41:17 Z | thunopro | Easter Eggs (info1cup17_eastereggs) | C++14 | 2 ms | 616 KB |
#include<bits/stdc++.h> using namespace std ; #define maxn 20009 #define ll long long #define pb push_back #define fi first #define se second #define left id<<1 #define right id<<1|1 #define re exit(0); #define _lower(x) lower_bound(v.begin(),v.end(),x)-v.begin()+1 #define TIME (1.0*clock()/CLOCK_PERS_SEC) const int mod = 1e9+7 ; const int INF = 1e9 ; typedef vector<int> vi ; typedef pair<int,int> pii ; typedef vector<pii> vii ; void add ( int &a , int b ) { a += b ; if ( a >= mod ) a -= mod ; if ( a < 0 ) a += mod ; } template < typename T > void chkmin ( T &a , T b ) { if ( a > b ) a = b ;} template < typename T > void chkmax ( T &a , T b ) { if ( a < b ) a = b ;} void rf () { freopen("bai1.inp","r",stdin) ; } int _pow ( int a , int n ) { if ( n == 0 ) return 1 ; int res = _pow (a,n/2) ; if ( n % 2 ) return 1ll*res*res%mod*a%mod ; else return 1ll*res*res%mod ; } mt19937 rng(time(0)) ; #include "grader.h" int findEgg ( int n , vii bridges ) { for ( int i = 1 ; i <= n ; i ++ ) { vi v ; v . pb (i) ; if ( query(v) == 1 ) return i ; } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 344 KB | Number of queries: 16 |
2 | Partially correct | 2 ms | 344 KB | Number of queries: 16 |
3 | Partially correct | 1 ms | 344 KB | Number of queries: 16 |
4 | Partially correct | 1 ms | 344 KB | Number of queries: 16 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 616 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 452 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |