oj.uz

Submission #982713

# Submission time Handle Problem Language Result Execution time Memory
982713 2024-05-14T16:29:27 Z alo_54 Game (APIO22_game) C++17
0 / 100
 1 ms 344 KB 
#include "game.h"
#include <bits/stdc++.h>
using namespace std;

struct Nodo
{
  vector <int> ady;
  bool special = false;

};

vector <Nodo> g;

int dfs(int node, int target, bool isSpecial)
{
  //cout<<"call "<<node<<" "<<target<<endl;
  if (node == target )
  {
    if (isSpecial)
    {
      return 1;
    }

    return 0;
    
  }

  if (g[node].special)
  {
    isSpecial = true;
  }
  

  for (auto i : g[node].ady)
  {
    if (dfs(i, target, isSpecial) == 1)
    {
      return 1;
    }
    
  }

  return 0;

}

void init(int n, int k) 
{
  g.resize(n);

  for (int i = 0; i < n; i++)
  {
    g[i].special = false;
  }
  


  for (int i = 0; i < k; i++)
  {
    g[i].special = true;
    
    if (i != k - 1)
    {
      g[i].ady.push_back(i + 1);
    }
    
  }
  
}

int add_teleporter(int u, int v) 
{
  g[u].ady.push_back(v);

  int resp = 0;

  resp = dfs(v, u, false);
  
  return resp;
}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong Answer[1]
2 Halted 0 ms 0 KB -