# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
389234 | casperwang | Easter Eggs (info1cup17_eastereggs) | C++14 | 16 ms | 456 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "grader.h"
#define pii pair<int,int>
#define ff first
#define ss second
#define pb push_back
using namespace std;
#define debug(args...) kout("[ " + string(#args) + " ]", args)
void kout() { cerr << endl; }
template <class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ',kout(b...); }
template <class T> void pary(T L, T R) { while (L != R) cerr << *L << " \n"[++L==R]; }
const int MAXN = 512;
int N;
vector <int> path[MAXN+1];
vector <int> qry;
bool vis[MAXN+1];
int sze[MAXN+1];
void init(int n, vector <pii> bridges) {
N = n;
for (int i = 1; i <= N; i++) {
path[i].clear();
vis[i] = false;
}
for (auto [a, b] : bridges) {
path[a].pb(b);
path[b].pb(a);
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |