#include "island.h" #include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define ll long long #define ld long double #define ull unsigned long long #define ff first #define ss second #define pii pair<int,int> #define pll pair<long long, long long> #define vi vector<int> #define vl vector<long long> #define pb push_back #define rep(i, b) for(int i = 0; i < (b); ++i) #define rep2(i,a,b) for(int i = a; i <= (b); ++i) #define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c) #define count_bits(x) __builtin_popcountll((x)) #define all(x) (x).begin(),(x).end() #define siz(x) (int)(x).size() #define forall(it,x) for(auto& it:(x)) using namespace __gnu_pbds; using namespace std; typedef tree<int, null_type, less<int>, rb_tree_tag,tree_order_statistics_node_update> ordered_set; //mt19937 mt;void random_start(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());} //ll los(ll a, ll b) {return a + (mt() % (b-a+1));} const int INF = 1e9+50; const ll INF_L = 1e18+40; const ll MOD = 1e9+7; vi graph[301]; bool is_edge[301][301]; bool is_full[301]; int n; void add_edge(int a, int b) { if(a > b) swap(a,b); if(is_edge[a][b]) return; is_edge[a][b] = 1; graph[a].pb(b); graph[b].pb(a); } void upd_node(int v) { if(is_full[v]) return; rep2(k,1,n) { int v2 = query(v,k); add_edge(v2,v); if(v2 > v) break; } is_full[v] = 1; } void solve(int N, int L) { n = N; for(int i = n; i >= 1; i--) { if(is_full[i]) { forall(it,graph[i]) upd_node(it); } else { rep2(k,1,n) { int v2 = query(i,k); bool is = 0; forall(it,graph[i]) { forall(it2,graph[it]) { if(v2 == it2) is = 1; } } if(is) break; add_edge(i,v2); upd_node(v2); } } is_full[i] = 1; } rep2(i,1,n) forall(it,graph[i]) if(it < i) answer(it,i); }