oj.uz

답안 #987081

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
987081 2024-05-21T20:18:23 Z Pyqe 수천개의 섬 (IOI22_islands) C++17
31 / 100
 66 ms 56080 KB 
#include <bits/stdc++.h>
#include "islands.h"

using namespace std;

#define mp make_pair
#define fr first
#define sc second

const long long inf=1e18;
long long n,m,nn=0,nn2[2],nn3[2],cnn,dh[100069],an[100069],cyc[100069],ex[100069],ex2[2][100069],ex3[2][100069],cex[100069];
vector<pair<long long,long long>> al[100069],nx[100069],nx2[100069];
vector<long long> vl[100069];
bitset<100069> vtd,vtd2;
pair<long long,long long> pr[100069];
bitset<200069> spc[2];

void dfs(long long x)
{
	long long i,j,sz=al[x].size(),sz2,k,l,p;
	
	vtd[x]=1;
	vtd2[x]=1;
	for(i=0;i<sz;i++)
	{
		l=al[x][i].fr;
		p=al[x][i].sc;
		if(!vtd[l])
		{
			dh[l]=dh[x]+1;
			pr[l]={x,p};
			dfs(l);
		}
		if(vtd2[l])
		{
			if(dh[l]>dh[an[x]]&&!cyc[x])
			{
				an[x]=l;
				nx[x]={{l,p}};
			}
		}
		else
		{
			cyc[x]=min(cyc[x]+cyc[l],2ll);
			if(cyc[l])
			{
				nx2[x].push_back({l,p});
			}
			if(vl[x].empty())
			{
				if(dh[an[l]]>dh[an[x]]&&!cyc[x])
				{
					an[x]=an[l];
					nx[x]={{l,p}};
				}
			}
			else
			{
				if(!cyc[l])
				{
					if(!cyc[x])
					{
						nx[x].clear();
					}
					cyc[x]=min(cyc[x]+1,2ll);
					nx[x].push_back({l,p});
				}
				sz2=vl[x].size();
				for(j=0;j<sz2;j++)
				{
					k=vl[x][j];
					cyc[k]=max(cyc[k],1ll);
				}
				vl[x].clear();
			}
		}
	}
	vtd2[x]=0;
	if(vtd2[an[x]])
	{
		vl[an[x]].push_back(x);
	}
}

