제출 #982046

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
982046		shadow_sami	Island Hopping (JOI24_island)	C++17	65 / 100	8 ms	1568 KiB

island

#include "island.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef 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 = 300+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)=============================================================================================== //

bool f = false;
ll in[mx];
ll dp[mx][mx];
bool mark[mx];
// vi adj2[mx];
// ll dep[mx];

// void dfs(ll u,ll par){
//     fx(adj2[u])
//         if(x!=par){
//             dep[x] = dep[u] + 1;
//             dfs(x,u);
//         }
// }

// int query(ll x,ll y){
//     dfs(x,-1);
//     vector<pi> ls;
//     fip(1,n+1)
//         if(i!=x)
//             ls.push_back({dep[i],i});
//     srt(ls);
//     return ls[y-1].ss;
// }

// void answer(int x,int y){
//     cout<<x<<" "<<y<<nli;
//     return;
// }

typedef struct Disjoint_Set_Union{
    vi par,sz;
    ll range;
    ll src,dest;
    void init(ll k){
        range = k + 10;
        par.resize(range);
        sz.resize(range);
        fip(0,range){
            par[i] = i;
            sz[i] = 1;
        }
        return;
    }
    ll find(ll k){
        return (par[k] == k ? k : par[k] = find(par[k]));
    }
    bool unite(ll u,ll v){
        src = find(u);
        dest = find(v);
        if(src==dest)
            return 0;
        if(sz[src]<sz[dest])
            swap(src,dest);
        sz[src] += sz[dest];
        par[dest] = src;
        return 1;
    }
}DSU;

DSU dsu;
ll get(ll u,ll v){
    if(dp[u][v]==-1)
        dp[u][v] = query(u,v);
    return dp[u][v];
}

void solve(int N, int L) {
    n = N;
    if(n==2){
        answer(1,2);
        return;
    }
    else if(n==3){
        ll in[5][5];
        fip(2,4)
            fjp(1,3){
                tp = query(i,j);
                in[i][j-1] = tp;
            }            
        if(in[3][0] == 2){
            answer(1,2);
            answer(3,2);
        }else if(in[2][0]==3){
            answer(1,3);
            answer(3,2);
        }else{
            answer(1,2);
            answer(1,3);
        }
        return;
    }
    set<pi> st;
    dsu.init(n);
    fip(1,n+1){
        fjp(0,n+2)
            dp[i][j] = -1;
        in[i] = 0;
        mark[i] = 0;
    }
    set<ll> v;
    fip(1,n+1)
        v.insert(i);
    while(1){
        // set<pi> stt;
        // vi v2;
        if(dsu.sz[dsu.find(1)]==n){
            break;
        }
        // debug(v);
        fx(v){
            tp = get(x,in[x]+1);
            // debug(x);
            // debug(tp);
            if(dsu.find(x)!=dsu.find(tp) && get(tp,in[tp]+1)==x){
                dsu.unite(x,tp);
                in[x]++;
                in[tp]++;
                st.insert({min(x,tp),max(x,tp)});
            }
            // else{
            //     v2.push_back(x);
            //     mark[x] = 1;
            // }
        }
        // debug(v2);
        // debug(stt);
        // fx(v2)
        //     v.erase(v.find(x));
        // fx(stt){
        //     in[x.ff]++;
        //     in[x.ss]++;
        //     dsu.unite(x.ff,x.ss);
        // }
    }
    fx(st)
        answer(x.ff,x.ss);
    return;
}

// 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

//         int N,L;
//         cin>>N>>L;
//         ll sr,de;
//         fip(0,N-1){
//             cin>>sr>>de;
//             adj2[sr].push_back(de);
//             adj2[de].push_back(sr);
//         }
//         solve(N,L);
        
//     // cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
//     return 0;
// }

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