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>
#define ll long long
using namespace std;
const ll N=1e3+9,M=2e18+9,L=18,mod=1e9+7;
bool balt;
ll vis[N],n,k,x,y;
vector<ll>v[N];
void dfs(int node)
{
if(vis[node])
{
balt=1;
return;
}
vis[node]=1;
for(auto i:v[node])dfs(i);
}
void init(int n,int k)
{
--k;
for(ll i=0;i<k;++i)v[i].push_back(i+1);
}
int add_teleporter(int x,int y)
{
return 1;
if(n==k)return 1;
v[x].push_back(y);
memset(vis,0,sizeof vis);
balt=0;
dfs(0);
return balt;
}
/*
int main()
{
ios::sync_with_stdio(0);
//cin.tie(0);cout.tie(0);
cin>>n>>k;
init(n,k);
while(1)
{
cin>>x>>y;
v[x].push_back(y);
if(add_teleporter(x,y))
{
cout<<1;
return 0;
}
cout<<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... |