oj.uz

Submission #983037

# Submission time Handle Problem Language Result Execution time Memory
983037 2024-05-15T07:15:46 Z Faisal_Saqib Game (APIO22_game) C++17
0 / 100
 1 ms 1112 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vll vector<ll>
int n,k;
const int N=3e4+10;
vector<int> adj[N];
void init(int Q, int P)
{
    n=Q;
    k=P;
    for(int i=0;(i+1)<k;i++)
        adj[i].push_back(i+1);
}
bool cycle=0;
vector<int> path;
int vis[N];
int cur=1;
void dfs(int x,int p=-1)
{
    path.push_back(x);
    vis[x]=cur;
    for(auto y:adj[x])
    {
        if(vis[y]==0) // Never visited in any other dfs
        {
            dfs(y,x);
            if(cycle)
                return;
        }
        else if(vis[y]==cur){ // Visited in this dfs
            vll ex={y};
            while(path.back()!=y)
            {
                ex.pb(path.back());
                path.pop_back();
            }
            for(auto lp:ex)
            {
                if(lp<k)
                {
                    cycle=1;
                    return;
                }
            }
            while(ex.size())
            {
                path.pb(ex.back());
                ex.pop_back();
            }
        }
        else{// Visited in other dfs but it will not make a cycle
        // bcz if it would there would be a path from there to current node but if a path existed then we would have visited this vertex in the same dfs

        }
    }
    path.pop_back();
}
int add_teleporter(int u, int v)
{
    adj[u].push_back(v);
    memset(vis,0,sizeof(vis));
    cur=1;
    for(int sp=0;sp<k;sp++)
    {
        if(!vis[sp])
        {
            path.clear();
            cycle=0;
            dfs(sp);
            if(cycle)
            {
                return 1;
            }
            cur++;
        }
    }    
    return 0;
}

Subtask #1
0.0 / 2.0

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