oj.uz

Submission #1054922

# Submission time Handle Problem Language Result Execution time Memory
1054922 2024-08-12T13:03:28 Z Warinchai Island Hopping (JOI24_island) C++17
0 / 100
 3 ms 344 KB 
#include "island.h"
#include<bits/stdc++.h>
using namespace std;
void solve(int N, int L) {
    int ar[305];
    int vis[305];
    for(int i=1;i<=N-1;i++){
        ar[i]=query(1,i);
    }
    vis[1]=1;
    for(int i=1;i<=N-1;i++){
        if(!vis[ar[i]]){
            vis[ar[i]]++;
            int cur=1;
            int x;
            while(!vis[x=query(ar[i],cur)]){
                vis[x]++;
                answer(x,ar[i]);
                cur++;
            }
            if(x==1)answer(x,ar[i]);
        }
    }
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 4.0

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

Subtask #3
0 / 7.0

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

Subtask #4
0 / 9.0

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

Subtask #5
0 / 13.0

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

Subtask #6
0 / 15.0

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

Subtask #7
0 / 22.0

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

Subtask #8
0 / 28.0

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