# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1174205 | ElayV13 | Easter Eggs (info1cup17_eastereggs) | C++20 | 1 ms | 664 KiB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector < vector < int > > adj;
int findEgg(int N, vector < pair < int, int > > bridges)
{
adj.resize(N + 1);
for(pair < int , int > p : bridges)
{
int u = p.first , v = p.second;
adj[u].push_back(v);
adj[v].push_back(u);
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |