| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1281086 | nathlol2 | Island Hopping (JOI24_island) | C++20 | 3 ms | 400 KiB |
#include "island.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n, int L){
int hd = query(1, n - 1);
int k = query(hd, 1);
answer(hd, k);
int pv = hd;
for(int i = 0;i<n - 2;i++){
int a = query(k, 1), b = query(k, 2);
if(a != pv){
answer(k, a);
pv = k;
k = a;
}else{
answer(k, b);
pv = k;
k = b;
}
}
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
