oj.uz

Submission #1036628

# Submission time Handle Problem Language Result Execution time Memory
1036628 2024-07-27T15:01:06 Z Alihan_8 Simurgh (IOI17_simurgh) C++17
30 / 100
 327 ms 33016 KB 
#include "simurgh.h"

#include <bits/stdc++.h>

using namespace std;

#define all(x) x.begin(), x.end()
#define ar array
#define pb push_back
#define ln '\n'
//#define int long long

using i64 = long long;

template <class F, class _S>
bool chmin(F &u, const _S &v){
    bool flag = false;
    if ( u > v ){
        u = v; flag |= true;
    }
    return flag;
}

template <class F, class _S>
bool chmax(F &u, const _S &v){
    bool flag = false;
    if ( u < v ){
        u = v; flag |= true;
    }
    return flag;
}

map <vector<int>,int> dp;

int f(vector <int> x){
	sort(all(x));
	
	if ( !dp.count(x) ){
		dp[x] = count_common_roads(x);
	}
	
	return dp[x];
}



vector<int> find_roads(int n, std::vector<int> U, std::vector<int> V){
	int m = U.size();
	
	vector <int> g(m, -1);
	
	vector <vector<ar<int,2>>> adj(n);
	
	for ( int i = 0; i < m; i++ ){
		adj[U[i]].pb({V[i], i});
		adj[V[i]].pb({U[i], i});
	}
	
	vector <int> tree, us(n), d(n);
	
	vector <ar<int,2>> fa(n);
	
	vector <ar<int,3>> low(n);
	
	vector <vector<ar<int,2>>> to(n), alTo(n);
	
	auto dfs = [&](auto dfs, int u, int p) -> void{
		us[u] = true;
	
		low[u] = {d[u], u, -1};
		
		for ( auto &[v, j]: adj[u] ){
			if ( p != v ){
				if ( !us[v] ){
					d[v] = d[u] + 1;
					fa[v] = {u, j};
					
					tree.pb(j);
					
					dfs(dfs, v, u);
					
					chmin(low[u], low[v]);
				} else if ( d[v] < d[u] ){
					chmin(low[u], ar <int,3> {d[v], v, j});
					
					alTo[u].pb({v, j});
				}
			}
		}
		
		auto [dp, v, i] = low[u];
		
		if ( d[v] < d[u] ){
			to[u].pb({v, i});
		}
	};
	
	dfs(dfs, 0, -1);
	
	int X = f(tree);
	
	for ( int u = 0; u < n; u++ ){
		for ( auto &[v, j]: alTo[u] ){	
			vector <int> t;
			
			int x = u;	
			
			while ( x != v ){
				auto [nxt, i] = fa[x];
				
				t.pb(i);
				
				swap(nxt, x);
			}
			
			vector <int> us(m);
			
			for ( auto &x: t ){
				us[x] = true;
			}
			
			bool is = false;
			
			auto tmp = tree;
			
			for ( int i = 0; i < (int)tmp.size(); i++ ){
				//if ( g[tmp[i]] != -1 ) continue;
				
				if ( !us[tmp[i]] ) continue;
				
				tmp[i] = j;
				
				int Y = f(tmp);
				
				tmp[i] = tree[i];
				
				if ( Y > X ){
					g[j] = 1, g[tmp[i]] = 0;
				} 
				
				if ( Y < X ){
					g[tmp[i]] = 1, g[j] = 0;
				}
				
				is |= (X != Y);
			}
			
			if ( !is ){
				g[j] = 0;
				
				for ( auto &x: t ){
					g[x] = 0;
				}
			}
		}
	}
	
	vector <int> ret;
	
	for ( int i = 0; i < m; i++ ){
		if ( g[i] == -1 ){
			g[i] = 1;
		}
		
		if ( g[i] > 0 ){
			ret.pb(i);
		}
	}
	
	return ret;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 404 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 404 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 71 ms 6228 KB correct
15 Correct 61 ms 6248 KB correct
16 Correct 52 ms 6228 KB correct
17 Correct 42 ms 5204 KB correct
18 Correct 12 ms 2136 KB correct
19 Correct 42 ms 5204 KB correct
20 Correct 45 ms 4948 KB correct
21 Correct 33 ms 4744 KB correct
22 Correct 16 ms 2640 KB correct
23 Correct 14 ms 1884 KB correct
24 Correct 13 ms 1884 KB correct
25 Correct 1 ms 416 KB correct
26 Correct 11 ms 1884 KB correct
27 Correct 23 ms 1880 KB correct
28 Correct 4 ms 604 KB correct
29 Correct 2 ms 348 KB correct
30 Correct 23 ms 3420 KB correct
31 Correct 29 ms 3228 KB correct
32 Correct 23 ms 3416 KB correct
33 Correct 32 ms 3316 KB correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 404 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 71 ms 6228 KB correct
15 Correct 61 ms 6248 KB correct
16 Correct 52 ms 6228 KB correct
17 Correct 42 ms 5204 KB correct
18 Correct 12 ms 2136 KB correct
19 Correct 42 ms 5204 KB correct
20 Correct 45 ms 4948 KB correct
21 Correct 33 ms 4744 KB correct
22 Correct 16 ms 2640 KB correct
23 Correct 14 ms 1884 KB correct
24 Correct 13 ms 1884 KB correct
25 Correct 1 ms 416 KB correct
26 Correct 11 ms 1884 KB correct
27 Correct 23 ms 1880 KB correct
28 Correct 4 ms 604 KB correct
29 Correct 2 ms 348 KB correct
30 Correct 23 ms 3420 KB correct
31 Correct 29 ms 3228 KB correct
32 Correct 23 ms 3416 KB correct
33 Correct 32 ms 3316 KB correct
34 Incorrect 327 ms 33016 KB WA in grader: NO
35 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB correct
2 Correct 1 ms 348 KB correct
3 Incorrect 228 ms 25452 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB correct
2 Correct 0 ms 348 KB correct
3 Correct 0 ms 348 KB correct
4 Correct 0 ms 348 KB correct
5 Correct 0 ms 344 KB correct
6 Correct 0 ms 404 KB correct
7 Correct 0 ms 348 KB correct
8 Correct 0 ms 344 KB correct
9 Correct 0 ms 348 KB correct
10 Correct 0 ms 348 KB correct
11 Correct 1 ms 348 KB correct
12 Correct 0 ms 348 KB correct
13 Correct 0 ms 348 KB correct
14 Correct 71 ms 6228 KB correct
15 Correct 61 ms 6248 KB correct
16 Correct 52 ms 6228 KB correct
17 Correct 42 ms 5204 KB correct
18 Correct 12 ms 2136 KB correct
19 Correct 42 ms 5204 KB correct
20 Correct 45 ms 4948 KB correct
21 Correct 33 ms 4744 KB correct
22 Correct 16 ms 2640 KB correct
23 Correct 14 ms 1884 KB correct
24 Correct 13 ms 1884 KB correct
25 Correct 1 ms 416 KB correct
26 Correct 11 ms 1884 KB correct
27 Correct 23 ms 1880 KB correct
28 Correct 4 ms 604 KB correct
29 Correct 2 ms 348 KB correct
30 Correct 23 ms 3420 KB correct
31 Correct 29 ms 3228 KB correct
32 Correct 23 ms 3416 KB correct
33 Correct 32 ms 3316 KB correct
34 Incorrect 327 ms 33016 KB WA in grader: NO
35 Halted 0 ms 0 KB -