oj.uz

답안 #951978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
951978 2024-03-23T03:15:27 Z mocha Paths (BOI18_paths) C++14
70 / 100
 83 ms 30292 KB 
#include <bits/stdc++.h>
#define int long long
#define ff first
#define ss second
using namespace std;
const int mx = 3e5+5;

int n, m, k;
int cnt[1<<5][mx];
int tmp[1<<5][mx];
int c[mx];
vector<pair<int, int>> e;
int ans1, ans2, ans3, ans4, ans5;
vector<int> nums[6];
int ans;

void init() {
	for (int i=0;i<1<<k;i++) {
		int ii=i, cnt=0;
		while (ii) {
			cnt += (ii&1);
			ii >>= 1;
		}
		nums[cnt].push_back(i);
	}
}

void get1() {
	for (auto [u, v]:e) {
		cnt[c[v]][u]++;
		cnt[c[u]][v]++;
	}
	for (int i=1;i<=n;i++) {
		for (int j:nums[1]) {	
			if (j == c[i]) continue;
			ans1 += cnt[j][i];
		}
	}
}

void get2() {
	for (int i=1;i<=n;i++) {
		for (int x = 1;x<1<<k;x<<=1) {
			if (x == c[i]) continue;
			for (int y = 1; y < 1<<k ; y<<=1) {
				if ( y == c[i] or x == y) continue;
				ans2 += cnt[x][i] * cnt[y][i];
			}
		}
	}
}

void get3() {
	for (auto [u, v]:e) {
		if (c[u] == c[v]) continue;
		for (int x = 1;x<1<<k;x<<=1) {
			if (x == c[u] or x == c[v]) continue;
			for (int y = 1; y < 1<<k ; y<<=1) {
				if (y == c[u] or y == c[v] or x == y) continue;
				ans2 += cnt[x][v] * cnt[y][u] * 2;
			}
		}
	}
}

void get4() {}

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

	cin >> n >> m >> k;
	e.resize(m);
	init();
	for (int i=1;i<=n;i++) {
		int x;
		cin >> x; x--;
		c[i] = 1<<x;
	}
	for (int i=0;i<m;i++) {
		cin >> e[i].ff >> e[i].ss;
	}
	if (k == 1) {
		ans = 0;
	} else if (k == 2) {
		get1();
		ans = ans1;
	} else if (k == 3) {
		get1(); get2();
		ans = ans1 + ans2;
	} else if (k == 4) {
		get1(); get2(); get3();
		ans = ans1 + ans2 + ans3;
	} 
	cout << ans << "\n";
}

Compilation message

paths.cpp: In function 'void get1()':
paths.cpp:29:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |  for (auto [u, v]:e) {
      |            ^
paths.cpp: In function 'void get3()':
paths.cpp:54:12: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   54 |  for (auto [u, v]:e) {
      |            ^

Subtask #1
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 36 ms 13532 KB Output is correct
2 Correct 33 ms 13148 KB Output is correct
3 Correct 71 ms 25260 KB Output is correct
4 Correct 39 ms 16464 KB Output is correct
5 Correct 38 ms 10324 KB Output is correct
6 Correct 55 ms 20692 KB Output is correct
7 Correct 63 ms 25428 KB Output is correct
8 Correct 63 ms 25268 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 8540 KB Output is correct
2 Correct 1 ms 8540 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 2 ms 8540 KB Output is correct
7 Correct 1 ms 8540 KB Output is correct
8 Correct 2 ms 8536 KB Output is correct
9 Correct 2 ms 4444 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct
11 Correct 36 ms 13532 KB Output is correct
12 Correct 33 ms 13148 KB Output is correct
13 Correct 71 ms 25260 KB Output is correct
14 Correct 39 ms 16464 KB Output is correct
15 Correct 38 ms 10324 KB Output is correct
16 Correct 55 ms 20692 KB Output is correct
17 Correct 63 ms 25428 KB Output is correct
18 Correct 63 ms 25268 KB Output is correct
19 Correct 35 ms 13916 KB Output is correct
20 Correct 31 ms 13400 KB Output is correct
21 Correct 63 ms 26196 KB Output is correct
22 Correct 40 ms 16848 KB Output is correct
23 Correct 37 ms 10580 KB Output is correct
24 Correct 54 ms 21592 KB Output is correct
25 Correct 68 ms 26180 KB Output is correct
26 Correct 62 ms 26192 KB Output is correct
27 Correct 39 ms 15440 KB Output is correct
28 Correct 46 ms 16204 KB Output is correct
29 Correct 83 ms 30284 KB Output is correct
30 Correct 72 ms 23744 KB Output is correct
31 Correct 63 ms 23380 KB Output is correct
32 Correct 83 ms 30292 KB Output is correct
33 Correct 1 ms 8540 KB Output is correct
34 Correct 1 ms 8540 KB Output is correct
35 Correct 1 ms 6492 KB Output is correct
36 Correct 1 ms 4444 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 2 ms 8540 KB Output is correct
39 Correct 1 ms 8540 KB Output is correct
40 Correct 3 ms 8540 KB Output is correct
41 Correct 1 ms 4444 KB Output is correct
42 Correct 1 ms 6492 KB Output is correct

Subtask #4
0 / 30.0

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