oj.uz

Submission #982860

# Submission time Handle Problem Language Result Execution time Memory
982860 2024-05-14T20:51:06 Z raphaelp Island Hopping (JOI24_island) C++17
43 / 100
 9 ms 1112 KB 
#include <bits/stdc++.h>
#include "island.h"
using namespace std;
/*vector<vector<int>> dist;
int query(int x, int k)
{
    return dist[x - 1][k] + 1;
}
void answer(int a, int b)
{
    cout << a << ' ' << b << endl;
}*/
void dfs(int x, vector<vector<int>> &AR, vector<int> &occ)
{
    occ[x] = 1;
    bool b = 0;
    for (int k = 1; k < AR.size(); k++)
    {
        int v = query(x + 1, k);
        v--;
        if (occ[v] == 2)
        {
            if (AR[v][x] == 1)
            {
                AR[v][x] = 2;
                AR[x][v] = 2;
                continue;
            }
            break;
        }
        if (occ[v] == 1)
        {
            if (b)
                break;
            b = 1;
            AR[x][v] = 1;
            if (AR[v][x] == 1)
            {
                AR[v][x] = 2;
                AR[x][v] = 2;
                continue;
            }
        }
        if (occ[v] == 0)
        {
            AR[x][v] = 1;
            dfs(v, AR, occ);
        }
    }
    occ[x] = 2;
}
void solve(int N, int L)
{
    vector<vector<int>> AR(N, vector<int>(N));
    vector<int> occ(N);
    dfs(0, AR, occ);
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < i; j++)
        {
            if (AR[i][j] == 2)
                answer(i + 1, j + 1);
        }
    }
}
/*int main()
{
    int N, L;
    cin >> N >> L;
    vector<vector<int>> AR(N);
    for (int i = 0; i < N - 1; i++)
    {
        int a, b;
        cin >> a >> b;
        a--, b--;
        AR[a].push_back(b);
        AR[b].push_back(a);
    }
    dist.assign(N, vector<int>(N, 0));
    for (int i = 0; i < N; i++)
    {
        vector<int> occ(N);
        priority_queue<pair<int, int>> PQ;
        int buff = 0;
        PQ.push({0, -i});
        while (!PQ.empty())
        {
            int x = -PQ.top().second, t = -PQ.top().first;
            PQ.pop();
            if (occ[x])
                continue;
            occ[x] = 1;
            dist[i][buff++] = x;
            for (int j = 0; j < AR[x].size(); j++)
            {
                PQ.push({-(t + 1), -AR[x][j]});
            }
        }
    }
    solve(N, L);
}*/

Compilation message

island.cpp: In function 'void dfs(int, std::vector<std::vector<int> >&, std::vector<int>&)':
island.cpp:17:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   17 |     for (int k = 1; k < AR.size(); k++)
      |                     ~~^~~~~~~~~~~

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 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 6 ms 800 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 8 ms 1112 KB Output is correct
9 Correct 9 ms 856 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 4 ms 976 KB Output is correct
3 Correct 5 ms 600 KB Output is correct
4 Correct 6 ms 856 KB Output is correct
5 Correct 6 ms 600 KB Output is correct
6 Correct 7 ms 856 KB Output is correct
7 Correct 5 ms 800 KB Output is correct
8 Correct 7 ms 856 KB Output is correct
9 Correct 5 ms 1112 KB Output is correct

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 856 KB Output is correct
2 Correct 5 ms 856 KB Output is correct
3 Correct 4 ms 600 KB Output is correct
4 Correct 6 ms 600 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 5 ms 600 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 5 ms 972 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 6 ms 800 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 8 ms 1112 KB Output is correct
9 Correct 9 ms 856 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 4 ms 976 KB Output is correct
12 Correct 5 ms 600 KB Output is correct
13 Correct 6 ms 856 KB Output is correct
14 Correct 6 ms 600 KB Output is correct
15 Correct 7 ms 856 KB Output is correct
16 Correct 5 ms 800 KB Output is correct
17 Correct 7 ms 856 KB Output is correct
18 Correct 5 ms 1112 KB Output is correct
19 Correct 5 ms 796 KB Output is correct
20 Correct 5 ms 856 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 4 ms 680 KB Output is correct
23 Correct 4 ms 600 KB Output is correct
24 Correct 8 ms 600 KB Output is correct
25 Correct 7 ms 856 KB Output is correct
26 Correct 4 ms 600 KB Output is correct
27 Correct 4 ms 856 KB Output is correct
28 Correct 5 ms 600 KB Output is correct
29 Correct 5 ms 856 KB Output is correct
30 Correct 5 ms 600 KB Output is correct
31 Correct 5 ms 596 KB Output is correct
32 Correct 5 ms 600 KB Output is correct
33 Correct 4 ms 856 KB Output is correct
34 Correct 5 ms 856 KB Output is correct
35 Correct 6 ms 600 KB Output is correct
36 Correct 5 ms 680 KB Output is correct
37 Correct 5 ms 600 KB Output is correct
38 Correct 5 ms 856 KB Output is correct
39 Correct 5 ms 600 KB Output is correct
40 Correct 4 ms 856 KB Output is correct
41 Correct 6 ms 600 KB Output is correct
42 Correct 6 ms 684 KB Output is correct
43 Correct 6 ms 600 KB Output is correct
44 Correct 6 ms 856 KB Output is correct

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 600 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 5 ms 856 KB Output is correct
5 Correct 5 ms 856 KB Output is correct
6 Correct 4 ms 600 KB Output is correct
7 Correct 6 ms 600 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 5 ms 852 KB Output is correct
11 Correct 4 ms 600 KB Output is correct
12 Correct 5 ms 972 KB Output is correct
13 Incorrect 4 ms 600 KB Wrong Answer [3]
14 Halted 0 ms 0 KB -

Subtask #8
0 / 28.0

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