제출 #1148621

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148621		thelegendary08	Paths (BOI18_paths)	C++17	100 / 100	525 ms	25576 KiB

paths

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define pout(a) cout<<a.first<<' '<<a.second<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 3e5 + 5;
vi adj[mxn];
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	in3(n,m,k);
	vin(v,n);
	f0r(i,n)v[i]--;
	vvi w(k);
	f0r(i,n){
		w[v[i]].pb(i);
	}
	f0r(i,m){
		in2(a,b);
		a--; b--;
		adj[a].pb(b);
		adj[b].pb(a);
	}
	vi perm;
	f0r(i,k)perm.pb(i);
	set<vi>s;
	do{
		FOR(x, 2, k+1){
			vi thing;
			f0r(j, x){
				thing.pb(perm[j]);
			}
			s.insert(thing);
		}
	}while(next_permutation(all(perm)));
	vi dp(n);
	int ans = 0;
	for(auto perm : s){
		//vout(perm);
		int len = perm.size();
		for(auto u : w[perm[0]]){
			dp[u] = 1;
		}
		FOR(i, 1, len){
			int cur = perm[i];
			for(auto u : w[cur]){
				dp[u] = 0;
				for(auto x : adj[u]){
					if(v[x] == perm[i-1]){
						dp[u] += dp[x];
						
					}
				}
				if(i == len - 1){
					ans += dp[u];
				}
			}
		}
		//dout(ans);
	}
	
	out(ans);
}

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