oj.uz

Submission #987009

# Submission time Handle Problem Language Result Execution time Memory
987009 2024-05-21T17:11:23 Z Pyqe Thousands Islands (IOI22_islands) C++17
11.9 / 100
 42 ms 12380 KB 
#include <bits/stdc++.h>
#include "islands.h"

using namespace std;

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

long long n,m,dh[100069],an[100069],cyc[100069];
vector<long long> al[100069],al2[100069];
bitset<100069> vtd,vtd2;

void dfs2(long long x)
{
	long long i,sz=al2[x].size(),l;
	
	for(i=0;i<sz;i++)
	{
		l=al2[x][i];
		dfs2(l);
	}
	an[x]=0;
	al2[x].clear();
	cyc[x]=max(cyc[x],1ll);
}

void dfs(long long x)
{
	long long i,sz=al[x].size(),l;
	
	vtd[x]=1;
	vtd2[x]=1;
	for(i=0;i<sz;i++)
	{
		l=al[x][i];
		if(!vtd[l])
		{
			dh[l]=dh[x]+1;
			dfs(l);
			if(dh[an[l]]>dh[an[x]])
			{
				an[x]=an[l];
				al2[x].clear();
			}
			if(an[l]==an[x])
			{
				al2[x].push_back(l);
			}
		}
		if(vtd2[l])
		{
			if(dh[l]>dh[an[x]])
			{
				an[x]=l;
				al2[x].clear();
			}
		}
		else
		{
			cyc[x]=min(cyc[x]+cyc[l],2ll);
		}
		if(an[x]==x)
		{
			dfs2(x);
		}
	}
	vtd2[x]=0;
}

variant<bool,vector<int>> find_journey(int on,int om,vector<int> ka,vector<int> la)
{
	long long i,k,l;
	
	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);
	}
	dh[0]=-1;
	dfs(1);
	return cyc[1]==2;
}

Subtask #1
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Partially correct 2 ms 4956 KB Output is partially correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Partially correct 2 ms 5152 KB Output is partially correct
7 Partially correct 35 ms 10692 KB Output is partially correct

Subtask #2
1.75 / 5.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 5164 KB Output is partially correct
2 Correct 2 ms 4956 KB Output is correct
3 Partially correct 2 ms 4956 KB Output is partially correct
4 Partially correct 2 ms 4956 KB Output is partially correct
5 Partially correct 2 ms 4956 KB Output is partially correct
6 Partially correct 25 ms 10612 KB Output is partially correct

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 5208 KB Output is partially correct
2 Correct 3 ms 4952 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Partially correct 2 ms 4952 KB Output is partially correct
5 Correct 3 ms 5288 KB Output is correct
6 Partially correct 4 ms 5024 KB Output is partially correct
7 Correct 3 ms 4956 KB Output is correct
8 Incorrect 2 ms 4956 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
8.4 / 24.0

# Verdict Execution time Memory Grader output
1 Partially correct 2 ms 4956 KB Output is partially correct
2 Partially correct 3 ms 5212 KB Output is partially correct
3 Partially correct 29 ms 11224 KB Output is partially correct
4 Partially correct 28 ms 11344 KB Output is partially correct
5 Partially correct 3 ms 5212 KB Output is partially correct
6 Partially correct 3 ms 5208 KB Output is partially correct
7 Partially correct 2 ms 4956 KB Output is partially correct
8 Partially correct 2 ms 4956 KB Output is partially correct
9 Partially correct 3 ms 5172 KB Output is partially correct
10 Partially correct 3 ms 5212 KB Output is partially correct
11 Correct 3 ms 5212 KB Output is correct
12 Partially correct 3 ms 5212 KB Output is partially correct
13 Partially correct 4 ms 5212 KB Output is partially correct
14 Partially correct 3 ms 5212 KB Output is partially correct
15 Partially correct 3 ms 5212 KB Output is partially correct
16 Partially correct 3 ms 5208 KB Output is partially correct
17 Correct 2 ms 4956 KB Output is correct
18 Partially correct 4 ms 5160 KB Output is partially correct
19 Partially correct 3 ms 5212 KB Output is partially correct
20 Correct 28 ms 11576 KB Output is correct
21 Partially correct 28 ms 11412 KB Output is partially correct
22 Correct 3 ms 5212 KB Output is correct
23 Correct 2 ms 4956 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Partially correct 3 ms 5212 KB Output is partially correct
26 Partially correct 4 ms 5212 KB Output is partially correct
27 Partially correct 29 ms 11856 KB Output is partially correct
28 Partially correct 29 ms 12112 KB Output is partially correct
29 Correct 2 ms 4956 KB Output is correct
30 Correct 30 ms 12380 KB Output is correct
31 Partially correct 2 ms 4956 KB Output is partially correct
32 Partially correct 29 ms 12016 KB Output is partially correct
33 Partially correct 42 ms 11032 KB Output is partially correct
34 Partially correct 16 ms 8796 KB Output is partially correct
35 Partially correct 3 ms 5364 KB Output is partially correct
36 Partially correct 24 ms 10768 KB Output is partially correct
37 Partially correct 33 ms 12012 KB Output is partially correct
38 Correct 3 ms 5212 KB Output is correct
39 Correct 24 ms 10704 KB Output is correct
40 Partially correct 3 ms 5164 KB Output is partially correct
41 Correct 32 ms 12328 KB Output is correct
42 Partially correct 28 ms 12124 KB Output is partially correct
43 Correct 2 ms 4956 KB Output is correct
44 Correct 3 ms 5304 KB Output is correct
45 Partially correct 3 ms 5212 KB Output is partially correct
46 Partially correct 14 ms 8028 KB Output is partially correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4956 KB Output is correct
2 Partially correct 2 ms 4956 KB Output is partially correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 3 ms 4952 KB Output is correct
5 Correct 2 ms 4952 KB Output is correct
6 Partially correct 2 ms 5152 KB Output is partially correct
7 Partially correct 35 ms 10692 KB Output is partially correct
8 Partially correct 2 ms 5164 KB Output is partially correct
9 Correct 2 ms 4956 KB Output is correct
10 Partially correct 2 ms 4956 KB Output is partially correct
11 Partially correct 2 ms 4956 KB Output is partially correct
12 Partially correct 2 ms 4956 KB Output is partially correct
13 Partially correct 25 ms 10612 KB Output is partially correct
14 Partially correct 3 ms 5208 KB Output is partially correct
15 Correct 3 ms 4952 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Partially correct 2 ms 4952 KB Output is partially correct
18 Correct 3 ms 5288 KB Output is correct
19 Partially correct 4 ms 5024 KB Output is partially correct
20 Correct 3 ms 4956 KB Output is correct
21 Incorrect 2 ms 4956 KB Output isn't correct
22 Halted 0 ms 0 KB -