oj.uz

Submission #954929

# Submission time Handle Problem Language Result Execution time Memory
954929 2024-03-28T20:24:42 Z n1k Thousands Islands (IOI22_islands) C++17
10.15 / 100
 112 ms 14680 KB 
#include "islands.h"

#include <bits/stdc++.h>

using namespace std;

vector<vector<array<int, 2>>> g;
vector<map<int, int>> connected;
vector<int> color, par, nett;

int x, y;

bool dfs(int u, int p){
	par[u] = p;

	if(color[u]==2) return false;

	color[u] = 1;

	if(nett[u]){
		return true;
	}

	for(auto [v, e]:g[u]){
		if(v==p)
			continue;
		if(color[v]==1){
			x = v;
			y = u;
			return true;
		}
		if(dfs(v, u)){
			return true;
		}
	}

	color[u] = 2;

	return false;
}

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

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

		connected[U[i]][V[i]]++;

		if(connected[U[i]][V[i]]>=2 and connected[V[i]][U[i]]>=1){
			nett[U[i]]=1;
		}
		if(connected[U[i]][V[i]]>=1 and connected[V[i]][U[i]]>=2){
			nett[V[i]]=1;
		}
	}

	return dfs(0, -1);
}

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 348 KB Output is correct
3 Partially correct 1 ms 348 KB Output is partially correct
4 Partially correct 0 ms 348 KB Output is partially correct
5 Partially correct 0 ms 348 KB Output is partially correct
6 Partially correct 92 ms 11924 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 1 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Partially correct 0 ms 348 KB Output is partially correct
5 Correct 1 ms 604 KB Output is correct
6 Partially correct 0 ms 344 KB Output is partially correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 0 ms 344 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 0 ms 348 KB Output is partially correct
2 Partially correct 2 ms 604 KB Output is partially correct
3 Partially correct 60 ms 3680 KB Output is partially correct
4 Partially correct 84 ms 11596 KB Output is partially correct
5 Partially correct 2 ms 804 KB Output is partially correct
6 Partially correct 2 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 600 KB Output is correct
12 Partially correct 2 ms 604 KB Output is partially correct
13 Partially correct 2 ms 860 KB Output is partially correct
14 Partially correct 2 ms 604 KB Output is partially correct
15 Partially correct 3 ms 860 KB Output is partially correct
16 Partially correct 1 ms 604 KB Output is partially correct
17 Correct 1 ms 432 KB Output is correct
18 Partially correct 1 ms 604 KB Output is partially correct
19 Partially correct 1 ms 856 KB Output is partially correct
20 Correct 69 ms 5032 KB Output is correct
21 Partially correct 104 ms 13128 KB Output is partially correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Partially correct 1 ms 344 KB Output is partially correct
26 Partially correct 1 ms 600 KB Output is partially correct
27 Partially correct 91 ms 10364 KB Output is partially correct
28 Partially correct 112 ms 11196 KB Output is partially correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 107 ms 14676 KB Output is correct
31 Partially correct 0 ms 344 KB Output is partially correct
32 Partially correct 91 ms 11860 KB Output is partially correct
33 Partially correct 69 ms 5000 KB Output is partially correct
34 Partially correct 49 ms 7768 KB Output is partially correct
35 Partially correct 1 ms 348 KB Output is partially correct
36 Partially correct 82 ms 10832 KB Output is partially correct
37 Partially correct 109 ms 13880 KB Output is partially correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 81 ms 9940 KB Output is correct
40 Partially correct 1 ms 604 KB Output is partially correct
41 Correct 112 ms 14680 KB Output is correct
42 Partially correct 95 ms 11604 KB Output is partially correct
43 Correct 0 ms 344 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Partially correct 1 ms 604 KB Output is partially correct
46 Partially correct 40 ms 6516 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 -