제출 #504986

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
504986		amukkalir	게임 (IOI14_game)	C++17	0 / 100	1 ms	332 KiB

game

#include "game.h"
#include <bits/stdc++.h> 
using namespace std; 
 
const int nax = 1500; 
int g[nax][nax], f[nax][nax]; 
int alr[nax][nax]; 
int n; 
set<int> rem[nax+5]; 
 
void initialize(int N) {
    n = N; 
    for(int i=0; i<n; i++) for(int j=0; j<n; j++) g[i][j] = (i!=j); 
    for(int i=0; i<n; i++) f[i][i] = 1; 
}
 
void udhin(int u, int v) {
    alr[u][v] = alr[v][u] = true; 
}
 
bool ud(int u, int v) {
    return alr[u][v]; 
}
 
bool ok (int u, int v) {
    vector<int> a[2]; 
 
    for(int i=0; i<n; i++) {
        if(f[u][i] == 0) continue; 
        int x = i; 
        for(int j=0; j<n; j++) { 
            if(f[v][j] == 0) continue; 
            int y = j; 
            if(!ud(x, y)) return false; //kalau ada yg belum ditanya, ga boleh bikin edge
        }
    }
 
    return true; 
}
 
int hasEdge(int u, int v) {
    udhin(u, v); 
    if(ok(u, v)) {
        f[u][v] = f[v][u] = 1; 
    } else {
        g[u][v] = g[v][u] = 0; 
    }
    return g[u][v]; 
}
 
/*
 
ga boleh guess node itu connected sebelum r
gak boleh tau 2 node itu connected sebelum ditanyain 
dgn kata lain, ga boleh ada 2 node yang indirectly connected 
(unless 2 node itu udah ditanya)
 
ga bolleh guess node itu disconnected sblm r
ga boleh ada 1 pun node yang ga connect ke edge manapun, kecuali 
node yang ditanya terakhir 
 
 
*/

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