oj.uz

Submission #982890

# Submission time Handle Problem Language Result Execution time Memory
982890 2024-05-15T00:47:32 Z raphaelp Island Hopping (JOI24_island) C++17
65 / 100
 7 ms 1128 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 solve(int N, int L)
{
    vector<vector<int>> AR(N);
    vector<int> occ(N);
    for (int i = N - 1; i >= 0; i--)
    {
        if (occ[i])
            continue;
        occ[i] = 1;
        vector<int> occ2(N);
        for (int k = 1; k < N; k++)
        {
            int x = query(i + 1, k) - 1;
            if (occ2[x])
                break;
            AR[i].push_back(x);
            if (!occ[x])
            {
                for (int j = 1; j < N; j++)
                {
                    int y = query(x + 1, j) - 1;
                    AR[x].push_back(y);
                    if (y == i)
                        break;
                }
                occ[x] = 1;
            }
            for (int j = 0; j < AR[AR[i][k - 1]].size(); j++)
            {
                occ2[AR[AR[i][k - 1]][j]] = 1;
            }
        }
    }
    for (int i = 0; i < N; i++)
    {
        for (int j = 0; j < AR[i].size(); j++)
        {
            if (AR[i][j] < i)
                answer(AR[i][j] + 1, i + 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 solve(int, int)':
island.cpp:41:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |             for (int j = 0; j < AR[AR[i][k - 1]].size(); j++)
      |                             ~~^~~~~~~~~~~~~~~~~~~~~~~~~
island.cpp:49:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |         for (int j = 0; j < AR[i].size(); j++)
      |                         ~~^~~~~~~~~~~~~~

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
4.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 0 ms 344 KB Output is correct
5 Correct 5 ms 616 KB Output is correct
6 Correct 5 ms 876 KB Output is correct
7 Correct 5 ms 856 KB Output is correct
8 Correct 4 ms 872 KB Output is correct
9 Correct 5 ms 872 KB Output is correct

Subtask #3
0 / 7.0

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

Subtask #4
9.0 / 9.0

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

Subtask #5
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 704 KB Output is correct
2 Correct 5 ms 872 KB Output is correct
3 Correct 7 ms 448 KB Output is correct
4 Correct 4 ms 852 KB Output is correct
5 Correct 5 ms 700 KB Output is correct
6 Correct 5 ms 856 KB Output is correct
7 Correct 5 ms 600 KB Output is correct
8 Correct 5 ms 600 KB Output is correct
9 Correct 4 ms 600 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 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 5 ms 616 KB Output is correct
6 Correct 5 ms 876 KB Output is correct
7 Correct 5 ms 856 KB Output is correct
8 Correct 4 ms 872 KB Output is correct
9 Correct 5 ms 872 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 6 ms 616 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 4 ms 1128 KB Output is correct
14 Correct 4 ms 596 KB Output is correct
15 Correct 4 ms 872 KB Output is correct
16 Correct 7 ms 856 KB Output is correct
17 Correct 6 ms 616 KB Output is correct
18 Correct 4 ms 1112 KB Output is correct
19 Correct 4 ms 600 KB Output is correct
20 Correct 4 ms 600 KB Output is correct
21 Correct 5 ms 600 KB Output is correct
22 Correct 5 ms 872 KB Output is correct
23 Correct 4 ms 624 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 5 ms 956 KB Output is correct
26 Correct 6 ms 852 KB Output is correct
27 Correct 5 ms 600 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 4 ms 872 KB Output is correct
30 Correct 4 ms 1128 KB Output is correct
31 Correct 4 ms 600 KB Output is correct
32 Correct 4 ms 876 KB Output is correct
33 Correct 6 ms 600 KB Output is correct
34 Correct 6 ms 600 KB Output is correct
35 Correct 4 ms 600 KB Output is correct
36 Correct 4 ms 696 KB Output is correct
37 Correct 5 ms 344 KB Output is correct
38 Correct 5 ms 616 KB Output is correct
39 Correct 7 ms 604 KB Output is correct
40 Correct 4 ms 600 KB Output is correct
41 Correct 4 ms 344 KB Output is correct
42 Correct 4 ms 872 KB Output is correct
43 Correct 4 ms 856 KB Output is correct
44 Correct 4 ms 600 KB Output is correct

Subtask #7
22.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 Correct 5 ms 704 KB Output is correct
5 Correct 5 ms 872 KB Output is correct
6 Correct 7 ms 448 KB Output is correct
7 Correct 4 ms 852 KB Output is correct
8 Correct 5 ms 700 KB Output is correct
9 Correct 5 ms 856 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 600 KB Output is correct
12 Correct 4 ms 600 KB Output is correct
13 Correct 4 ms 600 KB Output is correct
14 Correct 5 ms 872 KB Output is correct
15 Correct 4 ms 600 KB Output is correct
16 Correct 4 ms 620 KB Output is correct
17 Correct 4 ms 600 KB Output is correct
18 Correct 5 ms 704 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 616 KB Output is correct
21 Correct 4 ms 600 KB Output is correct
22 Correct 4 ms 440 KB Output is correct
23 Correct 4 ms 872 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 5 ms 856 KB Output is correct
26 Correct 4 ms 696 KB Output is correct
27 Correct 5 ms 596 KB Output is correct
28 Correct 7 ms 1012 KB Output is correct
29 Correct 4 ms 700 KB Output is correct
30 Correct 6 ms 604 KB Output is correct
31 Correct 4 ms 700 KB Output is correct
32 Correct 4 ms 600 KB Output is correct
33 Correct 4 ms 600 KB Output is correct
34 Correct 4 ms 600 KB Output is correct
35 Correct 4 ms 600 KB Output is correct
36 Correct 4 ms 616 KB Output is correct
37 Correct 5 ms 600 KB Output is correct
38 Correct 4 ms 856 KB Output is correct

Subtask #8
0 / 28.0

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