oj.uz

Submission #983885

# Submission time Handle Problem Language Result Execution time Memory
983885 2024-05-16T07:43:56 Z vjudge1 Game (APIO22_game) C++17
0 / 100
 1 ms 2648 KB 
//#include "game.h"
#include<bits/stdc++.h>
#define sz size()
#define ll int
using namespace std;
const ll N = 100100;

vector<ll> v[N], us, ex;
ll n, k, ok;

void dfs(ll s)
{
    if(ok) return;
    ++us[s];
    for(ll t : v[s])
    {
        if(us[t] && t <= k) ok = 1;
        if(us[t] == 2) return;
        dfs(t);
    }
}

void init(ll NN, ll KK)
{
    n = NN;
    k = KK;
    ex.resize(n + 1);
    for(ll i = 1; i < k; ++i)
        v[i].push_back(i + 1);
}

ll add_teleporter(ll x, ll y)
{
    if(ok) return 1;
    ++x, ++y;
    v[x].push_back(y);
    us = ex;
    dfs(1);
    return ok;
}

//signed main()
//{
//    ios_base::sync_with_stdio(0);
//    cin.tie(0), cout.tie(0);
//    solve();
//}

Subtask #1
0.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Incorrect 1 ms 2648 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 2648 KB Output is correct
2 Incorrect 1 ms 2648 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 2648 KB Output is correct
2 Incorrect 1 ms 2648 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 2648 KB Output is correct
2 Incorrect 1 ms 2648 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 2648 KB Output is correct
2 Incorrect 1 ms 2648 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -