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