# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
389334 | 2021-04-14T03:09:01 Z | abc864197532 | Easter Eggs (info1cup17_eastereggs) | C++17 | 2 ms | 456 KB |
#include <bits/stdc++.h> using namespace std; #define lli long long int #define pb push_back #define eb emplace_back #define mp make_pair #define test(x) cout << #x << ' ' << x << endl #define printv(x) { \ for (auto a : x) cout << a << ' '; \ cout << endl; \ } #define pii pair<int, int> #define pll pair<lli, lli> #define X first #define Y second #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() const int N = 512, abc = 864197532; vector <int> adj[N]; int query(vector <int> islands); int findEgg(int n, vector <pii> bridges) { for (int i = 1; i <= n; ++i) if (query({i})) { return i; } }
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 | 2 ms | 200 KB | Number of queries: 16 |
4 | Partially correct | 1 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 | 1 ms | 456 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |