Submission #1219936

#TimeUsernameProblemLanguageResultExecution timeMemory
1219936guagua0407Game (APIO22_game)C++20
2 / 100
8 ms14504 KiB
//*** Bismillah ***// #pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector") #include <bits/stdc++.h> using namespace std; #if !defined(ONLINE_JUDGE) and !defined(EVAL) #include "template/debug.h" #else #define d(x...) #endif #define fr first #define er erase #define sc second #define in insert #define ll long long #define pb push_back #define vll vector<ll> #define pll pair<ll,ll> #define ull unsigned ll #define vpll vector<pll> #define len(x)(ll)x.size() #define all(x)x.begin(),x.end() const ll INF = 1e9; const ll INFL = 1e18; const ll MOD = 1e9+7; // const ll MOD = 998244353; const ll maxn = 3e5+5; ll n,m,k=0; #include "game.h" ll l[maxn], r[maxn]; vll g[maxn], rg[maxn]; void init(int _n, int _k) { n=_n; k=_k; /*mn=vector<int>(n,inf); mx=vector<int>(n,-1); adj.resize(n); adjr.resize(n); for(int i=0;i<k;i++){ mn[i]=mx[i]=i; if(i>0){ //adj[i-1].push_back(i); //adjr[i].push_back(i-1); } }*/ } int add_teleporter(int u, int v){ if(max(u, v) < k) return u >= v; /*g[u].pb(v), rg[v].pb(u); dfs1(v, l[u]), dfs2(u, r[v]); return l[u] >= r[v];*/ }

Compilation message (stderr)

game.cpp: In function 'int add_teleporter(int, int)':
game.cpp:54:1: warning: control reaches end of non-void function [-Wreturn-type]
   54 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...