Submission #986498

#	Time	Username	Problem	Language	Result	Execution time	Memory
986498		boris_mihov	Island Hopping (JOI24_island)	C++17	100 / 100	6 ms	856 KiB

island

#include "island.h"
#include <vector>

void solve(int n, int L) 
{
    std::vector <int> order(n);
    std::vector <bool> foundParent(n + 1, false);
    for (int i = 1 ; i < n ; ++i)
    {
        order[i] = query(1, i);
    }   

    foundParent[1] = true;
    for (int i = 1 ; i < n ; ++i)
    {
        if (!foundParent[order[i]])
        {
            for (int idx = 1 ; idx < n ; ++idx)
            {
                int curr = query(order[i], idx);
                answer(order[i], curr);
                if (foundParent[curr])
                {
                    foundParent[order[i]] = true;
                    break;
                }

                foundParent[curr] = true;
            }
        }
    }
}

• Subtask 1: 2 / 2
• Subtask 2: 4 / 4
• Subtask 3: 7 / 7
• Subtask 4: 9 / 9
• Subtask 5: 13 / 13
• Subtask 6: 15 / 15
• Subtask 7: 22 / 22
• Subtask 8: 28 / 28