제출 #1306122

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1306122		vlomaczk	Island Hopping (JOI24_island)	C++20	100 / 100	4 ms	424 KiB

island

#include "island.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
using namespace __gnu_pbds;
using namespace std;

template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

void solve(int N, int L) {
	vector<int> Q;
    vector<int> vis(N+1);
    set<int> parents;
    parents.insert(1);
    for(int k=1; k<N; ++k) {
        Q.push_back(query(1, k));
    }
    for(auto x : Q) {
        parents.insert(x);
        if(vis[x]) continue;
        vis[x] = 1;
        for(int k=1; k<N; ++k) {
            int odp = query(x,k);
            answer(odp, x);
            vis[odp] = 1;
            if(parents.find(odp)!=parents.end()) break;
        }
    }
}

• 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