Submission #652955

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
652955	2022-10-25T09:33:47 Z	aryan12	Game (APIO22_game)	C++17	2 / 100	6 ms	7352 KB

game

#include "game.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 3e5 + 5;
vector<int> g[N];
int max_n, max_k;
int vis[N];
int cnt = 0;

void init(int n, int k) 
{
    max_n = n, max_k = k;
    for(int i = 0; i <= k - 2; i++)
    {
        g[i].push_back(i + 1);
    }
}

bool dfsCycle(int node)
{
    vis[node] = 1;
    cnt += (node <= max_k - 1);
    for(int to: g[node])
    {
        if(vis[to] == 1)
        {
            if(cnt != 0) return true;
            continue;
        }
        if(vis[to] == 2) continue;
        if(dfsCycle(to)) return true;
    }
    vis[node] = 2;
    cnt -= (node <= max_k - 1);
    return false;
}

int add_teleporter(int u, int v) 
{
    cnt = 0;
    g[u].push_back(v);
    for(int i = 0; i <= max_n; i++)
    {
        vis[i] = 0;
    }
    for(int i = 0; i <= max_n; i++)
    {
        if(vis[i] == 0)
        {
            if(dfsCycle(i))
            {
                return 1;
            }
        }
    }
    return 0;
}

Subtask #1

2.0 / 2.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	7248 KB	Output is correct
2	Correct	4 ms	7248 KB	Output is correct
3	Correct	6 ms	7248 KB	Output is correct
4	Correct	4 ms	7248 KB	Output is correct
5	Correct	5 ms	7248 KB	Output is correct
6	Correct	4 ms	7316 KB	Output is correct
7	Correct	4 ms	7248 KB	Output is correct

Subtask #2

0.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	7248 KB	Output is correct
2	Correct	4 ms	7248 KB	Output is correct
3	Correct	6 ms	7248 KB	Output is correct
4	Correct	4 ms	7248 KB	Output is correct
5	Correct	5 ms	7248 KB	Output is correct
6	Correct	4 ms	7316 KB	Output is correct
7	Correct	4 ms	7248 KB	Output is correct
8	Correct	4 ms	7248 KB	Output is correct
9	Correct	4 ms	7248 KB	Output is correct
10	Correct	4 ms	7248 KB	Output is correct
11	Incorrect	4 ms	7352 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	7248 KB	Output is correct
2	Correct	4 ms	7248 KB	Output is correct
3	Correct	6 ms	7248 KB	Output is correct
4	Correct	4 ms	7248 KB	Output is correct
5	Correct	5 ms	7248 KB	Output is correct
6	Correct	4 ms	7316 KB	Output is correct
7	Correct	4 ms	7248 KB	Output is correct
8	Correct	4 ms	7248 KB	Output is correct
9	Correct	4 ms	7248 KB	Output is correct
10	Correct	4 ms	7248 KB	Output is correct
11	Incorrect	4 ms	7352 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	7248 KB	Output is correct
2	Correct	4 ms	7248 KB	Output is correct
3	Correct	6 ms	7248 KB	Output is correct
4	Correct	4 ms	7248 KB	Output is correct
5	Correct	5 ms	7248 KB	Output is correct
6	Correct	4 ms	7316 KB	Output is correct
7	Correct	4 ms	7248 KB	Output is correct
8	Correct	4 ms	7248 KB	Output is correct
9	Correct	4 ms	7248 KB	Output is correct
10	Correct	4 ms	7248 KB	Output is correct
11	Incorrect	4 ms	7352 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	7248 KB	Output is correct
2	Correct	4 ms	7248 KB	Output is correct
3	Correct	6 ms	7248 KB	Output is correct
4	Correct	4 ms	7248 KB	Output is correct
5	Correct	5 ms	7248 KB	Output is correct
6	Correct	4 ms	7316 KB	Output is correct
7	Correct	4 ms	7248 KB	Output is correct
8	Correct	4 ms	7248 KB	Output is correct
9	Correct	4 ms	7248 KB	Output is correct
10	Correct	4 ms	7248 KB	Output is correct
11	Incorrect	4 ms	7352 KB	Wrong Answer[1]
12	Halted	0 ms	0 KB	-