This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
bool vis[N];
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);
}
int spp=0;
bool cycle=0;
void dfs(int x,int p=-1)
{
// cout<<x<<' '<<p<<endl;
vis[x]=1;
for(auto y:adj[x])
{
if(!vis[y])
{
dfs(y,x);
if(cycle)
{
return;
}
}
else{
if(y==spp)
{
cycle=1;
return;
}
}
}
}
int add_teleporter(int u, int v)
{
adj[u].push_back(v);
// adj[v].push_back(u);
for(int sp=0;sp<k;sp++)
{
memset(vis,0,sizeof(vis));
cycle=0;
spp=sp;
dfs(sp);
if(cycle)
{
return 1;
}
// cout<<"-----------------------------------------------------\n";
}
return 0;
}
// int main()
// {
// int na,ka,ma;
// cin>>na>>ka>>ma;
// init(na,ka);
// while(ma--)
// {
// int u,v;
// cin>>u>>v;
// if(add_teleporter(u,v))
// {
// cout<<"KHatam\n";
// exit(0);
// }
// }
// }
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |