oj.uz

Submission #1112776

# Submission time Handle Problem Language Result Execution time Memory
1112776 2024-11-14T19:43:29 Z kojac Paths (BOI18_paths) C++14
53 / 100
 672 ms 1048576 KB 
#include<bits/stdc++.h>

using namespace std;

typedef long long ll;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
#define MAXN (int)(3e5+10)


ll dp[MAXN][7][70], n, m, k, c[MAXN];
vector<ll> g[MAXN];



int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);


	cin >> n >> m >> k;

	for(int i = 1; i <= n; i++) cin >> c[i];

	for(int i = 0; i < m; i++){
		ll x, y;

		cin >> x >> y;

		g[x].push_back(y);
		g[y].push_back(x);
	}

	for(int i = 1; i <= n; i++){
		ll aux = (1<<c[i]);
		dp[i][1][aux] = 1;
	}

	for(int i = 2; i <= k; i++){
		for(int j = 1; j <= n; j++){
			for(int bm = 0; bm < (1<<(k+1)); bm++){
				if((bm & (1<<c[j])) == 0) continue;

				ll aux = bm^(1<<c[j]);

				for(auto u : g[j]){
					dp[j][i][bm] += dp[u][i-1][aux];
				}


			}
		}
	}

	ll ans = 0;

	for(int i = 2; i <= k; i++){
		for(int j = 1; j <= n; j++){
			for(int aux = 0; aux < (1<<(k+1)); aux++){
				ans += dp[j][i][aux];
			}
		}
	}

	// cout << dp[1][3][6] << " AQQ\n";

	cout << ans << endl;

}

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 3 ms 10832 KB Output is correct
7 Correct 3 ms 11000 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 3 ms 10908 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 38984 KB Output is correct
2 Correct 50 ms 22144 KB Output is correct
3 Runtime error 672 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 2 ms 10832 KB Output is correct
3 Correct 2 ms 10832 KB Output is correct
4 Correct 2 ms 10832 KB Output is correct
5 Correct 3 ms 10832 KB Output is correct
6 Correct 3 ms 10832 KB Output is correct
7 Correct 3 ms 11000 KB Output is correct
8 Correct 3 ms 10832 KB Output is correct
9 Correct 3 ms 10908 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 59 ms 38984 KB Output is correct
12 Correct 50 ms 22144 KB Output is correct
13 Runtime error 672 ms 1048576 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10832 KB Output is correct
2 Correct 34 ms 14928 KB Output is correct
3 Correct 17 ms 15168 KB Output is correct
4 Correct 301 ms 396872 KB Output is correct
5 Correct 270 ms 397500 KB Output is correct
6 Correct 502 ms 396844 KB Output is correct
7 Correct 21 ms 15140 KB Output is correct
8 Correct 351 ms 396932 KB Output is correct
9 Correct 337 ms 397336 KB Output is correct
10 Correct 363 ms 397068 KB Output is correct
11 Correct 280 ms 204224 KB Output is correct
12 Correct 396 ms 300608 KB Output is correct
13 Correct 291 ms 204344 KB Output is correct
14 Correct 492 ms 396872 KB Output is correct
15 Correct 489 ms 396872 KB Output is correct
16 Correct 2 ms 10832 KB Output is correct
17 Correct 2 ms 10832 KB Output is correct
18 Correct 2 ms 11000 KB Output is correct
19 Correct 2 ms 10832 KB Output is correct
20 Correct 3 ms 10832 KB Output is correct
21 Correct 3 ms 10832 KB Output is correct
22 Correct 3 ms 10832 KB Output is correct
23 Correct 2 ms 10832 KB Output is correct
24 Correct 2 ms 10832 KB Output is correct
25 Correct 2 ms 10832 KB Output is correct