Submission #893878

#	Time	Username	Problem	Language	Result	Execution time	Memory
893878		LCJLY	Paths (BOI18_paths)	C++14	23 / 100	3040 ms	18772 KiB

paths

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << "  " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << "  " << j << " " << #i << "  " << q << " " << #p << endl; 
#define show4(x,y) for(auto it:x) cout << it << " "; cout << #y << endl;
typedef pair<int,int>pii;
//typedef pair<pii,pii>pi2;
typedef array<pii,5>pi2;

int arr[300005];
vector<int>adj[300005];
int ans[10];

//color index

void dfs(int index, pi2 vis, int dist){
	vis[dist]={arr[index],index};
	if(dist>0) ans[dist]++;
	
	if(dist<4){
		for(auto it:adj[index]){
			bool amos=true;
			for(int x=0;x<dist+1;x++){
				if(vis[x].second==it) amos=false;
				if(vis[x].first==arr[it]) amos=false;
			}
			
			if(amos){
				dfs(it,vis,dist+1);
			}
		}
	}
}

pi2 notake;

void solve(){	
	int n,m,k;
	cin >> n >> m >> k;
	
	for(int x=1;x<=n;x++){
		cin >> arr[x];
	}
	
	int temp,temp2;
	for(int x=0;x<m;x++){
		cin >> temp >> temp2;
		adj[temp].push_back(temp2);
		adj[temp2].push_back(temp);
	}
	
	int counter=0;
	for(int x=1;x<=n;x++){
		dfs(x,notake,0);
	}
	
	for(int x=1;x<5;x++){
		counter+=ans[x];
		//show2(dis,x+1,ans,ans[x]);
	}
	
	cout << counter << "\n";
}

int32_t main(){										
	ios::sync_with_stdio(0);	
	cin.tie(0);
	//freopen("in.txt", "r", stdin);
	int t=1;
	//cin >> t;
	while(t--){
		solve();
	}	
}



		


		
		
	

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