oj.uz

답안 #362772

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
362772 2021-02-04T11:02:27 Z mosiashvililuka 게임 (IOI14_game) C++14
0 / 100
 1 ms 384 KB 
#include "game.h"
#include<bits/stdc++.h>
using namespace std;
int a,b,c,d,e,i,j,ii,jj,zx,xc,msh[1509],zm[1509],k[1509][1509],bo[1509];
int fnd(int q){
	if(msh[q]==q) return q; else return msh[q]=fnd(msh[q]);
}
void initialize(int n) {
	a=n;
	for(i=0; i<n; i++){
		msh[i]=i;zm[i]=1;
	}
	for(i=0; i<n; i++){
		for(j=0; j<n; j++){
			if(i!=j) k[i][j]=1;
		}
	}
}
 
int hasEdge(int qqa, int qqb) {
	c=qqa;d=qqb;
	c=fnd(c);d=fnd(d);
	if(c==d){
		return 0;
	}
    if(k[c][d]!=1){
    	k[c][d]--;
    	return 0;
	}else{
		if(zm[c]<zm[d]) swap(c,d);
		msh[d]=c;bo[d]=1;
		for(i=0; i<a; i++){
			if(i!=c&&bo[i]==0){
				k[c][i]=k[c][i]+k[d][i];
				k[i][c]=k[c][i];
			}
		}
		return 1;
	}
}

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 380 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

# 결과 실행 시간 메모리 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 384 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 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 -