# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1211620 | serkanrashid | 수천개의 섬 (IOI22_islands) | C++20 | 18 ms | 5824 KiB |
#include "islands.h"
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
const int MAXN = 2e5+5;
int n,m,u[MAXN],v[MAXN];
int idx,ans[MAXN];
void solve1()
{
vector<int>br0,br1;
for(int i = 0; i < m; i++)
{
if(u[i] == 0) br0.push_back(i);
else br1.push_back(i);
}
if((int)br0.size() >= 2 && (int)br1.size() >= 1)
{
int u1 = br0[0];
int u2 = br0[1];
int v = br1[0];
ans[idx] = u1;
ans[idx+1] = v;
ans[idx+2] = u2;
ans[idx+3] = u1;
ans[idx+4] = v;
ans[idx+5] = u2;
idx += 6;
}
}
variant <bool, vector<int> > find_journey(int N, int M, vector<int> U, vector<int> V)
{
n = N;
m = M;
for(int i = 0; i < M; i++)
{
u[i] = U[i];
v[i] = V[i];
}
if(n == 2)
{
solve1();
vector<int>res;
res.resize(idx);
for(int i = 0; i < idx; i++) res[i] = ans[i];
return res;
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |