oj.uz

Submission #830772

# Submission time Handle Problem Language Result Execution time Memory
830772 2023-08-19T10:20:08 Z FatihSolak Thousands Islands (IOI22_islands) C++17
55 / 100
 137 ms 27392 KB 
#include "islands.h"
#include <bits/stdc++.h>
#define N 100005
using namespace std;
vector<pair<int,pair<int,int>>> adj[N];
map<int,vector<int>> mp[N];
int par[N];
int par2[N];
int vis[N];
vector<int> ans;
void dfs(int v,int pr){
	vis[v] = 1;
	vector<pair<int,pair<int,int>>> tmp;
	for(auto u:adj[v]){
		if(ans.size())
			return;
		if(u.second.second == pr)
			continue;
		if(vis[u.first] == 2)
			continue;
		tmp.push_back(u);
	}
	if(tmp.size() > 1){
		int now = v;
		while(now != 0){
			ans.push_back(par[now]);
			now = par2[now];
		}
		reverse(ans.begin(),ans.end());
		ans.push_back(tmp[0].second.first);
		ans.push_back(tmp[0].second.second);
		ans.push_back(tmp[1].second.first);
		ans.push_back(tmp[1].second.second);
		ans.push_back(tmp[0].second.second);
		ans.push_back(tmp[0].second.first);
		ans.push_back(tmp[1].second.second);
		ans.push_back(tmp[1].second.first);
		now = v;
		while(now != 0){
			ans.push_back(par[now]);
			now = par2[now];
		}
		return;
	}
	else{
		for(auto u:adj[v]){
			if(ans.size())
				return;
			if(vis[u.first])
				continue;
			par[u.first] = u.second.first;
			par2[u.first] = v;
			dfs(u.first,u.second.first);
		}
	}
	vis[v] = 2;
}
void dfs2(int v,int pr){
	vis[v] = 1;
    // cout << v << ' ' << par2[v] << endl; 
	vector<pair<int,pair<int,int>>> tmp;
	for(auto u:adj[v]){
		if(ans.size())
			return;
		if(vis[u.first] == 2){
			continue;
		}
		if(vis[u.first] == 1){
            if(ans.size())
                return;
            // cout << u.first << "ASDa" << v << endl;
            int now = u.first;
            while(now != 0){
                ans.push_back(par[now]);
                now = par2[now];
            }
            reverse(ans.begin(),ans.end());
            vector<int> v1 = {},v2 = {};
            now = v;
            int cnt = 0;
            int sz = 1;
            while(now != u.first){
                assert(cnt++ <= 1000);
                v1.push_back(par[now]);
                v2.push_back(par[now] + 1);
                sz++;
                // cout << now << endl;
                now = par2[now];
            }
            reverse(v1.begin(),v1.end());
            reverse(v2.begin(),v2.end());
            v1.push_back(u.second.first);
            v2.push_back(u.second.first + 1);
            assert(sz >= 2);
            for(auto c:v1){
                ans.push_back(c);
            }
            for(auto c:v2){
                ans.push_back(c);
            }
            reverse(v1.begin(),v1.end());
            reverse(v2.begin(),v2.end());
            for(auto c:v1){
                ans.push_back(c);
            }
            for(auto c:v2){
                ans.push_back(c);
            }
            now = u.first;
            while(now != 0){
                ans.push_back(par[now]);
                now = par2[now];
            }
			return;
        }
		par[u.first] = u.second.first;
		par2[u.first] = v;
		dfs2(u.first,u.second.first);
	}
	vis[v] = 2;
}
variant<bool, vector<int>> find_journey(int n, int m, vector<int> U, vector<int> V){
	if(n == 2){
		for(int i = 0;i<m;i++){
			mp[U[i]][V[i]].push_back(i);
		}
		if(mp[0][1].size() < 2 || mp[1][0].size() < 1)
			return false;
		int a = mp[0][1][0];
		int b = mp[0][1][1];
		int c = mp[1][0][0];
		ans = {a,c,b,a,c,b};
		return ans;
	}
	bool subtask4 = (m + 1)%2;
	for(int i = 0;i<m && subtask4;i+=2){
		if(U[i] != U[i+1] || V[i] != V[i+1])
			subtask4 = 0;
	}
	if(subtask4){
		for(int i = 0;i<m;i+=2){
			adj[U[i]].push_back({V[i],{i,i+1}});	
			// cout << U[i] << ' ' << V[i] << endl;
		}
		dfs2(0,-1);
		if(!ans.size())
			return false;
		return ans;
	}
	for(int i = 0;i<m;i++){
		if(mp[V[i]][U[i]].size()){
			adj[U[i]].push_back({V[i],{i,mp[V[i]][U[i]].back()}});
			adj[V[i]].push_back({U[i],{mp[V[i]][U[i]].back(),i}});
			mp[V[i]][U[i]].pop_back();
		}else{
			mp[U[i]][V[i]].push_back(i);
		}
	}
	dfs(0,-1);
	if(ans.empty())
		return false;
	return ans;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 3 ms 7348 KB Output is correct
4 Correct 3 ms 7252 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 3 ms 7252 KB Output is correct
7 Correct 38 ms 12224 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 3 ms 7252 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 3 ms 7252 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 137 ms 27284 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7764 KB Output is correct
2 Correct 3 ms 7380 KB Output is correct
3 Correct 3 ms 7252 KB Output is correct
4 Correct 3 ms 7252 KB Output is correct
5 Correct 4 ms 7764 KB Output is correct
6 Correct 3 ms 7252 KB Output is correct
7 Correct 3 ms 7380 KB Output is correct
8 Correct 3 ms 7380 KB Output is correct
9 Correct 3 ms 7352 KB Output is correct
10 Correct 5 ms 7620 KB Output is correct
11 Correct 4 ms 7276 KB Output is correct
12 Correct 4 ms 7764 KB Output is correct
13 Correct 4 ms 7252 KB Output is correct
14 Correct 4 ms 7252 KB Output is correct
15 Correct 4 ms 7380 KB Output is correct
16 Correct 3 ms 7380 KB Output is correct
17 Correct 54 ms 19568 KB Output is correct
18 Correct 41 ms 17444 KB Output is correct
19 Correct 3 ms 7252 KB Output is correct
20 Correct 3 ms 7252 KB Output is correct
21 Correct 3 ms 7352 KB Output is correct
22 Correct 3 ms 7256 KB Output is correct
23 Correct 112 ms 27392 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 4 ms 7380 KB Output is correct
3 Correct 28 ms 11564 KB Output is correct
4 Correct 28 ms 11704 KB Output is correct
5 Correct 4 ms 7380 KB Output is correct
6 Correct 4 ms 7380 KB Output is correct
7 Correct 3 ms 7252 KB Output is correct
8 Correct 3 ms 7252 KB Output is correct
9 Correct 3 ms 7252 KB Output is correct
10 Correct 5 ms 7636 KB Output is correct
11 Correct 4 ms 7508 KB Output is correct
12 Correct 5 ms 7508 KB Output is correct
13 Correct 4 ms 7636 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7508 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 3 ms 7252 KB Output is correct
18 Correct 4 ms 7380 KB Output is correct
19 Correct 3 ms 7380 KB Output is correct
20 Correct 30 ms 12104 KB Output is correct
21 Correct 29 ms 11692 KB Output is correct
22 Correct 5 ms 7608 KB Output is correct
23 Correct 5 ms 7252 KB Output is correct
24 Correct 3 ms 7252 KB Output is correct
25 Correct 4 ms 7380 KB Output is correct
26 Correct 4 ms 7636 KB Output is correct
27 Correct 30 ms 12208 KB Output is correct
28 Correct 29 ms 12244 KB Output is correct
29 Correct 3 ms 7252 KB Output is correct
30 Correct 35 ms 12496 KB Output is correct
31 Correct 4 ms 7252 KB Output is correct
32 Correct 30 ms 11960 KB Output is correct
33 Correct 28 ms 11860 KB Output is correct
34 Correct 17 ms 9812 KB Output is correct
35 Correct 4 ms 7508 KB Output is correct
36 Correct 25 ms 11348 KB Output is correct
37 Correct 29 ms 12316 KB Output is correct
38 Correct 3 ms 7380 KB Output is correct
39 Correct 25 ms 11312 KB Output is correct
40 Correct 5 ms 7380 KB Output is correct
41 Correct 40 ms 12512 KB Output is correct
42 Correct 38 ms 12160 KB Output is correct
43 Correct 3 ms 7252 KB Output is correct
44 Correct 4 ms 7460 KB Output is correct
45 Correct 4 ms 7636 KB Output is correct
46 Correct 15 ms 9404 KB Output is correct

Subtask #5
0.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 3 ms 7348 KB Output is correct
4 Correct 3 ms 7252 KB Output is correct
5 Correct 3 ms 7252 KB Output is correct
6 Correct 3 ms 7252 KB Output is correct
7 Correct 38 ms 12224 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 3 ms 7252 KB Output is correct
10 Correct 3 ms 7252 KB Output is correct
11 Correct 3 ms 7252 KB Output is correct
12 Correct 3 ms 7252 KB Output is correct
13 Correct 137 ms 27284 KB Output is correct
14 Correct 4 ms 7764 KB Output is correct
15 Correct 3 ms 7380 KB Output is correct
16 Correct 3 ms 7252 KB Output is correct
17 Correct 3 ms 7252 KB Output is correct
18 Correct 4 ms 7764 KB Output is correct
19 Correct 3 ms 7252 KB Output is correct
20 Correct 3 ms 7380 KB Output is correct
21 Correct 3 ms 7380 KB Output is correct
22 Correct 3 ms 7352 KB Output is correct
23 Correct 5 ms 7620 KB Output is correct
24 Correct 4 ms 7276 KB Output is correct
25 Correct 4 ms 7764 KB Output is correct
26 Correct 4 ms 7252 KB Output is correct
27 Correct 4 ms 7252 KB Output is correct
28 Correct 4 ms 7380 KB Output is correct
29 Correct 3 ms 7380 KB Output is correct
30 Correct 54 ms 19568 KB Output is correct
31 Correct 41 ms 17444 KB Output is correct
32 Correct 3 ms 7252 KB Output is correct
33 Correct 3 ms 7252 KB Output is correct
34 Correct 3 ms 7352 KB Output is correct
35 Correct 3 ms 7256 KB Output is correct
36 Correct 112 ms 27392 KB Output is correct
37 Incorrect 3 ms 7252 KB Output isn't correct
38 Halted 0 ms 0 KB -