oj.uz

Submission #893878

# Submission time Handle Problem Language Result Execution time Memory
893878 2023-12-27T15:47:56 Z LCJLY Paths (BOI18_paths) C++14
23 / 100
 3000 ms 18772 KB 
#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.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 3 ms 8792 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 2 ms 8856 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8812 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3040 ms 18772 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8796 KB Output is correct
2 Correct 2 ms 8796 KB Output is correct
3 Correct 3 ms 8792 KB Output is correct
4 Correct 2 ms 8796 KB Output is correct
5 Correct 2 ms 8792 KB Output is correct
6 Correct 2 ms 8856 KB Output is correct
7 Correct 2 ms 8796 KB Output is correct
8 Correct 2 ms 8812 KB Output is correct
9 Correct 2 ms 8796 KB Output is correct
10 Correct 2 ms 8796 KB Output is correct
11 Execution timed out 3040 ms 18772 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8792 KB Output is correct
2 Execution timed out 3025 ms 11608 KB Time limit exceeded
3 Halted 0 ms 0 KB -