oj.uz

답안 #951746

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951746 2024-03-22T12:37:59 Z mocha Paths (BOI18_paths) C++14
0 / 100
 69 ms 12780 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int mx = 3e5+5;

int n, m, k;
int a[mx];
long long b[6][mx];
long long ans = 0;

signed main() {
	cin.tie(0);ios::sync_with_stdio(0);

	cin >> n >> m >> k;
	for (int i=1;i<=n;i++) {
		cin >> a[i];
	}
	for (int i=1;i<=m;i++) {
		int u, v;
		cin >> u >> v;
		b[a[v]][u]++;
		b[a[u]][v]++;
	}
	for (int i=1;i<=n;i++) {
		long long tmp = 1;
		long long cnt = 0;
		for (int j=1;j<=k;j++) {
			if (a[i] == j) continue;
			tmp *= b[j][i];
			cnt += b[j][i];
		}
		if (k==1) tmp = 0;
		ans += tmp * 2 + cnt;
	}
	cout << ans << "\n";
}

Subtask #1
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 10588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 33 ms 8540 KB Output is correct
2 Correct 30 ms 8540 KB Output is correct
3 Correct 69 ms 12380 KB Output is correct
4 Incorrect 46 ms 6488 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 10588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

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