Submission #304142

#	Time	Username	Problem	Language	Result	Execution time	Memory
304142		Hemimor	Paths (BOI18_paths)	C++14	100 / 100	674 ms	70904 KiB

paths

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <numeric>
#include <cassert>
#include <vector>
#include <cmath>
#include <queue>
#include <stack>
#include <set>
#include <map>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<30;
const ll INF=1ll<<60;
const double pi=acos(-1);
const double eps=1e-8;
const ll mod=1e9+7;
const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1};

int n,m,k;
vi a;
vvi g;
vvl dp;

int main(){
	scanf("%d%d%d",&n,&m,&k);
	a=vi(n);
	g=vvi(n);
	dp=vvl(n,vl(1<<k));
	for(int i=0;i<n;i++){
		cin>>a[i];
		a[i]--;
		dp[i][1<<a[i]]++;
	}
	for(int i=0;i<m;i++){
		int u,v;
		scanf("%d%d",&u,&v);
		u--,v--;
		g[u].push_back(v);
		g[v].push_back(u);
	}
	ll res=-n;
	for(int i=1;i<1<<k;i++) for(int v=0;v<n;v++) if(dp[v][i]){
		for(auto u:g[v]) if(!(i&1<<a[u])) dp[u][i+(1<<a[u])]+=dp[v][i];
	}
	for(int i=0;i<n;i++) for(int j=0;j<1<<k;j++) res+=dp[i][j];
	printf("%lld\n",res);
}

Compilation message (stderr)

paths.cpp: In function 'int main()':
paths.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   45 |  scanf("%d%d%d",&n,&m,&k);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~
paths.cpp:56:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   56 |   scanf("%d%d",&u,&v);
      |   ~~~~~^~~~~~~~~~~~~~

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