Submission #955724

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
955724	2024-03-31T11:18:42 Z	n1k	Thousands Islands (IOI22_islands)	C++17	10.15 / 100	49 ms	7772 KB

islands

#include "islands.h"

#include <bits/stdc++.h>

using namespace std;

vector<vector<array<int, 2>>> g;
vector<int> color, par;

map<int, int> cache;

int x, y;

int dfs(int u, int p){
	if(cache.count(u))
		return cache[u];

	par[u] = p;
	color[u]= 1;

	int count = 0;
	for(auto [v, e]:g[u]){
		if(color[v]==1){
			count++;
		}else{
			count += dfs(v, u);
		}
	}

	color[u] = 2;

	return cache[u] = min(2, count);
}

std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
	g.assign(N, {});
	color.assign(N, {});
	par.assign(N, {});

	for(int i=0; i<M; i++){
		g[U[i]].push_back({V[i], i});
	}

	return dfs(0, -1) >= 2;
}

Subtask #1

0.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #2

1.75 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	0 ms	348 KB	Output is partially correct
2	Correct	0 ms	424 KB	Output is correct
3	Partially correct	0 ms	348 KB	Output is partially correct
4	Partially correct	1 ms	344 KB	Output is partially correct
5	Partially correct	1 ms	348 KB	Output is partially correct
6	Partially correct	29 ms	5908 KB	Output is partially correct

Subtask #3

0.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	2 ms	600 KB	Output is partially correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	1 ms	344 KB	Output is correct
4	Partially correct	0 ms	348 KB	Output is partially correct
5	Incorrect	1 ms	604 KB	Output isn't correct
6	Halted	0 ms	0 KB	-

Subtask #4

8.4 / 24.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	1 ms	348 KB	Output is partially correct
2	Partially correct	1 ms	348 KB	Output is partially correct
3	Partially correct	27 ms	6196 KB	Output is partially correct
4	Partially correct	33 ms	6748 KB	Output is partially correct
5	Partially correct	2 ms	604 KB	Output is partially correct
6	Partially correct	1 ms	604 KB	Output is partially correct
7	Partially correct	0 ms	344 KB	Output is partially correct
8	Partially correct	0 ms	348 KB	Output is partially correct
9	Partially correct	0 ms	348 KB	Output is partially correct
10	Partially correct	1 ms	604 KB	Output is partially correct
11	Correct	2 ms	604 KB	Output is correct
12	Partially correct	2 ms	604 KB	Output is partially correct
13	Partially correct	2 ms	604 KB	Output is partially correct
14	Partially correct	2 ms	496 KB	Output is partially correct
15	Partially correct	2 ms	604 KB	Output is partially correct
16	Partially correct	1 ms	604 KB	Output is partially correct
17	Correct	1 ms	344 KB	Output is correct
18	Partially correct	1 ms	604 KB	Output is partially correct
19	Partially correct	1 ms	344 KB	Output is partially correct
20	Correct	34 ms	6744 KB	Output is correct
21	Partially correct	34 ms	6480 KB	Output is partially correct
22	Correct	1 ms	604 KB	Output is correct
23	Correct	0 ms	348 KB	Output is correct
24	Correct	1 ms	344 KB	Output is correct
25	Partially correct	1 ms	348 KB	Output is partially correct
26	Partially correct	1 ms	444 KB	Output is partially correct
27	Partially correct	34 ms	7232 KB	Output is partially correct
28	Partially correct	34 ms	7404 KB	Output is partially correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	49 ms	7628 KB	Output is correct
31	Partially correct	1 ms	348 KB	Output is partially correct
32	Partially correct	35 ms	7312 KB	Output is partially correct
33	Partially correct	33 ms	6488 KB	Output is partially correct
34	Partially correct	20 ms	3928 KB	Output is partially correct
35	Partially correct	1 ms	348 KB	Output is partially correct
36	Partially correct	29 ms	6040 KB	Output is partially correct
37	Partially correct	45 ms	7260 KB	Output is partially correct
38	Correct	1 ms	348 KB	Output is correct
39	Correct	37 ms	6108 KB	Output is correct
40	Partially correct	1 ms	604 KB	Output is partially correct
41	Correct	46 ms	7772 KB	Output is correct
42	Partially correct	35 ms	7248 KB	Output is partially correct
43	Correct	0 ms	348 KB	Output is correct
44	Correct	2 ms	640 KB	Output is correct
45	Partially correct	2 ms	604 KB	Output is partially correct
46	Partially correct	16 ms	3420 KB	Output is partially correct

Subtask #5

0.0 / 45.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-