variant<bool,vector<int>> find_journey(int on,int om,vector<int> ka,vector<int> la)
{
	long long i,ii,k,l,p,sz,e,kk,ll,rt=0;
	pair<long long,long long> mne={inf,-1};
	vector<int> sq;
	
	n=on;
	m=om;
	for(i=1;i<=m;i++)
	{
		k=ka[i-1]+1;
		l=la[i-1]+1;
		al[k].push_back({l,i});
	}
	dh[0]=-1;
	dfs(1);
	if(cyc[1]!=2)
	{
		return false;
	}
	for(i=1;i<=n;i++)
	{
		if(cyc[i]==2&&dh[i]>dh[rt])
		{
			rt=i;
		}
	}
	for(k=rt;k!=1;k=pr[k].fr)
	{
		p=pr[k].sc;
		nn++;
		ex[nn]=p;
	}
	reverse(ex+1,ex+nn+1);
	for(ii=0;ii<2;ii++)
	{
		for(k=rt;!nx2[k].empty();k=l)
		{
			l=nx2[k].back().fr;
			p=nx2[k].back().sc;
			nx2[k].pop_back();
			nn2[ii]++;
			ex2[ii][nn2[ii]]=p;
		}
		kk=k;
		for(;1;k=l)
		{
			l=nx[k][0].fr;
			p=nx[k][0].sc;
			nn3[ii]++;
			ex3[ii][nn3[ii]]=p;
			if(dh[l]<dh[k])
			{
				break;
			}
		}
		ll=l;
		cnn=0;
		for(k=kk;k!=ll;k=pr[k].fr)
		{
			p=pr[k].sc;
			cnn++;
			cex[cnn]=p;
		}
		reverse(cex+1,cex+cnn+1);
		for(i=1;i<=cnn;i++)
		{
			nn3[ii]++;
			ex3[ii][nn3[ii]]=cex[i];
		}
		for(i=1;i<=n;i++)
		{
			reverse(nx[i].begin(),nx[i].end());
		}
		mne=min(mne,{dh[ll],ii});
	}
	for(ii=0;ii<2;ii++)
	{
		for(i=1;i<=nn3[ii];i++)
		{
			k=ex3[ii][i];
			spc[ii][k]=1;
		}
	}
	for(i=1;i<=nn3[1];i++)
	{
		k=ex3[1][i];
		if(!spc[0][k])
		{
			break;
		}
	}
	if(nn3[0]==nn3[1]&&i>nn3[0])
	{
		for(i=1;i<=nn;i++)
		{
			sq.push_back(ex[i]);
		}
		for(i=1;i<=nn2[0];i++)
		{
			sq.push_back(ex2[0][i]);
		}
		for(i=1;i<=nn3[0];i++)
		{
			sq.push_back(ex3[0][i]);
		}
		for(i=nn2[0];i;i--)
		{
			sq.push_back(ex2[0][i]);
		}
		for(i=1;i<=nn2[1];i++)
		{
			sq.push_back(ex2[1][i]);
		}
		for(i=nn3[1];i;i--)
		{
			sq.push_back(ex3[1][i]);
		}
		for(i=nn2[1];i;i--)
		{
			sq.push_back(ex2[1][i]);
		}
		for(i=nn;i;i--)
		{
			sq.push_back(ex[i]);
		}
	}
	else
	{
		for(i=1;i<=nn3[1];i++)
		{
			k=ex3[1][i];
			if(spc[0][k])
			{
				break;
			}
		}
		if(i<=nn3[1])
		{
			return true;
			e=mne.sc;
			for(i=1;i<=nn;i++)
			{
				sq.push_back(ex[i]);
			}
			for(i=1;i<=nn2[!e];i++)
			{
				sq.push_back(ex2[!e][i]);
			}
			for(i=1;i<=nn3[!e];i++)
			{
				sq.push_back(ex3[!e][i]);
			}
			for(i=nn2[!e];i;i--)
			{
				sq.push_back(ex2[!e][i]);
			}
			for(i=1;i<=nn2[e];i++)
			{
				sq.push_back(ex2[e][i]);
			}
			for(i=1;i<=nn3[e];i++)
			{
				k=ex3[e][i];
				if(spc[!e][k])
				{
					break;
				}
				sq.push_back(k);
			}
			kk=i;
			for(i=1;ex3[!e][i]!=k;i++);
			for(i=(i+nn3[!e]-2)%nn3[!e]+1;1;i=(i+nn3[!e]-2)%nn3[!e]+1)
			{
				k=ex3[!e][i];
				if(spc[e][k])
				{
					break;
				}
				sq.push_back(k);
			}
			for(i=kk;i<=nn3[e];i++)
			{
				k=ex3[e][i];
				if(!spc[!e][k])
				{
					sq.push_back(k);
				}
			}
			for(i=nn2[e];i;i--)
			{
				sq.push_back(ex2[e][i]);
			}
			for(i=1;i<=nn2[!e];i++)
			{
				k=ex2[!e][i];
				if(spc[e][k])
				{
					break;
				}
				sq.push_back(k);
			}
			if(i<=nn2[!e])
			{
				kk=k;
			}
			else
			{
				kk=ex3[!e][1];
			}
			for(i=1;ex3[e][i]!=kk;i++);
			for(i=(i+nn3[e]-2)%nn3[e]+1;1;i=(i+nn3[e]-2)%nn3[e]+1)
			{
				k=ex3[e][i];
				sq.push_back(k);
				if(k==kk)
				{
					break;
				}
			}
			for(i=nn2[!e];i;i--)
			{
				k=ex2[!e][i];
				if(!spc[e][k])
				{
					sq.push_back(k);
				}
			}
			for(i=nn;i;i--)
			{
				sq.push_back(ex[i]);
			}
		}
		else
		{
			for(i=1;i<=nn;i++)
			{
				sq.push_back(ex[i]);
			}
			for(i=1;i<=nn2[0];i++)
			{
				sq.push_back(ex2[0][i]);
			}
			for(i=1;i<=nn3[0];i++)
			{
				sq.push_back(ex3[0][i]);
			}
			for(i=nn2[0];i;i--)
			{
				sq.push_back(ex2[0][i]);
			}
			for(i=1;i<=nn2[1];i++)
			{
				sq.push_back(ex2[1][i]);
			}
			for(i=1;i<=nn3[1];i++)
			{
				sq.push_back(ex3[1][i]);
			}
			for(i=nn2[1];i;i--)
			{
				sq.push_back(ex2[1][i]);
			}
			for(i=1;i<=nn2[0];i++)
			{
				sq.push_back(ex2[0][i]);
			}
			for(i=nn3[0];i;i--)
			{
				sq.push_back(ex3[0][i]);
			}
			for(i=nn2[0];i;i--)
			{
				sq.push_back(ex2[0][i]);
			}
			for(i=1;i<=nn2[1];i++)
			{
				sq.push_back(ex2[1][i]);
			}
			for(i=nn3[1];i;i--)
			{
				sq.push_back(ex3[1][i]);
			}
			for(i=nn2[1];i;i--)
			{
				sq.push_back(ex2[1][i]);
			}
			for(i=nn;i;i--)
			{
				sq.push_back(ex[i]);
			}
		}
	}
	sz=sq.size();
	for(i=0;i<sz;i++)
	{
		sq[i]--;
	}
	return sq;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 12636 KB Output is correct
2 Correct 4 ms 14684 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 4 ms 12748 KB Output is correct
5 Correct 4 ms 12636 KB Output is correct
6 Correct 4 ms 14684 KB Output is correct
7 Correct 36 ms 22652 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 14680 KB Output is correct
2 Correct 4 ms 12632 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 5 ms 14684 KB Output is correct
5 Correct 3 ms 14684 KB Output is correct
6 Correct 34 ms 22364 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 15196 KB Output is correct
2 Correct 4 ms 12636 KB Output is correct
3 Correct 4 ms 12636 KB Output is correct
4 Correct 4 ms 14684 KB Output is correct
5 Correct 4 ms 12888 KB Output is correct
6 Correct 4 ms 14684 KB Output is correct
7 Correct 4 ms 12636 KB Output is correct
8 Correct 3 ms 14684 KB Output is correct
9 Correct 6 ms 14936 KB Output is correct
10 Correct 5 ms 15196 KB Output is correct
11 Correct 4 ms 14684 KB Output is correct
12 Correct 5 ms 15196 KB Output is correct
13 Correct 3 ms 12636 KB Output is correct
14 Correct 4 ms 12632 KB Output is correct
15 Correct 4 ms 14684 KB Output is correct
16 Correct 4 ms 12636 KB Output is correct
17 Correct 23 ms 19796 KB Output is correct
18 Correct 18 ms 19292 KB Output is correct
19 Correct 4 ms 12636 KB Output is correct
20 Correct 5 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 5 ms 14684 KB Output is correct
23 Correct 33 ms 22364 KB Output is correct

Subtask #4
0.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 5 ms 14940 KB Output is correct
3 Correct 33 ms 21340 KB Output is correct
4 Correct 34 ms 21844 KB Output is correct
5 Correct 5 ms 14936 KB Output is correct
6 Correct 4 ms 14936 KB Output is correct
7 Correct 5 ms 14680 KB Output is correct
8 Correct 4 ms 14684 KB Output is correct
9 Correct 4 ms 14684 KB Output is correct
10 Correct 4 ms 14940 KB Output is correct
11 Correct 5 ms 12988 KB Output is correct
12 Correct 5 ms 14940 KB Output is correct
13 Correct 5 ms 15192 KB Output is correct
14 Correct 5 ms 14940 KB Output is correct
15 Correct 5 ms 15044 KB Output is correct
16 Correct 4 ms 14940 KB Output is correct
17 Correct 4 ms 12740 KB Output is correct
18 Correct 5 ms 14940 KB Output is correct
19 Correct 4 ms 14940 KB Output is correct
20 Correct 33 ms 20092 KB Output is correct
21 Correct 32 ms 21580 KB Output is correct
22 Correct 5 ms 12888 KB Output is correct
23 Correct 3 ms 12636 KB Output is correct
24 Correct 2 ms 12636 KB Output is correct
25 Correct 3 ms 14684 KB Output is correct
26 Correct 5 ms 14940 KB Output is correct
27 Correct 37 ms 22620 KB Output is correct
28 Correct 37 ms 22612 KB Output is correct
29 Correct 5 ms 12880 KB Output is correct
30 Correct 38 ms 21076 KB Output is correct
31 Correct 4 ms 14680 KB Output is correct
32 Correct 35 ms 22604 KB Output is correct
33 Correct 34 ms 21840 KB Output is correct
34 Correct 21 ms 19804 KB Output is correct
35 Correct 3 ms 14940 KB Output is correct
36 Correct 32 ms 21328 KB Output is correct
37 Runtime error 66 ms 56080 KB Execution killed with signal 11
38 Halted 0 ms 0 KB -

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 12636 KB Output is correct
2 Correct 4 ms 14684 KB Output is correct
3 Correct 3 ms 12636 KB Output is correct
4 Correct 4 ms 12748 KB Output is correct
5 Correct 4 ms 12636 KB Output is correct
6 Correct 4 ms 14684 KB Output is correct
7 Correct 36 ms 22652 KB Output is correct
8 Correct 4 ms 14680 KB Output is correct
9 Correct 4 ms 12632 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 5 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 34 ms 22364 KB Output is correct
14 Correct 5 ms 15196 KB Output is correct
15 Correct 4 ms 12636 KB Output is correct
16 Correct 4 ms 12636 KB Output is correct
17 Correct 4 ms 14684 KB Output is correct
18 Correct 4 ms 12888 KB Output is correct
19 Correct 4 ms 14684 KB Output is correct
20 Correct 4 ms 12636 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 6 ms 14936 KB Output is correct
23 Correct 5 ms 15196 KB Output is correct
24 Correct 4 ms 14684 KB Output is correct
25 Correct 5 ms 15196 KB Output is correct
26 Correct 3 ms 12636 KB Output is correct
27 Correct 4 ms 12632 KB Output is correct
28 Correct 4 ms 14684 KB Output is correct
29 Correct 4 ms 12636 KB Output is correct
30 Correct 23 ms 19796 KB Output is correct
31 Correct 18 ms 19292 KB Output is correct
32 Correct 4 ms 12636 KB Output is correct
33 Correct 5 ms 14684 KB Output is correct
34 Correct 3 ms 14684 KB Output is correct
35 Correct 5 ms 14684 KB Output is correct
36 Correct 33 ms 22364 KB Output is correct
37 Correct 4 ms 14680 KB Output is correct
38 Correct 3 ms 12636 KB Output is correct
39 Correct 3 ms 12636 KB Output is correct
40 Correct 4 ms 12636 KB Output is correct
41 Correct 18 ms 16032 KB Output is correct
42 Correct 5 ms 12892 KB Output is correct
43 Correct 37 ms 26712 KB Output is correct
44 Correct 35 ms 23760 KB Output is correct
45 Correct 38 ms 29096 KB Output is correct
46 Correct 4 ms 14680 KB Output is correct
47 Correct 3 ms 14684 KB Output is correct
48 Correct 3 ms 14684 KB Output is correct
49 Runtime error 15 ms 30140 KB Execution killed with signal 11
50 Halted 0 ms 0 KB -