제출 #719483

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
719483		pavement	Paths (BOI18_paths)	C++17	100 / 100	390 ms	112132 KiB

paths

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
#define g4(a) get<4>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
using db = double;
using ll = long long;
using ld = long double;
using ii = pair<int, int>;
using iii = tuple<int, int, int>;
using iiii = tuple<int, int, int, int>;
using iiiii = tuple<int, int, int, int, int>;
template<class key, class value = null_type, class cmp = less<key> >
using ordered_set = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;

int N, M, K, ans, C[300005], dp[300005][(1 << 5) + 5];
vector<int> adj[300005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N >> M >> K;
	for (int i = 1; i <= N; i++) {
		cin >> C[i];
		C[i]--;
		dp[i][1 << C[i]] = 1;
	}
	for (int u, v; M--; ) {
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}
	for (int bm = 0; bm < (1 << K); bm++) {
		for (int i = 1; i <= N; i++) {
			if ((bm & (1 << C[i])) == 0 || __builtin_popcountll(bm) == 1) continue;
			for (auto u : adj[i]) {
				dp[i][bm] += dp[u][bm ^ (1 << C[i])];
			}
		}
	}
	for (int i = 1; i <= N; i++) {
		for (int bm = 0; bm < (1 << K); bm++) {
			if ((bm & (1 << C[i])) == 0 || __builtin_popcountll(bm) == 1) continue;
			ans += dp[i][bm];
		}
	}
	cout << ans << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

paths.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

• Subtask 1: 23 / 23
• Subtask 2: 20 / 20
• Subtask 3: 27 / 27
• Subtask 4: 30 / 30