How to optimize my code (CSES Hamiltonian Flights)

№	Пользователь	Рейтинг
1	jiangly	3810
2	Benq	3676
3	Kevin114514	3655
4	maroonrk	3463
5	strapple	3447
6	Um_nik	3387
7	heuristica	3322
8	turmax	3317
9	tourist	3307
10	jiangbowen	3291

№	Пользователь	Вклад
1	Qingyu	156
2	nik_exists	150
2	maspy	150
4	Um_nik	143
5	Errichto	139
6	adamant	137
7	AmShZ	135
8	maroonrk	133
9	BledDest	132
10	qwexd	129

Link to the problem I use bottom up DP, where $$$dp[\text{mask of visited vertices}][\text{ending vertex}]$$$. I'm pretty sure my time complexity is $$$O(N \cdot 2^N + 2^N \cdot N^2)$$$ however it gives TLE. Are there any way to optimize my code, and what's the reason for TLE (probably big constant factor?)

My code

#include <bits/stdc++.h>
using namespace std;

const int M = 1e9 + 7;

const int N = 20;

int dp[1 << N][N];

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int n, m;
	cin >> n >> m;
	vector<tuple<int, int, int>> edges(m);
	for(int i = 0; i < m; ++i) {
		int u, v;
		cin >> u >> v;
		--u, --v;
		edges[i] = {u, v, (1 << u) | (1 << v)};
	}
	vector<pair<int, int>> masks;
	for(int i = 0; i < (1 << n); ++i) {
		int j = __builtin_popcount(i);
		if(j >= 2) {
			masks.emplace_back(j, i);
		}
	}
	sort(masks.begin(), masks.end());
	dp[1][0] = 1;
	for(int id = 0; id < (int) masks.size(); ++id) {
		int mask = masks[id].second;
		for(auto& [u, v, c] : edges) {
			if((mask & c) == c) {
				dp[mask][v] = (dp[mask][v] + dp[mask ^ (1 << v)][u]) % M;
			}
		}
	}
	cout << dp[(1 << n) - 1][n - 1] << "\n";
	return 0;
}

Комментарии (8)

Показать архивные | Написать комментарий?

Alon-Tanay

4 года назад, скрыть # |

Your dp idea could work, if you eliminate the N^2 factor. Try using a top-bottom approach, so start with the full mask and ending, and work to the bottom (recursion should be an easy implementation). don't forget to use memoization in that case, since you don't want to compute the same value more than once.

→ Ответить

Polyn0mial

4 года назад, скрыть # ^ |

Is it because bottom-up approach checked to many unimportant states?

Scratch that, looking at my submission I think I'm using N^2*2^N as well, the problem is probably you sorting the masks.

Also quick tip for speeding up your code by about x5 is only doing dp on the middle nodes (2,3,...,n-1) because you know for sure when you'll reach 1 and n.

Sorting is only $$$O(N \cdot 2^N)$$$ which is way smaller than $$$O(2^N \cdot N^2)$$$. Also, only do dp on the middle nodes like this $$$dp[\text{first_node}][\text{visited_nodes}][\text{ending_node}]$$$ ? However it requires $$$O(2^N \cdot N^2)$$$ memory which is too much.

no no, do the same dp, but only with middle nodes, don't do it for 1 and n

Not sure how. If we only do the middle ones, what will be the final answer? Some of the $$$\text{full_mask}$$$ could be starting from some nodes that isn't directly connected to node $$$1$$$.

the only difference is the starting values, which will be 1 for each direct neighbor of node 1 (for the 1 bit mask).

The calculation at the end will be the sum of full masks over all nodes that connect to n

Блог пользователя Polyn0mial