Submission #1274940

#	Time	Username	Problem	Language	Result	Execution time	Memory
1274940		m.zeeshanrashid	Island Hopping (JOI24_island)	C++20	13 / 100	4 ms	412 KiB

island

#ifdef __AVX2__
#pragma GCC target "avx2"
#endif
#pragma GCC optimize "O3"
#pragma GCC optimize "unroll-loops"
#include <bits/stdc++.h>
#include "island.h"
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
using namespace __gnu_pbds; 
using namespace std;
// #define int long long
#define elif else if
#define all(l) begin(l),end(l)
#define rall(l) rbegin(l),rend(l)
#define append push_back
#define print(l) for(auto i:l) cout<<i<<' '; cout<<endl;
#define pprint(a,b) cout<<a<<' '<<b<<endl;
#define inp(l) for(auto &i:l) cin>>i;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define pai make_pair
#define endl "\n"
#define pii pair<int,int>
#define fi first
#define se second
#define vec vector
#define pq priority_queue

// const int mod=998244353;
const int mod1=998244353;
const int mod=1e9+7;
const int N=2e5+5;

bool vis[N];

vec<vec<int>>ed;

// int query(int x,int y){
	// return 1;
// }
// 
// void answer(int x,int y){
// 	
// }

void dfs(int u){
	vis[u]=1;
	int x=query(u,1),y=query(u,2);
	if(!vis[x]){
		ed.append({u,x});
		dfs(x);
	}
	if(!vis[y]){
		ed.append({u,y});
		dfs(y);
	}
}

int iter=1,itera=1;
void solve(int n,int ndsoindfs){
	vis[1]=1;
	for(int i=1;i<=3;i++){
		int x=query(1,i);
		ed.append({1,x});
		dfs(x);
	}
	for(auto i:ed){
		answer(i[0],i[1]);
	}
}
// signed main(){
	// // freopen("","r",stdin);
	// // freopen("","w",stdout);
	// ios_base::sync_with_stdio(false);
	// cin.tie(NULL); 
	// cout.tie(NULL);
	// // cin>>itera;
	// for(iter=1;iter<=itera;iter++) solve();
// }

• Subtask 1: 0 / 2
• Subtask 2: 0 / 4
• Subtask 3: 0 / 7
• Subtask 4: 0 / 9
• Subtask 5: 13 / 13
• Subtask 6: 0 / 15
• Subtask 7: 0 / 22
• Subtask 8: 0 / 28