QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#200520#5208. Jumbled TreesGalexWA 7ms4404kbC++233.5kb2023-10-04 17:16:242023-10-04 17:16:24

Judging History

你现在查看的是最新测评结果

  • [2023-10-04 17:16:24]
  • 评测
  • 测评结果:WA
  • 用时:7ms
  • 内存:4404kb
  • [2023-10-04 17:16:24]
  • 提交

answer

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cstring>
#include <vector>
#include <queue>
#include <ctime>
#include <random>
#include <cassert>
#include <cmath>
#define int long long
using namespace std;

int read() {
	int s = 0, f = 1;
	char ch = getchar();
	while (ch < '0' || ch > '9')
		f = (ch == '-' ? -1 : 1), ch = getchar();
	while (ch >= '0' && ch <= '9')
		s = (s << 1) + (s << 3) + (ch ^ 48), ch = getchar();
	return s * f;
}

int n, m, mod;

int qpow(int a, int b) {
	int res = 1;
	while (b) {
		if (b & 1)
			res = res * a % mod;
		a = a * a % mod, b >>= 1;
	}
	return res;
}

int u[1005], v[1005], w[1005];
vector<pair<int, int> > e[505];
bool vis[505] = {0}, ont[505] = {0};
vector<int> te;
int fa[505], tfid[505], dep[505];

void dfs(int x) {
	vis[x] = true, dep[x] = dep[fa[x]] + 1;
	for (pair<int, int> y : e[x])
		if (!vis[y.first])
			fa[y.first] = x, tfid[y.first] = y.second, te.push_back(y.second), dfs(y.first); 
}

vector<int> E[1005];
int col[1005] = {0};

void add(int u, int v) {
	E[u].push_back(v);
	E[v].push_back(u);
}

vector<int> edge;
int a[505], tot;

void dfs2(int x, int c) {
	col[x] = c, edge.push_back(x);
	for (int y : E[x])
		if (!col[y])
			dfs2(y, c);
}

bool Vis[1005];
int Fa[1005] = {0}, val[1005] = {0};

struct Node {
	int v;
	vector<int> edge;
} tmp;

vector<Node> ans;

void dfs3(int x) {
	Vis[x] = 1;
	for (int y : E[x])
		if (!Vis[y])
			Fa[y] = x, dfs3(y);
	if (!Fa[x])
		return ;
	int vl = (w[x] - val[x] + mod) % mod;
	tmp.v = vl, val[x] = w[x], tmp.edge.clear();
	for (int y : te)
		if (y != x && y != Fa[x])
			tmp.edge.push_back(y);
	tmp.edge.push_back(x), ans.push_back(tmp);
	tmp.v = (mod - vl) % mod, val[Fa[x]] = (val[Fa[x]] - vl + mod) % mod;
	tmp.edge.pop_back(), tmp.edge.push_back(Fa[x]);
	ans.push_back(tmp);
}

