Submission #1308728

#	Time	Username	Problem	Language	Result	Execution time	Memory
1308728		ofoz	Island Hopping (JOI24_island)	C++20	2 / 100	4 ms	448 KiB

island

#include <bits/stdc++.h>
using namespace std;
#include "island.h"
#define vc vector<char>
#define vi vector<int>
#define vii vector<vi>
#define viii vector<vii>
#define viiii vector<viii>
#define viiiii vector<viiii>
#define vb vector<bool>
#define pi pair<double, double>

void dfs(int v, int p, vb& vis, vii& adj, bool& res) {
    if (vis[v]) { res = 1; return; }
    vis[v] = 1;
    for (int to : adj[v]) {
        if (to == p) continue;
        dfs(to, v, vis, adj, res);
    } 
}

bool hasCycle(vii& adj) {
    int n = adj.size()-1;
    bool res = 0;
    vb vis(n+1, 0);
    for (int v = 1; v <= n; v++) {
        if (!vis[v]) dfs(v, -1, vis, adj, res);
    }
    return res;
}



void solve(int n, int L) {
    vb sol(n+1, 0);
    vector<vb> edge(n+1, vb(n+1, 0));
    vii adj(n+1);
    auto addEdge = [&](int a, int b) {
        if (edge[a][b]) return;
        adj[a].push_back(b);
        adj[b].push_back(a);
        edge[a][b] = edge[b][a] = 1;
        
        answer(a, b);
    };
    
    for (int v = n; v >= 1; v--) {
        if (sol[v]) continue;
        int k = 1;
        while (k < n) {
            int q = query(v, k);
            adj[v].push_back(q);
            adj[q].push_back(v);
            if (hasCycle(adj)) {
                adj[v].pop_back();
                adj[q].pop_back();
                break;
            }

            adj[v].pop_back();
            adj[q].pop_back();
            addEdge(v, q);
            int k2 = 1;
            int q2;
            while ((q2 = query(q, k2)) != v) {
                addEdge(q, q2);
                k2++;
            }

            sol[q] = 1;
            k++;
        }
        sol[v] = 1;
    }
}

• 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