QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#792705#9544. Grand Prix of BallanceprokingAC ✓29ms4880kbC++142.0kb2024-11-29 13:13:412024-11-29 13:13:41

Judging History

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

  • [2024-11-29 13:13:41]
  • 评测
  • 测评结果:AC
  • 用时:29ms
  • 内存:4880kb
  • [2024-11-29 13:13:41]
  • 提交

answer

#include <bits/stdc++.h>

#define F(i, a, b) for (int i = a; i <= b; i ++)
#define G(i, a, b) for (int i = a; i >= b; i --)
#define outarr(a, L, R) { printf(#a"[%d..%d] = ", L, R); F(i, L, R) W(a[i]), putc(' '); putc('\n'); }
#define out4(x, y, z, w) { printf(#x" = %d", x); printf(" "#y" = %d", y); printf(" "#z" = %d", z), printf(" "#w" = %d", w), putc('\n'); }
#define out3(x, y, z) { printf(#x" = %d", x); printf(" "#y" = %d", y); printf(" "#z" = %d", z), putc('\n'); }
#define out2(x, y) { printf(#x" = %d", x); printf(" "#y" = %d", y); putc('\n'); }
#define out1(x) { printf(#x" = %d\n", x); }
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define mn(a, b) ((a) = min(a, b))
#define mem(a, b) memset(a, b, sizeof a)
#define ll long long
#define pi pair<int, int>
#define get getchar()
#define pb push_back
#define putc putchar
#define pb push_back
#define db double
#define fi first
#define se second

using namespace std;

template <typename Int>
void R(Int &x) {
	char c = get; x = 0; Int t = 1;
	for (; !isdigit(c); c = get) t = (c == '-' ? -1 : t);
	for (; isdigit(c); x = (x << 3) + (x << 1) + c - '0', c = get); x *= t;
}
template <typename Int>
void W(Int x) {
	if (x < 0) { putc('-'); x = - x; }
	if (x > 9) W(x / 10); putc(x % 10 + '0');
}
#define V vector <int>

int T, n, m, q, ty, id, x;

