oj.uz

답안 #864345

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
864345 2023-10-22T14:49:11 Z maks007 Paths (BOI18_paths) C++14
70 / 100
 1450 ms 41880 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[l]) 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;
}

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 8352 KB Output is correct
2 Correct 88 ms 7504 KB Output is correct
3 Correct 334 ms 41296 KB Output is correct
4 Correct 144 ms 10972 KB Output is correct
5 Correct 175 ms 11140 KB Output is correct
6 Correct 249 ms 29416 KB Output is correct
7 Correct 338 ms 41608 KB Output is correct
8 Correct 322 ms 41812 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 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 109 ms 8352 KB Output is correct
12 Correct 88 ms 7504 KB Output is correct
13 Correct 334 ms 41296 KB Output is correct
14 Correct 144 ms 10972 KB Output is correct
15 Correct 175 ms 11140 KB Output is correct
16 Correct 249 ms 29416 KB Output is correct
17 Correct 338 ms 41608 KB Output is correct
18 Correct 322 ms 41812 KB Output is correct
19 Correct 109 ms 7956 KB Output is correct
20 Correct 93 ms 7400 KB Output is correct
21 Correct 389 ms 41296 KB Output is correct
22 Correct 145 ms 11088 KB Output is correct
23 Correct 141 ms 10940 KB Output is correct
24 Correct 264 ms 29908 KB Output is correct
25 Correct 322 ms 41452 KB Output is correct
26 Correct 323 ms 41880 KB Output is correct
27 Correct 98 ms 7500 KB Output is correct
28 Correct 130 ms 9808 KB Output is correct
29 Correct 411 ms 41488 KB Output is correct
30 Correct 327 ms 24328 KB Output is correct
31 Correct 329 ms 24420 KB Output is correct
32 Correct 414 ms 41464 KB Output is correct
33 Correct 0 ms 344 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 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 1450 ms 2648 KB Output isn't correct
3 Halted 0 ms 0 KB -