oj.uz

Submission #825744

# Submission time Handle Problem Language Result Execution time Memory
825744 2023-08-15T07:37:37 Z ttamx Thousands Islands (IOI22_islands) C++17
24 / 100
 30 ms 7172 KB 
#include "islands.h"
#include<bits/stdc++.h>

using namespace std;

const int N=1e5+5;
const int M=2e5+5;

int n,m;
vector<pair<int,int>> adj[N];
vector<int> path;
bool vis[N],vis2[N];

int dfs(int u){
	if(vis2[u])return u;
	if(vis[u])return -1;
	vis[u]=vis2[u]=true;
	for(auto [v,id]:adj[u]){
		path.emplace_back(id);
		int res=dfs(v);
		if(res!=-1)return res;
		path.pop_back();
	}
	vis2[u]=false;
	return -1;
}

variant<bool, vector<int>> find_journey(int N,int M,vector<int> U,vector<int> V){
	n=N,m=M;
	for(int i=0;i<m;i+=2)adj[U[i]].emplace_back(V[i],i);
	int res=dfs(0);
	if(res==-1)return false;
	auto ans=path;
	vector<int> path2;
	stack<int> rev;
	int cur=0;
	bool ok=false;
	for(auto i:path){
		if(cur==res)ok=true;
		if(!ok){
			rev.emplace(i);
		}else{
			path2.emplace_back(i);
		}
		cur=V[i];
	}
	for(auto i:path2){
		ans.emplace_back(i+1);
	}
	reverse(path2.begin(),path2.end());
	for(auto i:path2){
		ans.emplace_back(i);
	}
	for(auto i:path2){
		ans.emplace_back(i+1);
	}
	while(!rev.empty()){
		ans.emplace_back(rev.top());
		rev.pop();
	}
	return ans;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2644 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 1 ms 2644 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 2 ms 2644 KB Output is partially correct
2 Correct 1 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Partially correct 1 ms 2644 KB Output is partially correct
5 Correct 2 ms 2772 KB Output is correct
6 Partially correct 1 ms 2644 KB Output is partially correct
7 Correct 1 ms 2644 KB Output is correct
8 Incorrect 1 ms 2644 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 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 23 ms 6440 KB Output is correct
4 Correct 25 ms 6500 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 1 ms 2644 KB Output is correct
8 Correct 1 ms 2644 KB Output is correct
9 Correct 1 ms 2644 KB Output is correct
10 Correct 2 ms 2792 KB Output is correct
11 Correct 2 ms 2772 KB Output is correct
12 Correct 3 ms 2772 KB Output is correct
13 Correct 2 ms 2772 KB Output is correct
14 Correct 3 ms 2644 KB Output is correct
15 Correct 2 ms 2772 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 1 ms 2644 KB Output is correct
18 Correct 3 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 30 ms 6916 KB Output is correct
21 Correct 24 ms 6508 KB Output is correct
22 Correct 2 ms 2772 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 1 ms 2644 KB Output is correct
25 Correct 1 ms 2644 KB Output is correct
26 Correct 3 ms 2836 KB Output is correct
27 Correct 27 ms 6844 KB Output is correct
28 Correct 26 ms 6868 KB Output is correct
29 Correct 1 ms 2644 KB Output is correct
30 Correct 27 ms 7172 KB Output is correct
31 Correct 1 ms 2644 KB Output is correct
32 Correct 25 ms 6756 KB Output is correct
33 Correct 24 ms 6732 KB Output is correct
34 Correct 14 ms 4728 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 21 ms 6168 KB Output is correct
37 Correct 25 ms 6968 KB Output is correct
38 Correct 2 ms 2620 KB Output is correct
39 Correct 22 ms 6172 KB Output is correct
40 Correct 2 ms 2644 KB Output is correct
41 Correct 28 ms 7168 KB Output is correct
42 Correct 25 ms 6844 KB Output is correct
43 Correct 1 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2772 KB Output is correct
46 Correct 14 ms 4444 KB Output is correct

Subtask #5
0.0 / 45.0

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