int main() {
//	freopen("data.in","r",stdin);

	for (R(T); T--; ) {
		R(n), R(m), R(q);
		int flag = - 1, res = 0;
		V bz(m + 1), v;
		vector <ll> f(m + 1);
		F(i, 1, q) {
			R(ty);
			if (ty == 1) {
				for (auto x : v) bz[x] = 0; v.clear();
				R(x), flag = x, res = m;
			}
			if (ty == 2 || ty == 3) {
				R(id), R(x);
				if (x != flag) continue;
				if (bz[id]) continue;
				v.pb(id);
				bz[id] = 1;
				if (ty == 2)
					f[id] += res, res --;
			}
		}
		vector <int> g(m + 1);
		F(i, 1, m) g[i] = i;
		sort(g.begin() + 1, g.end(), [&](int a, int b) {
			return f[a] == f[b] ? a < b : f[a] > f[b];
		});
		F(i, 1, m)
			W(g[i]), putc(' '), W(f[g[i]]), putc('\n');
	}
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

3
3 4 6
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
3 4 8
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
1 1
2 1 1
3 4 7
1 2
2 1 1
2 2 2
3 3 2
2 3 2
2 1 2
1 1

output:

2 4
1 3
3 0
4 0
1 7
2 4
3 0
4 0
2 4
1 3
3 0
4 0

result:

ok 12 lines

Test #2:

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

input:

10
18 8 8
2 1 6
1 13
2 1 18
3 8 13
2 7 14
2 5 11
3 6 13
3 1 13
26 7 11
1 22
2 7 22
1 9
2 6 24
1 2
1 18
3 3 4
2 3 18
1 26
3 7 1
3 2 26
1 3 33
3 3 1
2 3 1
2 2 1
1 1
2 1 1
2 1 1
3 1 1
3 3 1
3 2 1
3 3 1
2 2 1
2 2 1
3 3 1
2 2 1
2 2 1
3 3 1
2 3 1
2 3 1
3 3 1
2 3 1
2 2 1
2 2 1
2 2 1
2 1 1
3 2 1
2 2 1
3 2 1...

output:

1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
3 7
7 7
1 0
2 0
4 0
5 0
6 0
1 3
2 0
3 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
25 25
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 0
22 0
23 0
24 0
1 0
2 0
...

result:

ok 100 lines

Test #3:

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

input:

100
3 51 102
3 35 3
3 40 1
3 34 1
1 3
2 17 3
3 43 3
3 34 3
3 13 3
1 1
3 23 3
2 41 1
3 20 1
2 6 1
2 16 1
2 25 3
3 33 1
3 20 3
3 25 1
3 40 1
2 19 1
3 44 1
1 2
3 23 2
2 47 2
2 33 1
3 1 2
3 29 2
2 34 1
3 14 2
2 37 2
3 49 2
2 18 2
3 14 2
3 17 2
2 41 2
3 27 1
3 4 2
2 6 2
3 12 2
2 36 2
2 46 1
2 41 2
2 4 2
...

output:

41 99
6 97
16 79
17 51
47 51
37 50
18 49
19 48
36 46
31 45
8 44
34 43
25 42
5 41
42 40
39 39
33 38
46 37
40 36
9 35
3 34
20 33
2 32
7 31
1 0
4 0
10 0
11 0
12 0
13 0
14 0
15 0
21 0
22 0
23 0
24 0
26 0
27 0
28 0
29 0
30 0
32 0
35 0
38 0
43 0
44 0
45 0
48 0
49 0
50 0
51 0
10 44
18 44
20 44
3 22
11 22
1...

result:

ok 10000 lines

Test #4:

score: 0
Accepted
time: 24ms
memory: 4828kb

input:

2
100000 26255 8528
3 4320 94863
2 22821 94863
1 18284
1 10553
1 77620
3 6565 67064
2 22073 77620
2 9092 77620
1 562
2 16938 562
1 65706
3 2856 65706
2 7875 65706
1 64045
3 16548 64045
3 19294 95518
2 9632 84434
1 88879
3 10505 92079
1 36584
2 2639 93669
3 5313 93284
2 2904 36584
1 23511
1 93889
3 5...

output:

14402 78759
1577 52510
2893 52510
3001 52510
4019 52510
4132 52510
5336 52510
9160 52510
12161 52510
12268 52510
15862 52510
18707 52510
20497 52510
21818 52510
23244 52510
54 52509
2198 52509
2436 52509
4422 52509
6125 52509
6403 52509
9552 52509
9842 52509
13288 52509
17682 52509
23798 52509
25727...

result:

ok 126255 lines

Test #5:

score: 0
Accepted
time: 22ms
memory: 4704kb

input:

2
100000 100000 200000
1 69331
2 73475 69331
1 58337
2 73475 58337
1 53081
2 73475 53081
1 27731
2 73475 27731
1 67757
2 73475 67757
1 72765
2 73475 72765
1 50329
2 73475 50329
1 71224
2 73475 71224
1 3277
2 73475 3277
1 99398
2 73475 99398
1 13147
2 73475 13147
1 47854
2 73475 47854
1 63514
2 73475...

output:

73475 10000000000
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 0
22 0
23 0
24 0
25 0
26 0
27 0
28 0
29 0
30 0
31 0
32 0
33 0
34 0
35 0
36 0
37 0
38 0
39 0
40 0
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 0
49 0
50 0
51 0
52 0
53 0
54 0
55 0
56 0
57 0
58 0
5...

result:

ok 200000 lines

Test #6:

score: 0
Accepted
time: 28ms
memory: 4684kb

input:

10000
1 85 12
2 50 1
2 35 1
2 58 1
2 18 1
1 1
3 8 1
3 46 1
2 36 1
2 22 1
2 71 1
3 39 1
3 53 1
77 25 53
1 4
1 13
1 39
1 76
2 21 59
3 20 76
2 24 76
2 3 29
2 1 54
1 59
1 44
2 18 44
3 2 9
1 58
1 68
3 7 25
3 19 67
2 23 68
1 27
2 15 27
1 34
2 21 34
3 17 4
3 15 2
3 13 34
3 11 34
3 25 28
1 2
1 45
3 23 45
1 ...

output:

36 85
22 84
71 83
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 0
23 0
24 0
25 0
26 0
27 0
28 0
29 0
30 0
31 0
32 0
33 0
34 0
35 0
37 0
38 0
39 0
40 0
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 0
49 0
50 0
51 0
52 0
53 0
54 0
55 0
56 0
57 0
58 0
59 0
60 0
6...

result:

ok 400000 lines

Test #7:

score: 0
Accepted
time: 29ms
memory: 4880kb

input:

100
74 1452 1875
3 49 55
1 71
3 1067 71
2 1154 67
1 7
3 1128 7
3 377 7
1 62
2 893 62
2 1084 62
1 21
1 53
1 58
3 681 48
2 1281 58
2 462 16
2 486 4
2 1360 58
3 454 10
2 182 58
2 1076 6
3 414 44
2 484 42
3 104 58
2 1320 62
2 19 58
2 15 58
2 1278 60
3 1048 73
3 291 31
2 1320 58
1 29
1 15
2 438 15
3 1377...

output:

742 4215
1320 2899
1284 2891
761 2858
726 2826
375 2805
1346 2798
1316 2788
12 2782
1197 2713
645 2708
609 2701
483 2700
1022 2625
297 2573
1281 2539
1287 2529
101 2519
114 1452
145 1452
199 1452
247 1452
314 1452
438 1452
553 1452
667 1452
670 1452
698 1452
756 1452
781 1452
893 1452
995 1452
1033 ...

result:

ok 200000 lines

Test #8:

score: 0
Accepted
time: 27ms
memory: 3640kb

input:

10000
19 3 36
2 1 6
2 3 2
3 1 6
3 1 6
3 2 1
2 2 6
2 2 13
2 2 6
1 16
1 12
3 3 12
3 1 18
2 1 15
1 18
3 2 18
2 1 18
3 2 18
2 2 18
3 3 18
3 2 18
2 2 7
1 9
2 3 19
3 3 9
2 1 9
3 3 17
2 3 12
1 5
2 3 13
3 2 6
3 2 5
2 1 5
3 1 5
3 2 11
2 2 13
1 14
27 118 3
3 41 22
3 51 22
3 101 22
38 28 17
1 4
2 17 16
1 26
2 ...

output:

1 9
2 0
3 0
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 0
12 0
13 0
14 0
15 0
16 0
17 0
18 0
19 0
20 0
21 0
22 0
23 0
24 0
25 0
26 0
27 0
28 0
29 0
30 0
31 0
32 0
33 0
34 0
35 0
36 0
37 0
38 0
39 0
40 0
41 0
42 0
43 0
44 0
45 0
46 0
47 0
48 0
49 0
50 0
51 0
52 0
53 0
54 0
55 0
56 0
57 0
58 0
59 0
60...

result:

ok 400000 lines

Extra Test:

score: 0
Extra Test Passed