oj.uz

답안 #1112780

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1112780 2024-11-14T19:59:37 Z kojac Paths (BOI18_paths) C++17
53 / 100
 641 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(int x = 0; x < g[j].size(); x++){
					dp[j][i][bm] += dp[g[j][x]][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;

	return 0;

}

Compilation message

paths.cpp: In function 'int main()':
paths.cpp:45:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |     for(int x = 0; x < g[j].size(); x++){
      |                    ~~^~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 3 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 2 ms 10832 KB Output is correct
6 Correct 3 ms 10832 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 3 ms 10832 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 36168 KB Output is correct
2 Correct 42 ms 20112 KB Output is correct
3 Runtime error 641 ms 1048576 KB Execution killed with signal 9
4 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 10832 KB Output is correct
2 Correct 3 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 2 ms 10832 KB Output is correct
6 Correct 3 ms 10832 KB Output is correct
7 Correct 2 ms 10832 KB Output is correct
8 Correct 2 ms 10844 KB Output is correct
9 Correct 3 ms 10832 KB Output is correct
10 Correct 2 ms 10832 KB Output is correct
11 Correct 59 ms 36168 KB Output is correct
12 Correct 42 ms 20112 KB Output is correct
13 Runtime error 641 ms 1048576 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10832 KB Output is correct
2 Correct 45 ms 15124 KB Output is correct
3 Correct 16 ms 14928 KB Output is correct
4 Correct 296 ms 396884 KB Output is correct
5 Correct 276 ms 397108 KB Output is correct
6 Correct 498 ms 396704 KB Output is correct
7 Correct 20 ms 14928 KB Output is correct
8 Correct 354 ms 396872 KB Output is correct
9 Correct 330 ms 397500 KB Output is correct
10 Correct 362 ms 396992 KB Output is correct
11 Correct 298 ms 204480 KB Output is correct
12 Correct 373 ms 300668 KB Output is correct
13 Correct 287 ms 204364 KB Output is correct
14 Correct 501 ms 396856 KB Output is correct
15 Correct 514 ms 396992 KB Output is correct
16 Correct 3 ms 10832 KB Output is correct
17 Correct 2 ms 10832 KB Output is correct
18 Correct 3 ms 10832 KB Output is correct
19 Correct 2 ms 10832 KB Output is correct
20 Correct 2 ms 10832 KB Output is correct
21 Correct 2 ms 10832 KB Output is correct
22 Correct 3 ms 11000 KB Output is correct
23 Correct 3 ms 10832 KB Output is correct
24 Correct 2 ms 10832 KB Output is correct
25 Correct 2 ms 10832 KB Output is correct