oj.uz

Submission #982801

# Submission time Handle Problem Language Result Execution time Memory
982801 2024-05-14T18:17:55 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;
vector <bool> vis;
bool acPos = 0;
int K;

int dfs(int node)
{
 // cout<<"call "<<node<<endl;

  vis[node] = true;

  int resp = 0;
  
  for (auto i : g[node].ady)
  {
    //cout<<"check "<<i<<endl;
    if (!vis[i])
    {
      //cout<<"check "<<i<<endl;
      resp = dfs(i);
    }else
    {
      if (g[i].special)
      {
        //cout<<"si"<<endl;
        acPos = 1;
        resp = 1;
      }
      
      
    }
  }

  //cout<<"no"<<endl;

  return resp;


}

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

  K = k;
  
  for (int i = 0; i < k; i++)
  {
    g[i].special = true;
    
  }
  
}

int add_teleporter(int u, int v) 
{
  fill(vis.begin(), vis.end(), false);
  g[u].ady.push_back(v);

  int resp = acPos;

  for (int i = 0; i < K; i++)
  {
    resp = dfs(i);

    if (resp == 1)
    {
      acPos = true;
      break;
    }
    
  }

  if (acPos)
  {
    resp = true;
  }
  
  
  return resp;
}

Subtask #1
0.0 / 2.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 18.0

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

Subtask #4
0.0 / 30.0

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

Subtask #5
0.0 / 40.0

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