QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#368047	#7977. 彩虹航线	zhaohaikun	3	56ms	48932kb	C++20	1.2kb	2024-03-26 19:08:41	2024-03-26 19:08:42

Judging History

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

[2024-03-26 19:08:42]
评测

测评结果：3
用时：56ms
内存：48932kb

查看

[2024-03-26 19:08:41]
提交

answer

// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
const int N = 151, M = N * N, T = 1e6 + 1;
int n, m, k, x[2][M], a[M], c[M][N];
unsigned short mp[2][N][T];
void dfs(int id, int f) {
	F(i, 1, k)
		if (!mp[0][x[0][id]][c[id][i]] && !mp[1][x[1][id]][c[id][i]]) {
			a[id] = c[id][i];
			F(j, 0, 1) mp[j][x[j][id]][c[id][i]] = id;
			return;
		}
	F(i, 1, k)
		if (!mp[f][x[f][id]][c[id][i]]) {
			int w = mp[f ^ 1][x[f ^ 1][id]][c[id][i]];
			a[id] = c[id][i];
			F(j, 0, 1) mp[w][x[w][id]][c[id][i]] = 0;
			F(j, 0, 1) mp[j][x[j][id]][c[id][i]] = id;
			return dfs(w, f ^ 1);
		}
}
signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	cin >> n >> m >> k;
	F(i, 1, m) {
		F(j, 0, 1) cin >> x[j][i];
		F(j, 1, k) cin >> c[i][j];
		dfs(i, 0);
	}
	F(i, 1, m) cout << a[i] << ' ';
	return 0;
}
/* why?
*/

源文件, 语言: C++20

详细

Subtask #1:

score: 1

Accepted

Test #1:

score: 1

Accepted

time: 0ms

memory: 8852kb

input:

output:

1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1

result:

ok construction is correct.

Test #2:

score: 0

Accepted

time: 3ms

memory: 6812kb

input:

150 150 1
117 132 96
147 4 114
67 57 60
62 94 20
48 117 68
31 144 27
19 44 121
3 51 92
83 52 67
26 125 56
8 124 75
125 31 52
79 8 21
132 14 136
77 111 45
134 136 145
129 73 85
122 92 143
59 76 36
60 127 115
102 126 133
10 106 32
93 35 106
75 47 102
45 140 41
44 108 146
25 98 106
140 116 76
143 3 87
...

output:

96 114 60 20 68 27 121 92 67 56 75 52 21 136 45 145 85 143 36 115 133 32 106 102 41 146 106 76 87 90 116 15 147 51 35 85 15 83 43 105 89 12 89 140 103 114 135 78 93 80 87 93 19 7 125 132 96 96 99 48 1 63 3 6 146 116 48 9 126 6 106 64 74 84 16 23 119 51 7 83 96 56 94 97 27 15 51 106 95 32 70 103 75 8...

result:

ok construction is correct.

Test #3:

score: 0

Accepted

time: 0ms

memory: 5840kb

input:

output:

1 2 1 1 1 1 1 2 1 2

result:

ok construction is correct.

Subtask #2:

score: 2

Accepted

Test #4:

score: 2

Accepted

time: 56ms

memory: 48932kb

input:

75 5625 150
11 6 680849 150419 731361 419631 223710 806977 837589 529911 568337 456216 515190 302854 672904 388629 548276 803173 770491 610684 550790 786097 253610 446581 705772 610053 637171 567249 365794 571846 431219 213414 466432 53255 748825 765338 761154 556712 159152 463622 706471 49434 59624...

output:

680849 124290 15612 557737 158942 192385 235793 769152 494833 786656 706961 179562 623504 384637 319911 538589 646445 182654 133375 167919 839028 430986 258463 733043 257852 48954 707925 759615 180153 738866 820974 796839 189152 345287 456191 534808 784528 237066 609402 13774 376476 28448 500736 422...

result:

ok construction is correct.

Test #5:

score: 0

Accepted

time: 34ms

memory: 10424kb

input:

75 5625 150
55 59 136 110 80 141 34 72 121 2 116 38 39 16 56 20 147 81 58 64 24 83 73 30 127 97 128 35 77 96 54 21 106 57 32 115 133 84 50 103 94 45 68 53 31 8 55 44 89 41 36 150 3 28 9 98 66 49 119 101 114 112 82 11 22 124 134 107 105 90 88 145 87 135 26 79 37 122 10 15 104 27 18 120 7 13 46 139 40...

output:

