| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1274950 | AbdullahIshfaq | Island Hopping (JOI24_island) | C++20 | 4 ms | 412 KiB |
#include <bits/stdc++.h>
#define ll long long
#include "island.h"
using namespace std;
void solve(int n, int l) {
vector<ll> vis(n + 1);
vis[1] = 1;
for(int i = 1; i < n; i++){
ll u = query(1, i);
if(vis[u]){
continue;
}
vis[u] = 1;
for(int j = 1;j < n; j++){
ll v = query(u, j);
answer(u, v);
if(vis[v]){
break;
}
vis[v] = 1;
}
}
}| # | 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... | ||||
