# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
48325 |
2018-05-11T17:22:12 Z |
jwvg0425 |
Game (IOI14_game) |
C++17 |
|
2 ms |
648 KB |
#include <stdio.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <iostream>
#include <string>
#include <bitset>
#include <map>
#include <set>
#include <tuple>
#include <string.h>
#include <math.h>
#include <random>
#include <functional>
#include <assert.h>
#include <math.h>
using namespace std;
using i64 = long long int;
using ii = pair<int, int>;
using ii64 = pair<i64, i64>;
vector<int> counts;
vector<int> has;
int total;
int remain;
int need;
void initialize(int n)
{
total = n - 1;
remain = n * (n - 1) / 2;
need = n - 1;
counts.resize(n);
has.resize(n);
}
//n-1개의 엣지를 만든다
//모든 정점에 대해 degree를 1 이상으로 만든다
int hasEdge(int u, int v)
{
int res = 0;
if ((counts[u] == total - 1 && has[u] == 0) ||
(counts[v] == total - 1 && has[v] == 0) ||
remain == need)
{
res = 1;
has[u]++;
has[v]++;
need--;
}
counts[u]++;
counts[v]++;
remain--;
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
380 KB |
Output is correct |
2 |
Correct |
2 ms |
488 KB |
Output is correct |
3 |
Correct |
2 ms |
528 KB |
Output is correct |
4 |
Correct |
2 ms |
528 KB |
Output is correct |
5 |
Correct |
2 ms |
528 KB |
Output is correct |
6 |
Correct |
2 ms |
528 KB |
Output is correct |
7 |
Correct |
2 ms |
648 KB |
Output is correct |
8 |
Correct |
2 ms |
648 KB |
Output is correct |
9 |
Correct |
2 ms |
648 KB |
Output is correct |
10 |
Correct |
2 ms |
648 KB |
Output is correct |
11 |
Correct |
2 ms |
648 KB |
Output is correct |
12 |
Correct |
2 ms |
648 KB |
Output is correct |
13 |
Correct |
2 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
15 |
Correct |
2 ms |
648 KB |
Output is correct |
16 |
Correct |
2 ms |
648 KB |
Output is correct |
17 |
Correct |
2 ms |
648 KB |
Output is correct |
18 |
Correct |
2 ms |
648 KB |
Output is correct |
19 |
Correct |
2 ms |
648 KB |
Output is correct |
20 |
Correct |
2 ms |
648 KB |
Output is correct |
21 |
Correct |
2 ms |
648 KB |
Output is correct |
22 |
Correct |
2 ms |
648 KB |
Output is correct |
23 |
Correct |
2 ms |
648 KB |
Output is correct |
24 |
Correct |
2 ms |
648 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
648 KB |
Output is correct |
2 |
Correct |
2 ms |
648 KB |
Output is correct |
3 |
Correct |
2 ms |
648 KB |
Output is correct |
4 |
Correct |
2 ms |
648 KB |
Output is correct |
5 |
Correct |
2 ms |
648 KB |
Output is correct |
6 |
Correct |
2 ms |
648 KB |
Output is correct |
7 |
Correct |
2 ms |
648 KB |
Output is correct |
8 |
Correct |
2 ms |
648 KB |
Output is correct |
9 |
Correct |
2 ms |
648 KB |
Output is correct |
10 |
Correct |
2 ms |
648 KB |
Output is correct |
11 |
Correct |
2 ms |
648 KB |
Output is correct |
12 |
Correct |
2 ms |
648 KB |
Output is correct |
13 |
Correct |
2 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
15 |
Correct |
2 ms |
648 KB |
Output is correct |
16 |
Correct |
2 ms |
648 KB |
Output is correct |
17 |
Correct |
2 ms |
648 KB |
Output is correct |
18 |
Correct |
2 ms |
648 KB |
Output is correct |
19 |
Correct |
2 ms |
648 KB |
Output is correct |
20 |
Correct |
2 ms |
648 KB |
Output is correct |
21 |
Correct |
2 ms |
648 KB |
Output is correct |
22 |
Correct |
2 ms |
648 KB |
Output is correct |
23 |
Correct |
2 ms |
648 KB |
Output is correct |
24 |
Correct |
2 ms |
648 KB |
Output is correct |
25 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
26 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
648 KB |
Output is correct |
2 |
Correct |
2 ms |
648 KB |
Output is correct |
3 |
Correct |
2 ms |
648 KB |
Output is correct |
4 |
Correct |
2 ms |
648 KB |
Output is correct |
5 |
Correct |
2 ms |
648 KB |
Output is correct |
6 |
Correct |
2 ms |
648 KB |
Output is correct |
7 |
Correct |
2 ms |
648 KB |
Output is correct |
8 |
Correct |
2 ms |
648 KB |
Output is correct |
9 |
Correct |
2 ms |
648 KB |
Output is correct |
10 |
Correct |
2 ms |
648 KB |
Output is correct |
11 |
Correct |
2 ms |
648 KB |
Output is correct |
12 |
Correct |
2 ms |
648 KB |
Output is correct |
13 |
Correct |
2 ms |
648 KB |
Output is correct |
14 |
Correct |
2 ms |
648 KB |
Output is correct |
15 |
Correct |
2 ms |
648 KB |
Output is correct |
16 |
Correct |
2 ms |
648 KB |
Output is correct |
17 |
Correct |
2 ms |
648 KB |
Output is correct |
18 |
Correct |
2 ms |
648 KB |
Output is correct |
19 |
Correct |
2 ms |
648 KB |
Output is correct |
20 |
Correct |
2 ms |
648 KB |
Output is correct |
21 |
Correct |
2 ms |
648 KB |
Output is correct |
22 |
Correct |
2 ms |
648 KB |
Output is correct |
23 |
Correct |
2 ms |
648 KB |
Output is correct |
24 |
Correct |
2 ms |
648 KB |
Output is correct |
25 |
Incorrect |
2 ms |
648 KB |
Output isn't correct |
26 |
Halted |
0 ms |
0 KB |
- |