oj.uz

Submission #725299

# Submission time Handle Problem Language Result Execution time Memory
725299 2023-04-17T08:07:29 Z Nahian9696 Game (APIO22_game) C++17
2 / 100
 29 ms 208 KB 
#include "game.h"


#include <bits/stdc++.h>

using namespace std;

// #define int          long long

#define f0(i, n)      for(int i = 0; i <  (n); i++)
#define f1(i, n)      for(int i = 1; i <= (n); i++)
#define ff first
#define ss second
#define pb push_back



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


void init(int a, int b) {
    n = a;
    k = b;
    vector<int> node;
    grph.resize(n, node);
    f1(u, k-1) {
        grph[u-1].pb(u);
    }
}

int add_teleporter(int a, int b) {

    if(a >= b) if (a < k) return 1;

    grph[a].pb(b);


    f0(u, k) {
        bool vis[n] = {0};
        queue<int> q;
        q.push(u);
        vis[u] = 1;
        while(!q.empty()) {
            int cur = q.front();
            q.pop();
            for(int nxt: grph[cur]) {
                if(vis[nxt]) continue;
                if(nxt == u) return 1;
                q.push(nxt);
                vis[nxt] = 1;
            }
        }
    }


    return 0;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 29 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 28 ms 208 KB Output is correct
6 Correct 25 ms 208 KB Output is correct
7 Correct 29 ms 208 KB Output is correct

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 29 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 28 ms 208 KB Output is correct
6 Correct 25 ms 208 KB Output is correct
7 Correct 29 ms 208 KB Output is correct
8 Incorrect 1 ms 208 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 29 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 28 ms 208 KB Output is correct
6 Correct 25 ms 208 KB Output is correct
7 Correct 29 ms 208 KB Output is correct
8 Incorrect 1 ms 208 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 29 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 28 ms 208 KB Output is correct
6 Correct 25 ms 208 KB Output is correct
7 Correct 29 ms 208 KB Output is correct
8 Incorrect 1 ms 208 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 0 ms 208 KB Output is correct
3 Correct 29 ms 208 KB Output is correct
4 Correct 4 ms 208 KB Output is correct
5 Correct 28 ms 208 KB Output is correct
6 Correct 25 ms 208 KB Output is correct
7 Correct 29 ms 208 KB Output is correct
8 Incorrect 1 ms 208 KB Wrong Answer[1]
9 Halted 0 ms 0 KB -