| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1332630 | ninstroyer | Island Hopping (JOI24_island) | C++20 | 1 ms | 412 KiB |
#include<bits/stdc++.h>
using namespace std;
#include "island.h"
const int nx = 305;
int x,y,vis[nx];
void solve(int n, int l)
{
vis[1]=1;
for(int i = 1; i < n; i++)
{
x = query(1,i);
if(vis[x]) continue;
vis[x]=1;
for(int j = 1; j < n; j++)
{
y = query(x,j), answer(x,y);
if(vis[y]) continue;
vis[y]=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... | ||||
