oj.uz

답안 #1036668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1036668 2024-07-27T15:12:50 Z Alihan_8 Simurgh (IOI17_simurgh) C++17
0 / 100
 342 ms 25404 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++ ){
				int x = tmp[i];
				
				if ( !us[x] ) continue;
				
				if ( g[x] != -1 ){
					tmp[i] = j; int Y = f(tmp);
					tmp[i] = tree[i];
					
					if ( X == Y ){
						g[j] = g[x];
					} else{
						g[j] = (X < Y);
					} is = 1;
					
					break;
				}
			}
			for ( int i = 0; i < (int)tmp.size(); i++ ){
				int x = tmp[i];
				
				if ( !us[x] || g[x] != -1 ) continue;
				
				tmp[i] = j; int Y = f(tmp);
				tmp[i] = tree[i];
				
				if ( X == Y ){
					g[x] = g[j];
				} else{
					g[x] = (X > Y);
				}
				
				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);
		}
	}
	
	//sort(all(ret)); for ( auto &x: ret ) cout << x << ' '; cout << ln;
	
	return ret;
}

Subtask #1
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB WA in grader: NO
2 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 432 KB correct
2 Correct 0 ms 348 KB correct
3 Incorrect 342 ms 25404 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB WA in grader: NO
2 Halted 0 ms 0 KB -