# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1190087 | alexdd | Split the Attractions (IOI19_split) | C++20 | 2 ms | 4928 KiB |
#include "split.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> con[200005];
int cntv;
vector<int> visited;
void dfs(int nod, int b)
{
if(cntv==b)
return;
visited[nod] = 2;
cntv++;
for(int adj:con[nod])
if(!visited[adj])
dfs(adj,b);
}
std::vector<int> find_split(int n, int a, int b, int c, std::vector<int> p, std::vector<int> q)
{
visited.resize(n,0);
for(int i=0;i<p.size();i++)
{
con[p[i]].push_back(q[i]);
con[q[i]].push_back(p[i]);
}
dfs(0,b);
for(int i=0;i<n;i++)
{
if(visited[i]==0)
{
visited[i]=1;
break;
}
}
}
컴파일 시 표준 에러 (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... |