Submission #994170

#	Time	Username	Problem	Language	Result	Execution time	Memory
994170		bachhoangxuan	Island Hopping (JOI24_island)	C++17	100 / 100	10 ms	860 KiB

island

#include "island.h"
#include<bits/stdc++.h>
using namespace std;
const int maxn = 305;
int d[maxn][maxn];

int Query(int v,int k){
    if(d[v][k]) return d[v][k];
    else return d[v][k]=query(v,k);
}

int dd[maxn],par[maxn];

int findpar(int u){
    if(u!=par[u]) return par[u]=findpar(par[u]);
    return u;
}
void unions(int u,int v){
    u=findpar(u);v=findpar(v);
    if(u!=v) par[v]=u;
}

void solve(int N, int L) {
    for(int i=1;i<=N;i++) par[i]=i,dd[i]=1;
    for(int i=1;i<=N;i++){
        for(int u=1;u<=N;u++){
            if(findpar(u)!=findpar(i) && Query(u,dd[u])==i){
                dd[u]++;
                //cout << u << ' ' << i << endl;
                answer(u,i);
                unions(u,i);
            }
        }
    }
}

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