Submission #719102

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
719102	2023-04-05 10:54:00	nguyentunglam	Game (IOI14_game)	C++17	42 / 100	1082 ms	1316 KiB

game

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
#include "game.h"
const int N = 1510;
bool mark[N][N], vis[N];
int n;
void initialize(int m) {
    n = m;
    for(int i = 0; i < n; i++) for(int j = 0; j < n; j++) mark[i][j] = 1;
    vis[0] = 1;
}
int hasEdge(int u, int v) {
    mark[u][v] = mark[v][u] = 0;
    queue<int> q;
    for(int i = 1; i < n; i++) vis[i] = 0;
    q.push(0);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        for(int v = 0; v < n; v++) if (!vis[v] && mark[u][v]) {
            q.push(v); vis[v] = 1;
        }
    }
    for(int i = 0; i < n; i++) if (!vis[i]) {
        mark[u][v] = mark[v][u] = 1;
        return 1;
    }
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 15 / 15
• Subtask 2: 27 / 27
• Subtask 3: 0 / 58