oj.uz

Submission #983031

# Submission time Handle Problem Language Result Execution time Memory
983031 2024-05-15T07:12:13 Z Muhammad_Aneeq Game (APIO22_game) C++17
0 / 100
 7 ms 14424 KB 
// #include "game.h"
#include <vector>
#include <set>
using namespace std;
int N,K;
int const MAXN=300000+10;
set<int>nei[MAXN]={};
bool vis[MAXN]={};
void init(int n, int k) 
{
  N=n,K=k;
  for (int i=0;i<k-1;i++)
    nei[i].insert(i+1);
}
bool check_cycle(int n)
{
  vis[n]=1;
  for (auto i:nei[n])
  {
    if (vis[i]&&i<K)
      return 1;
    if (vis[i])
      continue;
    if (check_cycle(i))
      return 1;
  }
  return 0;
}
int add_teleporter(int u, int v) 
{
  nei[u].insert(v);
  for (int i=0;i<K;i++)
  {
    for (int j=0;j<N;j++)
      vis[j]=0;
    if (check_cycle(i)) return 1;
  }
  return 0;
}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Incorrect 6 ms 14380 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Incorrect 6 ms 14380 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Incorrect 6 ms 14380 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Incorrect 6 ms 14380 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 14424 KB Output is correct
2 Incorrect 6 ms 14380 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -