oj.uz

Submission #987430

# Submission time Handle Problem Language Result Execution time Memory
987430 2024-05-22T18:22:42 Z hugo_pm Island Hopping (JOI24_island) C++17
2 / 100
 4 ms 880 KB 
#include "island.h"
#include <bits/stdc++.h>
using namespace std;

void solve(int N, int L) {
    vector<set<int>> adj(N+1);
    vector<int> myMin(N+1);
    for (int node = 1; node <= N; ++node) {
        myMin[node] = query(node, 1);
        adj[node].insert(myMin[node]);
        adj[myMin[node]].insert(node);
    }
    for (int node = 1; node <= N; ++node) {
        set<int> bad = adj[myMin[node]];
        for (int k = 2; k <= N-1; ++k) {
            int voisin = query(node, k);
            if (bad.count(voisin))
                break;
            adj[node].insert(voisin);
            adj[voisin].insert(node);
            for (int x : adj[voisin])
                bad.insert(x);
        }
    }
    for (int node = 1; node <= N; ++node) {
        for (int voisin : adj[node]) if (node < voisin) {
            answer(node, voisin);
        }
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 4 ms 600 KB Wrong Answer [5]
6 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

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

Subtask #4
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 4 ms 880 KB Wrong Answer [5]
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 [5]
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 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Incorrect 4 ms 600 KB Wrong Answer [5]
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 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Incorrect 4 ms 600 KB Wrong Answer [5]
5 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

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