oj.uz

Submission #554983

# Submission time Handle Problem Language Result Execution time Memory
554983 2022-04-29T19:27:04 Z beaconmc Game (IOI14_game) C++14
0 / 100
 0 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

long long sussy[1501];
long long N = 0;
void initialize(int n){
  for(int i=0; i<=n; i++){
    sussy[i] = 0;
  }
  N = n;
}
int hasEdge(int u, int v){
  sussy[u] += 1;
  sussy[v] += 1;
  if (sussy[u] == N-1 && sussy[v] == N-1){
    return 1;
  }
  return 0;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 58.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -