oj.uz

Submission #981712

# Submission time Handle Problem Language Result Execution time Memory
981712 2024-05-13T13:38:25 Z someone Island Hopping (JOI24_island) C++17
2 / 100
 5 ms 600 KB 
#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];

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) {
    int k = 1;
    while(k < n) {
        int nxt = query(i, k);
        if(nxt != pre[i]) {
            add(i, nxt);
        } else {
            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.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Incorrect 5 ms 452 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 600 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 5 ms 600 KB Wrong Answer [7]
3 Halted 0 ms 0 KB -

Subtask #5
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 600 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -

Subtask #6
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Incorrect 5 ms 452 KB Wrong Answer [7]
6 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 4 ms 600 KB Wrong Answer [3]
5 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 600 KB Wrong Answer [3]
2 Halted 0 ms 0 KB -