Submission #864347

# Submission time Handle Problem Language Result Execution time Memory
864347 2023-10-22T14:51:46 Z maks007 Paths (BOI18_paths) C++14
70 / 100
3000 ms 41968 KB
#include "bits/stdc++.h"

using namespace std;

#define int long long

vector <int> color;
vector <vector <int>> cntColor, g;

signed main () {
	int n, m, k;
	cin >> n >> m >> k;
	color.resize(n);
	cntColor.resize(n, vector <int> (k + 1, 0));
	g.resize(n);
	for(int i = 0; i < n; i ++) cin >> color[i];
	for(int i = 0, u, v; i < m; i ++) {
		cin >> u >> v;
		u --, v --;
		g[u].push_back(v);
		g[v].push_back(u);
		cntColor[u][color[v]] ++;
		cntColor[v][color[u]] ++;
	}
	
	int ans = 0;
	for(int color2 = 1; color2 <= k; color2 ++) {
		for(int i = 0; i < n; i ++) {
			if(color[i] == color2) {
				for(int color1 = 1; color1 <= k; color1 ++) {
					if(color1 == color2) continue;
					ans += cntColor[i][color1];
					if(k == 2) continue;
					for(int color3 = color1 + 1; color3 <= k; color3 ++) {
						if(color3 == color2) continue;
						ans += 2 * (cntColor[i][color1] * cntColor[i][color3]);
					}
				}
			}
		}
  	}
  //	cout << ans << " ";
  	if(k >= 4) {
  		for(int v = 0; v < n; v ++) {
  			for(auto u : g[v]) {
  				if(color[u] == color[v]) continue;
  				for(int i = 1; i <= k; i ++) {
  					if(i == color[u] || color[v] == i) continue;
  					for(int j = 1; j <= k; j ++) {
  						if(j == i || j == color[u] || j == color[v]) continue;
  						ans += cntColor[v][i] * cntColor[u][j];
  					}
  				}
  				
  			}
  		}
  	}
  	if(k >= 5) {
  		for(int mid = 0; mid < n; mid ++) {
  			for(auto l : g[mid]) {
  				if(color[mid] == color[l]) continue;
  				for(auto r : g[mid]) {
  					if(color[mid] == color[r] || color[l] == color[r]) continue;
  					for(int colorL = 1; colorL <= k; colorL ++) {
  						if(colorL == color[mid] || colorL == color[l] || colorL == color[r]) continue;
  						for(int colorR = 1; colorR <= k; colorR ++) {
  							if(colorR == colorL || colorR == color[mid] || colorR == color[r] || colorR == color[l]) continue;
  							ans += cntColor[r][colorR] * cntColor[l][colorL];
  						}
  					}
  				}
  			}
  		}
  	}
  	cout << ans;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 108 ms 8020 KB Output is correct
2 Correct 86 ms 7504 KB Output is correct
3 Correct 332 ms 41460 KB Output is correct
4 Correct 153 ms 10968 KB Output is correct
5 Correct 137 ms 11092 KB Output is correct
6 Correct 243 ms 29632 KB Output is correct
7 Correct 331 ms 41472 KB Output is correct
8 Correct 358 ms 41812 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 108 ms 8020 KB Output is correct
12 Correct 86 ms 7504 KB Output is correct
13 Correct 332 ms 41460 KB Output is correct
14 Correct 153 ms 10968 KB Output is correct
15 Correct 137 ms 11092 KB Output is correct
16 Correct 243 ms 29632 KB Output is correct
17 Correct 331 ms 41472 KB Output is correct
18 Correct 358 ms 41812 KB Output is correct
19 Correct 116 ms 7988 KB Output is correct
20 Correct 87 ms 7508 KB Output is correct
21 Correct 333 ms 41240 KB Output is correct
22 Correct 141 ms 11088 KB Output is correct
23 Correct 147 ms 10916 KB Output is correct
24 Correct 249 ms 29648 KB Output is correct
25 Correct 321 ms 41352 KB Output is correct
26 Correct 322 ms 41968 KB Output is correct
27 Correct 97 ms 7400 KB Output is correct
28 Correct 132 ms 9632 KB Output is correct
29 Correct 401 ms 41484 KB Output is correct
30 Correct 267 ms 24260 KB Output is correct
31 Correct 285 ms 24348 KB Output is correct
32 Correct 407 ms 41448 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1065 ms 2648 KB Output is correct
3 Correct 29 ms 3164 KB Output is correct
4 Correct 80 ms 15352 KB Output is correct
5 Correct 99 ms 16072 KB Output is correct
6 Correct 121 ms 16984 KB Output is correct
7 Correct 33 ms 3164 KB Output is correct
8 Correct 89 ms 15248 KB Output is correct
9 Correct 90 ms 15816 KB Output is correct
10 Correct 92 ms 15944 KB Output is correct
11 Execution timed out 3073 ms 9932 KB Time limit exceeded
12 Halted 0 ms 0 KB -