136 70 130 75 32 38 29 13 120 56 97 142 123 49 21 26 86 54 23 113 5 99 89 138 22 110 132 18 18 52 54 72 116 90 58 18 96 47 88 108 104 18 17 26 8 9 56 32 91 136 28 149 82 131 44 75 15 38 127 44 48 130 68 90 138 138 149 93 119 114 93 131 64 140 10 144 80 16 71 12 57 90 54 6 130 118 76 112 117 75 110 1...

result:

ok construction is correct.

Test #6:

score: 0

Accepted

time: 20ms

memory: 35068kb

input:

75 3750 150
1 29 15545 372923 77579 125076 509966 151564 332286 414939 296369 227609 9580 52174 99587 224186 2679 309545 38096 115252 281893 44718 259941 187595 500086 197842 267668 399469 254416 114691 268905 112134 257669 210411 135373 423915 537194 17707 204354 99757 234452 307155 82087 64190 309...

output:

15545 258915 129165 67229 472693 552406 146697 431843 406863 35443 208315 69147 134764 359917 406564 442868 153849 561136 548027 144054 467222 294395 349382 107391 408985 66032 380560 26261 109427 501390 539633 14950 439552 107122 536161 57467 29094 387263 16280 49644 358553 243796 156602 320287 976...

result:

ok construction is correct.

Test #7:

score: 0

Accepted

time: 23ms

memory: 8360kb

input:

75 3750 150
43 71 86 127 132 6 139 123 83 37 85 103 52 102 4 148 111 34 110 66 42 130 150 149 53 45 137 129 2 5 87 79 146 47 9 98 96 54 17 126 81 115 7 105 117 119 101 144 74 23 44 19 84 97 50 13 22 94 78 63 134 40 142 76 109 95 12 138 112 72 136 24 77 31 32 118 124 135 68 104 16 1 93 106 128 51 20 ...

output:

86 137 88 73 47 118 34 94 117 47 74 114 91 148 38 70 34 89 1 71 57 30 101 71 53 58 134 119 95 94 49 122 102 6 109 139 126 46 120 19 148 29 72 65 20 8 46 15 15 130 76 71 105 148 51 125 120 115 46 31 107 23 27 53 63 96 102 29 110 54 72 56 81 100 136 20 32 95 110 11 102 12 107 6 59 98 21 108 50 65 7 14...

result:

ok construction is correct.

Subtask #3:

score: 0

Runtime Error

Test #8:

score: 0

Runtime Error

input:

150 300 2
81 6 1 2
64 88 1 2
5 76 2 1
22 9 2 1
32 142 1 2
97 32 2 1
18 87 1 2
146 100 2 1
56 139 1 2
61 109 2 1
124 105 2 1
126 145 1 2
16 19 1 2
16 138 2 1
131 111 2 1
145 111 2 1
59 59 2 1
89 43 1 2
2 38 1 2
63 149 2 1
46 48 1 2
140 131 1 2
86 10 2 1
116 40 1 2
123 38 2 1
75 109 2 1
131 142 1 2
9 ...

output:

result:

Subtask #4:

score: 0

Runtime Error

Test #18:

score: 0

Runtime Error

input:

149 22201 150
106 24 20 90 56 109 85 33 76 25 97 77 134 75 15 24 88 16 93 126 43 94 116 120 28 130 21 140 70 111 71 32 29 41 132 39 84 62 27 92 55 117 129 125 127 104 74 114 14 145 36 121 22 69 68 133 59 65 58 148 131 40 54 118 110 3 61 105 4 112 142 122 73 37 1 113 45 87 57 89 103 98 100 63 146 106...

output:

result:

Subtask #5:

score: 0

Runtime Error

Test #23:

score: 0

Runtime Error

input:

150 22500 150
117 116 91 74 113 95 110 26 141 115 38 66 71 138 17 83 112 99 149 18 3 44 15 28 53 114 96 37 7 145 20 109 80 19 117 16 63 27 42 137 135 132 14 39 1 148 147 30 68 126 12 32 57 67 119 139 124 46 133 24 36 51 69 88 131 60 86 140 102 29 100 150 35 123 84 85 90 105 75 45 77 143 130 127 98 7...

output:

result:

Subtask #6:

score: 0

Runtime Error

Test #29:

score: 0

Runtime Error

input:

150 450 3
57 22 2 1 3
142 57 1 3 2
138 113 3 1 2
13 77 2 3 1
43 112 1 2 3
82 99 2 1 3
66 65 3 1 2
3 31 2 1 3
24 146 3 2 1
127 18 2 3 1
125 37 1 2 3
13 137 1 2 3
105 127 1 3 2
54 20 1 2 3
48 15 3 1 2
23 71 2 3 1
30 28 1 2 3
125 146 1 3 2
68 120 2 1 3
38 92 2 1 3
101 100 1 3 2
81 28 1 3 2
70 7 1 2 3
1...