| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1275043 | muhammad-ahmad | Island Hopping (JOI24_island) | C++20 | 3 ms | 412 KiB |
#include <bits/stdc++.h>
#include "island.h"
using namespace std;
//
// int query(int i, int j){
// int x; cin >> x;
// return x;
// }
//
// void answer(int i, int j){
// cout << i << ' ' << j << endl;
// }
void solve(int n, int l){
// void solve() {
// int n, l; cin >> n >> l;
map<pair<int, int>, int> C;
vector<pair<int, int>> p[n + 1];
for (int i = 1; i <= n; i++){
int f = query(i, 1), ex = query(i, 2);
if (!C[{f, i}]){
C[{f, i}] = 1;
C[{i, f}] = 1;
answer(i, f);
}
if (!C[{i, ex}]){
p[i].push_back({f, ex});
}
}
}
//
// signed main(){
// solve();
// }| # | 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... | ||||
