# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
67728 | 2018-08-15T09:14:27 Z | tempytemptemp | Easter Eggs (info1cup17_eastereggs) | C++14 | 4 ms | 740 KB |
#include <vector> #include <cassert> #include <algorithm> #include "grader.h" using namespace std; int findEgg(int N, vector < pair < int, int > > bridges); int query(vector < int > islands); int findEgg(int n, vector<pair<int,int>>bridges){ assert(n<=16); for(int i=0; i<bridges.size(); i++){ if(query({bridges[i].first, bridges[i].second})){ if(query({bridges[i].first})) return bridges[i].first; else return bridges[i].second; } } return -1; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 376 KB | Number of queries: 16 |
2 | Incorrect | 3 ms | 376 KB | Number of queries: 16 |
3 | Incorrect | 3 ms | 376 KB | Number of queries: 16 |
4 | Incorrect | 4 ms | 388 KB | Number of queries: 16 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 548 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 740 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |