oj.uz

Submission #379851

# Submission time Handle Problem Language Result Execution time Memory
379851 2021-03-19T14:08:26 Z Mounir Game (IOI14_game) C++14
0 / 100
 1 ms 492 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 2000;
int nFaits[N][N];
int ens[N], taille[N];
int nNoeuds;
set<int> zones;

void initialize(int n) {
	nNoeuds = n;
	for (int noeud = 0; noeud < nNoeuds; ++noeud){
		ens[noeud] = noeud;
		taille[noeud] = 1;
		zones.insert(noeud);
	}
}

int find(int noeud){
	if (ens[noeud] != noeud)
		ens[noeud] = find(ens[noeud]);
	return ens[noeud];
}

void add(int a, int b, int delta){
	nFaits[a][b] += delta;
	nFaits[b][a] += delta;
}

void fusion(int pere, int fils){
	zones.erase(fils);
	for (int zone : zones)
		add(pere, zone, nFaits[zone][fils]);
	taille[pere] += taille[fils];
	ens[fils] = pere;
}

int hasEdge(int u, int v) {
    u = find(u), v = find(v);
    if (u == v)
    	return 0;
    nFaits[u][v]++;
    if (nFaits[u][v] == taille[u] * taille[v]){
    	fusion(u, v);
    	return 1;
    }
    else
    	return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 492 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -