Submission #3712557


Source Code Expand

#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define MOD 1000000007

//define
ll X;
int n, m;
struct Data{
	int x, y, v;
	bool operator<(const Data a)const{
		return v < a.v;
	}
}d[2333];

void input(){
	scanf("%d %d", &n, &m);
	scanf("%lld", &X);
	for(int i = 1; i <= m; i++)
		scanf("%d %d %d", &d[i].x, &d[i].y, &d[i].v);
	std::sort(d + 1, d + m + 1);
}

//work
ll ans;
int fa[1111];
int ls, mr, eq;

int find(int a){
	if(fa[a] == a) return a;
	return fa[a] = find(fa[a]);
}

void Kruskal(int a){
	ans = 0;
	for(int i = 1; i <= n; i++) fa[i] = i;
	ans = d[a].v;
	fa[d[a].x] = d[a].y;
	for(int i = 1; i <= m; i++){
		if(i == a) continue;
		int u = find(d[i].x), v = find(d[i].y);
		if(u == v) continue;
		fa[u] = v;
		ans = ans + d[i].v;
	}
	if(ans < X) ls++;
	if(ans == X) eq++;
	if(ans > X) mr++;
}

int p[1111];
int Ans;
void work(){
	p[0] = 1;
	for(int i = 1; i <= n; i++)
		p[i] = p[i - 1] * 2 % MOD;
	for(int i = 1; i <= m; i++) Kruskal(i);
	if(eq == 0) puts("0");
	else if(ls == 0)
		printf("%lld\n", 1ll * ((p[eq] - 2 + MOD) % MOD) * p[mr] % MOD);
	else
		printf("%lld\n", 1ll * 2 * ((p[eq] - 1 + MOD) % MOD) * p[mr] % MOD);
}

int main(){
	input();
	work();
	return 0;
}

Submission Info

Submission Time
Task E - Bichrome Spanning Tree
User Trestrals
Language C++14 (GCC 5.4.1)
Score 0
Code Size 1284 Byte
Status WA
Exec Time 67 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘void input()’:
./Main.cpp:18:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &m);
                        ^
./Main.cpp:19:19: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &X);
                   ^
./Main.cpp:21:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &d[i].x, &d[i].y, &d[i].v);
                                               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 900
Status
AC × 4
AC × 46
WA × 6
Set Name Test Cases
Sample sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, 24.txt, 25.txt, 26.txt, 27.txt, 28.txt, 29.txt, 30.txt, 31.txt, 32.txt, 33.txt, 34.txt, 35.txt, 36.txt, 37.txt, 38.txt, 39.txt, 40.txt, 41.txt, 42.txt, 43.txt, 44.txt, 45.txt, 46.txt, 47.txt, 48.txt, sample-01.txt, sample-02.txt, sample-03.txt, sample-04.txt
Case Name Status Exec Time Memory
01.txt AC 51 ms 256 KB
02.txt AC 59 ms 256 KB
03.txt AC 45 ms 256 KB
04.txt AC 42 ms 256 KB
05.txt AC 39 ms 256 KB
06.txt AC 50 ms 256 KB
07.txt AC 41 ms 256 KB
08.txt AC 64 ms 256 KB
09.txt AC 53 ms 256 KB
10.txt AC 40 ms 256 KB
11.txt AC 51 ms 256 KB
12.txt AC 6 ms 128 KB
13.txt AC 6 ms 128 KB
14.txt AC 8 ms 128 KB
15.txt WA 67 ms 256 KB
16.txt AC 45 ms 256 KB
17.txt WA 52 ms 256 KB
18.txt AC 48 ms 256 KB
19.txt AC 40 ms 256 KB
20.txt AC 42 ms 256 KB
21.txt WA 52 ms 256 KB
22.txt AC 38 ms 256 KB
23.txt AC 42 ms 256 KB
24.txt AC 6 ms 128 KB
25.txt AC 6 ms 128 KB
26.txt AC 48 ms 256 KB
27.txt AC 53 ms 256 KB
28.txt AC 46 ms 256 KB
29.txt AC 43 ms 256 KB
30.txt AC 50 ms 256 KB
31.txt AC 41 ms 256 KB
32.txt AC 45 ms 256 KB
33.txt AC 44 ms 256 KB
34.txt AC 38 ms 256 KB
35.txt WA 26 ms 256 KB
36.txt WA 26 ms 256 KB
37.txt WA 27 ms 256 KB
38.txt AC 55 ms 256 KB
39.txt AC 45 ms 256 KB
40.txt AC 43 ms 256 KB
41.txt AC 58 ms 256 KB
42.txt AC 18 ms 128 KB
43.txt AC 8 ms 128 KB
44.txt AC 6 ms 128 KB
45.txt AC 12 ms 128 KB
46.txt AC 21 ms 128 KB
47.txt AC 7 ms 128 KB
48.txt AC 9 ms 128 KB
sample-01.txt AC 1 ms 128 KB
sample-02.txt AC 1 ms 128 KB
sample-03.txt AC 1 ms 128 KB
sample-04.txt AC 1 ms 128 KB