제출 #981719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
981719		someone	Island Hopping (JOI24_island)	C++17	2 / 100	5 ms	804 KiB

island

#include "island.h"
#include <algorithm>
#include <iostream>
using namespace std;

const int M = 342;

int pre[M], n, l;
bool adj[M][M], reported[M][M], found[M];

void add(int x, int y) {
    adj[x][y] = adj[y][x] = true;
    pre[x] = max(pre[x], y);
    pre[y] = max(pre[y], x);
    if(!reported[x][y]) {
        answer(x, y);
        reported[x][y] = reported[y][x] = true;
    }
}

void find(int i) {
    if(found[i]) return;
    found[i] = true;
    int k = 1;
    while(k < n) {
        int nxt = query(i, k);
        add(i, nxt);
        if(nxt == pre[i])
            k = n;
        k++;
    }
}

void solve(int nb, int l) {
    n = nb;
    for(int i = 1; i <= n; i++)
        pre[i] = -1;
    for(int i = n; i > 0; i--) {
        if(pre[i] == -1) {
            int k = 1;
            while(k < n) {
                int nxt = query(i, k);
                bool ok = true;
                for(int j = 1; j <= n; j++)
                    if(adj[i][j] && adj[j][nxt])
                        ok = false;
                if(ok) {
                    add(i, nxt);
                    find(nxt);
                } else {
                    k = n;
                }
                k++;
            }
        } else {
            find(i);
        }
    }
}

• 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