Submission #870444

#TimeUsernameProblemLanguageResultExecution timeMemory
870444ngano_upat_na게임 (IOI14_game)C++17
0 / 100
1 ms2500 KiB
#include "bits/stdc++.h"
#include "game.h"
using namespace std;
 
int N;
bool graph[1500][1500];
 
void initialize(int n) {
    N = n;
    
    for (int i=0; i<n; i++) {
        for (int j=0; j<n; j++) {
            graph[i][j] = false;
        }   
    }   
    for (int i=0; i<1; i++) {
        graph[i][i+1] = true;
    }   
    for (int i=2; i<n-1; i++) {
        graph[i][i+1] = true;
    }   
}
 
int hasEdge(int u, int v) {
    if (graph[u][v]) {
        return 1;
    }   
    return 0;   
}   
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...