#include <bits/stdc++.h>
#define ll int
#define all(x) x.begin(),x.end()
#define sz(x) int(x.size())
#define pb push_back
#define fr first
#define se second
#define mp make_pair
using namespace std;
const int MAXN=1501;
void initialize(int n) {
}
ll ars[MAXN];
int hasEdge(int u, int v)
{
ll x=max(u,v);
ars[x]++;
return ars[x]==x;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |