Submission #1103850

#TimeUsernameProblemLanguageResultExecution timeMemory
1103850PacybwoahIsland Hopping (JOI24_island)C++17
100 / 100
10 ms604 KiB
#include "island.h"
#include<algorithm>
#include<set>
#include<utility>
#include<vector>
using namespace std;

void solve(int N, int L) {
    int n = N;
    vector<int> ask1(n + 1);
    for(int i = 2; i <= n; i++) ask1[i] = query(1, i - 1);
    vector<int> p(n + 1, -1);
    p[1] = 0;
    p[ask1[2]] = 1;
    for(int times = 3; times <= n; times++){
        int now = ask1[times];
        if(p[now] != -1) continue;
        for(int i = 1; i < n; i++){
            int res = query(now, i);
            if(p[res] == -1){
                p[res] = now;
            }
            else{
                p[now] = res;
                break;
            }
        }
    }
    for(int i = 2; i <= n; i++) answer(i, p[i]);
}
// g++ -std=c++17 -o run grader.cpp island.cpp -fsanitize=undefined -fsanitize=address -Wall -Wshadow -Wextra
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...