oj.uz

답안 #955783

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
955783 2024-03-31T12:17:12 Z n1k 수천개의 섬 (IOI22_islands) C++17
19.25 / 100
 32 ms 10324 KB 
#include "islands.h"
	
#include <bits/stdc++.h>
	
using namespace std;
	
vector<vector<array<int, 2>>> g, rg;
vector<int> color, par, del, deg;
	
map<int, int> cache;
	
int dfs(int u, int p){
	par[u] = p;
	color[u] = 1;


	for(auto [v, e]:g[u]){
		if(v==p){
			deg[u]--;
		}
	}

	if(deg[u]>1)
		return 1;

	bool ok = 0;

	for(auto [v, e]:g[u]){
		if(del[v] or color[v])
			continue;
		ok |= dfs(v, u);
	}

	return ok;
}
	
std::variant<bool, std::vector<int>> find_journey(int N, int M, std::vector<int> U, std::vector<int> V) {
	g.assign(N, {});
	rg.assign(N, {});
	color.assign(N, {});
	par.assign(N, {});
	del.assign(N, {});
	deg.assign(N, {});
	
	for(int i=0; i<M; i++){
		g[U[i]].push_back({V[i], i});
		rg[V[i]].push_back({U[i], i});
	}

	queue<int> q;
	for(int i=0; i<N; i++){
		deg[i]=g[i].size();
		if(deg[i]==0){
			q.push(i);
		}
	}
	while(q.size()){
		auto u = q.front();
		q.pop();
		del[u]=1;
		for(auto [v, e]:rg[u]){
			if(--deg[v]==0){
				q.push(v);
			}
		}
	}

	return dfs(0, 0)==1;

}

Subtask #1
1.75 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Output is partially correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Partially correct 0 ms 348 KB Output is partially correct
7 Partially correct 30 ms 7616 KB Output is partially correct

Subtask #2
1.75 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Output is partially correct
2 Correct 1 ms 348 KB Output is correct
3 Partially correct 1 ms 436 KB Output is partially correct
4 Partially correct 1 ms 348 KB Output is partially correct
5 Partially correct 1 ms 348 KB Output is partially correct
6 Partially correct 30 ms 7676 KB Output is partially correct

Subtask #3
7.35 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 604 KB Output is partially correct
2 Correct 0 ms 348 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 432 KB Output is partially correct
7 Correct 1 ms 348 KB Output is 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 Partially correct 0 ms 348 KB Output is partially correct
12 Partially correct 1 ms 604 KB Output is partially correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Partially correct 0 ms 436 KB Output is partially correct
16 Correct 0 ms 348 KB Output is correct
17 Partially correct 17 ms 4956 KB Output is partially correct
18 Partially correct 14 ms 4444 KB Output is partially correct
19 Correct 1 ms 348 KB Output is correct
20 Partially correct 0 ms 348 KB Output is partially correct
21 Partially correct 0 ms 348 KB Output is partially correct
22 Partially correct 1 ms 348 KB Output is partially correct
23 Partially correct 25 ms 7508 KB Output is partially correct

Subtask #4
8.4 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 1 ms 344 KB Output is partially correct
2 Partially correct 1 ms 604 KB Output is partially correct
3 Partially correct 31 ms 7992 KB Output is partially correct
4 Partially correct 29 ms 8664 KB Output is partially correct
5 Partially correct 1 ms 600 KB Output is partially correct
6 Partially correct 1 ms 600 KB Output is partially correct
7 Partially correct 1 ms 348 KB Output is partially correct
8 Partially correct 0 ms 344 KB Output is partially correct
9 Partially correct 0 ms 596 KB Output is partially correct
10 Partially correct 1 ms 348 KB Output is partially correct
11 Correct 1 ms 604 KB Output is correct
12 Partially correct 1 ms 604 KB Output is partially correct
13 Partially correct 1 ms 604 KB Output is partially correct
14 Partially correct 1 ms 604 KB Output is partially correct
15 Partially correct 1 ms 604 KB Output is partially correct
16 Partially correct 1 ms 344 KB Output is partially correct
17 Correct 0 ms 348 KB Output is correct
18 Partially correct 1 ms 604 KB Output is partially correct
19 Partially correct 1 ms 348 KB Output is partially correct
20 Correct 30 ms 9040 KB Output is correct
21 Partially correct 28 ms 9044 KB Output is partially correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Partially correct 1 ms 348 KB Output is partially correct
26 Partially correct 1 ms 600 KB Output is partially correct
27 Partially correct 31 ms 9208 KB Output is partially correct
28 Partially correct 30 ms 9300 KB Output is partially correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 32 ms 10324 KB Output is correct
31 Partially correct 0 ms 344 KB Output is partially correct
32 Partially correct 29 ms 9132 KB Output is partially correct
33 Partially correct 28 ms 8564 KB Output is partially correct
34 Partially correct 16 ms 4952 KB Output is partially correct
35 Partially correct 1 ms 600 KB Output is partially correct
36 Partially correct 28 ms 8124 KB Output is partially correct
37 Partially correct 31 ms 10088 KB Output is partially correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 24 ms 8024 KB Output is correct
40 Partially correct 1 ms 348 KB Output is partially correct
41 Correct 31 ms 10308 KB Output is correct
42 Partially correct 30 ms 9248 KB Output is partially correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Partially correct 1 ms 604 KB Output is partially correct
46 Partially correct 13 ms 4500 KB Output is partially correct

Subtask #5
0.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Partially correct 0 ms 348 KB Output is partially correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Partially correct 0 ms 348 KB Output is partially correct
7 Partially correct 30 ms 7616 KB Output is partially correct
8 Partially correct 1 ms 344 KB Output is partially correct
9 Correct 1 ms 348 KB Output is correct
10 Partially correct 1 ms 436 KB Output is partially correct
11 Partially correct 1 ms 348 KB Output is partially correct
12 Partially correct 1 ms 348 KB Output is partially correct
13 Partially correct 30 ms 7676 KB Output is partially correct
14 Partially correct 1 ms 604 KB Output is partially correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Partially correct 0 ms 348 KB Output is partially correct
18 Correct 1 ms 604 KB Output is correct
19 Partially correct 0 ms 432 KB Output is partially correct
20 Correct 1 ms 348 KB Output is correct
21 Partially correct 0 ms 348 KB Output is partially correct
22 Partially correct 0 ms 348 KB Output is partially correct
23 Partially correct 1 ms 604 KB Output is partially correct
24 Partially correct 0 ms 348 KB Output is partially correct
25 Partially correct 1 ms 604 KB Output is partially correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Partially correct 0 ms 436 KB Output is partially correct
29 Correct 0 ms 348 KB Output is correct
30 Partially correct 17 ms 4956 KB Output is partially correct
31 Partially correct 14 ms 4444 KB Output is partially correct
32 Correct 1 ms 348 KB Output is correct
33 Partially correct 0 ms 348 KB Output is partially correct
34 Partially correct 0 ms 348 KB Output is partially correct
35 Partially correct 1 ms 348 KB Output is partially correct
36 Partially correct 25 ms 7508 KB Output is partially correct
37 Partially correct 1 ms 348 KB Output is partially correct
38 Correct 0 ms 348 KB Output is correct
39 Incorrect 0 ms 436 KB Output isn't correct
40 Halted 0 ms 0 KB -