Submission #1166110

#TimeUsernameProblemLanguageResultExecution timeMemory
1166110dnnndaIsland Hopping (JOI24_island)C++20
28 / 100
3 ms408 KiB
#include<bits/stdc++.h> #include "island.h" using namespace std; #define S second #define F first #define ll long long //#define int long long //#pragma GCC optimize("Ofast, unroll-loop") //#pragma GCC target("avx,avx2") #pragma GCC optimize("O3") #define init(arr,val) memset(arr,val,sizeof arr) const int inf=0x3f3f3f3f; const ll inff=0x3f3f3f3f3f3f3f3f; const int X=1000000007; //const int X=998244353; bool vis[305]; void solve(int n, int L){ int rt=query(1,n-1); int pre=rt, x=0; vis[rt]=1; for(int i=1 ; x!=1 ; i++){ x=query(rt,i); answer(pre,x); pre=x, vis[x]=1; } int rt2=-1; for(int i=n-1 ; i ; i--){ int v=query(1,i); if(!vis[v]){ rt2=v; break; } } if(rt2==-1) return; pre=rt2, x=0, vis[1]=0; for(int i=1 ; i<=n-1 ; i++){ x=query(rt2,i); if(!vis[x]){ answer(pre,x); pre=x, vis[x]=1; } } return; }
#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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...