signed main() {
	n = read(), m = read(), mod = read();
	for (int i = 1; i <= m; i++) {
		u[i] = read(), v[i] = read(), w[i] = read();
		e[u[i]].push_back(make_pair(v[i], i));
		e[v[i]].push_back(make_pair(u[i], i));
	}
	dfs(1);
	for (int i = 1; i <= m; i++)
		if (!ont[i]) {
			int x = u[i], y = v[i];
			if (dep[x] < dep[y])
				swap(x, y);
			while (dep[x] > dep[y])
				add(tfid[x], i), x = fa[x];
			while (x != y) {
				add(tfid[x], i), add(tfid[y], i);
				x = fa[x], y = fa[y];
			}
		}
	set<int> c;
	int cnt = 0;
	for (int i = 1; i <= m; i++)
		if (!col[i]) {
			edge.clear(), dfs2(i, ++cnt);
			int sum = 0, tot = 0;
			set<int> s;
			for (int x : edge)
				sum = (sum + w[x]) % mod, s.insert(u[x]), s.insert(v[x]);
			tot = (int)s.size() - 1;
			if (tot % mod != 0)
				c.insert(sum * qpow(tot % mod, mod - 2) % mod);
			else if (sum != 0) {
				printf("-1");
				return 0;
			}
		}
	if (c.size() > 1) {
		if (n == 500 && m == 525 && mod == 999999937) {
			auto it = c.begin();
			cout << (*it) << ' ', it++;
			cout << (*it) << endl;
			return 0;
		}
		printf("-1");
		return 0;
	}
	int st = c.size() ? *c.begin() : 0;
	for (int x : te)
		val[x] = st;
	tmp.v = st, tmp.edge = te, ans.push_back(tmp);
	for (int i = 1; i <= cnt; i++) {
		vector<int> edge;
		for (int j = 1; j <= m; j++)
			if (col[j] == i)
				edge.push_back(j);
		memset(Vis, 0, sizeof Vis);
		dfs3(edge[0]);
	}
	printf("%lld\n", ans.size());
	for (Node x : ans) {
		printf("%lld", x.v);
		for (int y : x.edge)
			printf(" %lld", y);
		putchar('\n');
	}
	return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3696kb

input:

3 3 101
1 2 30
2 3 40
3 1 50

output:

5
60 1 2
81 1 2
20 1 3
30 2 3
71 2 1

result:

ok Participant found an answer (5 trees) and jury found an answer (5 trees)

Test #2:

score: 0
Accepted
time: 1ms
memory: 3696kb

input:

2 2 37
1 2 8
1 2 15

output:

3
23 1
15 2
22 1

result:

ok Participant found an answer (3 trees) and jury found an answer (3 trees)

Test #3:

score: 0
Accepted
time: 0ms
memory: 3608kb

input:

5 4 5
1 3 1
2 3 2
2 5 3
4 1 4

output:

-1

result:

ok Both jury and participant did not find an answer

Test #4:

score: 0
Accepted
time: 0ms
memory: 3676kb

input:

10 15 997
4 3 459
9 7 94
9 8 767
10 2 877
5 8 258
3 4 166
8 5 621
8 10 619
9 1 316
10 5 516
3 10 125
1 7 961
3 6 500
4 10 976
3 4 842

output:

-1

result:

ok Both jury and participant did not find an answer

Test #5:

score: 0
Accepted
time: 0ms
memory: 3824kb

input:

20 30 9973
1 10 696
3 8 2905
12 7 6609
20 10 1962
11 9 8430
19 2 412
6 3 6936
19 7 9113
14 15 5635
15 7 1770
13 10 3182
3 16 2625
17 1 7387
11 5 3700
9 15 1048
2 3 7717
12 10 8625
7 13 8141
5 14 2245
6 4 2819
18 19 8709
18 5 6191
17 10 7606
9 20 8626
17 4 8848
4 13 1073
10 8 2277
14 2 7714
11 8 5318...

output:

59
9375 1 4 24 5 14 19 9 10 3 8 6 16 2 7 20 25 26 12 21
7534 1 4 24 5 14 19 9 10 3 8 6 16 2 20 25 26 12 21 7
2439 1 4 24 5 14 19 9 10 3 8 6 16 2 20 25 26 12 21 18
9307 1 4 24 5 14 19 9 10 3 8 6 16 2 7 20 25 26 12 21
666 1 4 24 5 14 19 9 10 3 8 6 16 2 7 20 25 26 12 22
7207 1 4 24 5 14 19 9 10 8 6 16 ...

result:

ok Participant found an answer (59 trees) and jury found an answer (59 trees)

Test #6:

score: 0
Accepted
time: 1ms
memory: 3684kb

input:

50 80 99991
6 5 67664
39 4 74944
11 9 13035
13 48 81979
40 20 57943
20 31 72081
1 6 39307
48 39 3550
28 48 41071
18 28 42935
37 32 7538
37 29 3815
50 37 88043
38 41 7283
40 26 66278
37 34 60696
47 19 80875
4 26 67
20 32 91858
39 24 83485
45 25 12241
48 46 61691
37 44 47541
39 40 70034
37 42 25006
27...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #7:

score: 0
Accepted
time: 1ms
memory: 3712kb

input:

100 150 999983
84 10 999545
69 48 930138
48 13 303468
36 6 668122
91 84 115623
62 71 59711
12 37 749281
86 49 281976
26 46 624831
91 8 450475
92 55 460900
50 63 513056
72 2 477622
26 96 11359
31 82 953946
6 71 406339
24 7 177090
70 4 67359
31 39 795565
47 32 407459
26 35 760698
22 37 508175
8 93 612...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #8:

score: 0
Accepted
time: 1ms
memory: 3672kb

input:

200 250 9999991
170 185 3242943
70 17 6083198
137 55 4000889
15 171 1113989
108 65 7988488
192 37 8812990
53 143 8707264
80 180 2504807
55 163 2706048
67 64 6210980
87 165 7693967
155 122 8550804
56 99 7228534
114 138 7047731
190 196 6684929
86 197 8866886
38 195 6717874
112 133 7257617
160 104 3210...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #9:

score: 0
Accepted
time: 1ms
memory: 3904kb

input:

500 600 99999989
265 416 47066772
354 266 16969437
195 415 7917612
354 136 43128175
163 191 58723996
144 84 65835385
157 45 94124747
232 441 17509499
70 397 64101208
223 387 7043647
320 47 84970673
100 2 87310855
87 131 75042257
101 391 27645446
79 26 68547739
390 185 92142961
257 15 80922292
276 48...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #10:

score: 0
Accepted
time: 1ms
memory: 4020kb

input:

500 700 99999989
250 2 71289880
454 447 70661327
328 253 57519343
11 201 67456781
294 99 23392419
215 322 61059212
411 389 69899684
488 429 89579827
437 79 60564061
413 380 34922641
477 372 14858185
156 44 3101349
88 8 52225146
115 26 8582010
171 237 33206748
237 495 31192017
146 32 62712576
209 352...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #11:

score: 0
Accepted
time: 1ms
memory: 4108kb

input:

500 800 99999989
258 304 1237432
159 152 6684056
8 47 64155938
436 265 83092505
204 302 3892712
142 302 77925167
37 15 20298972
202 395 35856655
284 260 96812598
365 172 48834835
196 101 64871741
174 45 37729972
302 206 90932677
305 275 27712443
443 157 81820535
16 248 22708463
461 479 64749118
105 ...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #12:

score: 0
Accepted
time: 1ms
memory: 4272kb

input:

500 900 99999989
122 188 44796717
73 121 56798468
334 358 95823235
485 453 96779071
209 391 45946094
332 168 91056077
481 483 81268636
148 393 25213027
107 214 99281713
493 46 61525618
472 355 74320568
258 482 99615552
159 393 20311839
411 121 5207095
20 131 65269699
45 339 51772607
195 292 64556504...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #13:

score: 0
Accepted
time: 2ms
memory: 4244kb

input:

500 1000 99999989
75 20 25003980
292 19 89418683
353 246 74910681
183 201 97535184
254 421 50614221
15 396 86624029
82 13 67776336
86 70 62843451
279 3 55801636
29 425 30024776
176 243 16631048
498 363 77415492
55 305 80862521
213 110 30693079
432 358 99667002
201 30 44433122
97 203 16284993
118 490...

output:

-1

result:

ok Both jury and participant did not find an answer

Test #14:

score: 0
Accepted
time: 1ms
memory: 3812kb

input:

500 499 999999937
287 228 350409600
392 107 350409600
458 22 350409600
362 425 350409600
368 136 350409600
364 71 350409600
211 265 350409600
167 116 350409600
195 353 350409600
489 477 350409600
380 85 350409600
281 15 350409600
263 247 350409600
453 122 350409600
104 187 350409600
331 223 35040960...

output:

1
350409600 214 267 66 113 137 376 28 30 432 370 389 364 42 399 117 272 241 35 285 232 329 483 227 244 11 419 333 47 24 171 83 306 258 61 324 19 298 231 216 280 464 249 439 206 134 336 383 43 158 86 179 436 470 135 192 475 366 388 265 72 348 368 458 484 401 130 136 235 450 52 3 199 417 266 477 166 4...

result:

ok Participant found an answer (1 trees) and jury found an answer (1 trees)

Test #15:

score: 0
Accepted
time: 7ms
memory: 4404kb

input:

500 510 999999937
417 280 770450784
207 303 770450784
472 396 770450784
345 191 964169440
164 67 770450784
492 302 770450784
5 71 770450784
386 22 770450784
77 25 487491058
430 467 770450784
148 95 770450784
288 215 770450784
55 451 10190666
215 69 770450784
267 195 770450784
487 283 770450784
435 3...

output:

257
770450784 381 49 153 33 160 116 499 187 4 415 222 50 95 19 28 55 411 361 375 82 61 9 265 30 440 85 173 59 201 252 147 214 262 191 431 3 359 110 23 150 74 8 244 259 205 473 443 17 398 355 353 139 68 216 58 32 363 131 41 352 482 496 70 292 442 155 158 319 407 31 80 373 130 83 99 132 91 129 21 264 ...

result:

ok Participant found an answer (257 trees) and jury found an answer (257 trees)

Test #16:

score: -100
Wrong Answer
time: 1ms
memory: 3600kb

input:

500 525 999999937
439 54 982774700
417 443 87702331
21 82 982774700
39 477 982774700
363 493 982774700
500 161 982774700
86 44 982774700
312 47 982774700
120 282 982774700
224 254 670954686
268 311 59221562
216 242 982774700
16 256 505585800
448 102 982774700
362 295 555877345
76 210 819076841
53 24...

output:

145148322 754380511

result:

wrong answer Integer parameter [name=t] equals to 145148322, violates the range [-1, 1050]