oj.uz

Submission #985410

# Submission time Handle Problem Language Result Execution time Memory
985410 2024-05-17T18:48:40 Z SuPythony Game (APIO22_game) C++17
0 / 100
 1 ms 344 KB 
#include <bits/stdc++.h>
#include "game.h"
using namespace std;

int n,k;
vector<vector<int>> al;

void init(int N, int K) {
    n=N; k=K;
    al.assign(n,vector<int>());
    for (int i=0; i<k-1; i++) al[i].push_back(i+1);
}

vector<int> vis(n,0);
bool dfs(int u) {
    vis[u]=1;
    for (int v: al[u]) {
        if (v<k&&vis[v]) return true;
        if (vis[v]) continue;
        if (dfs(v)) return true;
    }
    return false;
}

int add_teleporter(int u, int v) {
    al[u].push_back(v);
    vis.assign(n,0);
    if (dfs(0)) return 1;
    return 0;
}

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 -