#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
#define pb push_back
#define rep(i, a, n) for(int i = (a); i < (n); i++)
#define mod (ll)(1e9+7)
__attribute__((constructor))
void initial() {
cin.tie(0);
ios::sync_with_stdio(false);
}
int s[1501], gn;
int hasEdge(int u, int v) {
u = min(u, v);
s[u]++;
if(s[u] == gn - 2) return true;
else return false;
}
void initialize(int n) {
gn = n;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
11000 KB |
Output is correct |
2 |
Correct |
0 ms |
11000 KB |
Output is correct |
3 |
Correct |
0 ms |
11000 KB |
Output is correct |
4 |
Correct |
0 ms |
11000 KB |
Output is correct |
5 |
Incorrect |
0 ms |
11000 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
11000 KB |
Output is correct |
2 |
Correct |
0 ms |
11000 KB |
Output is correct |
3 |
Correct |
0 ms |
11000 KB |
Output is correct |
4 |
Correct |
0 ms |
11000 KB |
Output is correct |
5 |
Incorrect |
0 ms |
11000 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
11000 KB |
Output is correct |
2 |
Correct |
0 ms |
11000 KB |
Output is correct |
3 |
Correct |
0 ms |
11000 KB |
Output is correct |
4 |
Correct |
0 ms |
11000 KB |
Output is correct |
5 |
Incorrect |
0 ms |
11000 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |