#include<bits/stdc++.h>
#include "game.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifndef ONLINE_JUDGE
#define debug(x) cerr << #x <<" "; _printn(x); cerr << nli;
#else
#define debug(x)
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 1e3+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
int f = 0;
vi adj[mx];
bool vis[mx],dfsvis[mx];
set<pi> st;
void initializer(ll k){
fip(0,k+2)
adj[i].clear();
}
void dfs(ll u){
vis[u] = 1;
dfsvis[u] = 1;
fx(adj[u]){
if(dfs(x))
return 1;
else if(dfsvis[x])
return 1;
}
dfsvis[u] = 0;
return 0;
}
void init(int nn,int kk){
n = nn;
m = kk;
initializer(nn);
fip(0,m-1)
adj[i].push_back(i+1);
}
int add_teleporter(int u, int v) {
adj[u].push_back(v);
fip(0,n+2)
vis[i] = 0,dfsvis[i] = 0;
f = 0;
fip(0,n){
if(!vis[i]){
if(dfs(i));
f = 1;
}
}
return f;
}
// int main(){
// ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input1.txt", "r", stdin);
// freopen("output1.txt", "w", stdout);
// freopen("error1.txt", "w", stderr);
// #endif // ONLINE_JUDGE
// cin>>n>>m>>tp;
// init(n,tp);
// fip(0,m){
// cin>>tptp>>tp2;
// cout<<add_teleporter(tptp,tp2);
// }
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
// return 0;
// }
Compilation message
game.cpp: In function 'void dfs(ll)':
game.cpp:89:9: error: could not convert 'dfs(x)' from 'void' to 'bool'
89 | if(dfs(x))
| ~~~^~~
| |
| void
game.cpp:90:11: error: return-statement with a value, in function returning 'void' [-fpermissive]
90 | return 1;
| ^
game.cpp:92:11: error: return-statement with a value, in function returning 'void' [-fpermissive]
92 | return 1;
| ^
game.cpp:95:9: error: return-statement with a value, in function returning 'void' [-fpermissive]
95 | return 0;
| ^
game.cpp: In function 'int add_teleporter(int, int)':
game.cpp:113:10: error: could not convert 'dfs(i)' from 'void' to 'bool'
113 | if(dfs(i));
| ~~~^~~
| |
| void
game.cpp:113:4: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
113 | if(dfs(i));
| ^~
game.cpp:114:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
114 | f = 1;
| ^
