Submission #1166178

#	Time	Username	Problem	Language	Result	Execution time	Memory
1166178		dnnnda	Island Hopping (JOI24_island)	C++20	2 / 100	227 ms	752 KiB

island

#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;

/*
int query(int v, int k){
    cout << "query " << v << ' ' << k << '\n';
    int ret; cin >> ret;
    return ret;
}
void answer(int u, int v){
    cout << "answer: " << u << ' ' << v << '\n';
}*/
int p[305], dis[305][305];
int root(int x){
    if(p[x]<0) return x;
    return p[x]=root(p[x]);
}
void joint(int a, int b){
    int ra=root(a), rb=root(b);
    if(ra==rb) return;
    answer(a,b);
    p[ra]+=p[rb];
    p[rb]=ra;
    return;
}
void solve(int n, int L){
    init(p,-1);
    for(int i=1 ; i<=n ; i++) for(int j=1 ; j<n ; j++) dis[i][j]=query(i,j);
    for(int j=1 ; j<n ; j++) for(int i=1 ; i<=n ; i++){
        for(int d=1 ; d<=j ; d++){
            if(root(i)!=root(dis[i][d])){
                joint(i,dis[i][d]);
                break;
            }
        }
    }
    return;
}

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