oj.uz

Submission #736419

# Submission time Handle Problem Language Result Execution time Memory
736419 2023-05-05T15:23:40 Z jk410 Thousands Islands (IOI22_islands) C++17
24 / 100
 45 ms 8268 KB 
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
int n;
int edge[1000][1000];
int visited[1000];
int par[1000];
pair<int,int> dfs(int v) {
	visited[v] = 1;
	for (int i = 0; i < n; i++) {
		if (edge[v][i] == -1 || visited[i] == 2)
			continue;
		if (visited[i] == 1)
			return { v,i };
		par[i] = v;
		pair<int,int> tmp = dfs(i);
		if (tmp.first != -1)
			return tmp;
	}
	visited[v] = 2;
	return { -1,-1 };
}
variant<bool, vector<int>> find_journey(int _n, int m, vector<int> u, vector<int> v) {
	n = _n;
	memset(edge, -1, sizeof(edge));
	for (int i = 0; i < m; i += 2)
		edge[u[i]][v[i]] = i;
	pair<int,int> x = dfs(0);
	if (x.first == -1)
		return false;
	vector<int> cyc;
	cyc.push_back(x.second);
	for (int i = x.first;; i = par[i]) {
		cyc.push_back(i);
		if (i == x.second)
			break;
	}
	vector<int> p;
	for (int i = x.second;; i = par[i]) {
		p.push_back(i);
		if (!i)
			break;
	}
	vector<int> ret;
	for (int i = (int)p.size() - 1; i; i--)
		ret.push_back(edge[p[i]][p[i - 1]]);
	for (int i = (int)cyc.size() - 1; i; i--)
		ret.push_back(edge[cyc[i]][cyc[i - 1]]);
	for (int i = (int)cyc.size() - 1; i; i--)
		ret.push_back(edge[cyc[i]][cyc[i - 1]] + 1);
	for (int i = 1; i < (int)cyc.size(); i++)
		ret.push_back(edge[cyc[i]][cyc[i - 1]]);
	for (int i = 1; i < (int)cyc.size(); i++)
		ret.push_back(edge[cyc[i]][cyc[i - 1]] + 1);
	for (int i = 1; i < (int)p.size(); i++)
		ret.push_back(edge[p[i]][p[i - 1]]);
	return ret;
}

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 5.0

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

Subtask #3
0.0 / 21.0

# Verdict Execution time Memory Grader output
1 Partially correct 3 ms 4276 KB Output is partially correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 2 ms 4156 KB Output is correct
4 Partially correct 2 ms 4180 KB Output is partially correct
5 Correct 3 ms 4328 KB Output is correct
6 Partially correct 2 ms 4180 KB Output is partially correct
7 Correct 2 ms 4180 KB Output is correct
8 Incorrect 3 ms 4180 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4180 KB Output is correct
2 Correct 2 ms 4180 KB Output is correct
3 Correct 33 ms 7968 KB Output is correct
4 Correct 34 ms 8268 KB Output is correct
5 Correct 3 ms 4308 KB Output is correct
6 Correct 3 ms 4308 KB Output is correct
7 Correct 2 ms 4180 KB Output is correct
8 Correct 2 ms 4180 KB Output is correct
9 Correct 2 ms 4180 KB Output is correct
10 Correct 3 ms 4308 KB Output is correct
11 Correct 3 ms 4308 KB Output is correct
12 Correct 4 ms 4336 KB Output is correct
13 Correct 3 ms 4400 KB Output is correct
14 Correct 3 ms 4308 KB Output is correct
15 Correct 3 ms 4320 KB Output is correct
16 Correct 3 ms 4180 KB Output is correct
17 Correct 2 ms 4180 KB Output is correct
18 Correct 2 ms 4308 KB Output is correct
19 Correct 2 ms 4160 KB Output is correct
20 Correct 34 ms 8140 KB Output is correct
21 Correct 34 ms 7928 KB Output is correct
22 Correct 3 ms 4312 KB Output is correct
23 Correct 2 ms 4180 KB Output is correct
24 Correct 2 ms 4180 KB Output is correct
25 Correct 3 ms 4156 KB Output is correct
26 Correct 3 ms 4308 KB Output is correct
27 Correct 37 ms 7956 KB Output is correct
28 Correct 38 ms 7956 KB Output is correct
29 Correct 2 ms 4180 KB Output is correct
30 Correct 45 ms 8140 KB Output is correct
31 Correct 2 ms 4180 KB Output is correct
32 Correct 36 ms 7892 KB Output is correct
33 Correct 33 ms 7992 KB Output is correct
34 Correct 19 ms 6472 KB Output is correct
35 Correct 3 ms 4216 KB Output is correct
36 Correct 31 ms 7244 KB Output is correct
37 Correct 34 ms 7372 KB Output is correct
38 Correct 3 ms 4172 KB Output is correct
39 Correct 29 ms 6796 KB Output is correct
40 Correct 3 ms 4180 KB Output is correct
41 Correct 34 ms 7264 KB Output is correct
42 Correct 33 ms 7176 KB Output is correct
43 Correct 2 ms 4180 KB Output is correct
44 Correct 4 ms 4180 KB Output is correct
45 Correct 3 ms 4308 KB Output is correct
46 Correct 15 ms 5432 KB Output is correct

Subtask #5
0.0 / 45.0

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