QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#111220#5173. 染色Retrieve_720 0ms0kbC++141001b2023-06-06 12:10:122023-06-06 12:10:17

Judging History

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

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-06-06 12:10:17]
  • 评测
  • 测评结果:0
  • 用时:0ms
  • 内存:0kb
  • [2023-06-06 12:10:12]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int, int>
#define mp make_pair
#define fi first
#define se second 
#define deb(var) cerr << #var << '=' << var << "; "
#define int long long
int n, q, a[1000010], p[1000010], lst[1000010], f[1000010][25]; 
signed main() {
	cin >> n >> q;
	for (int i = 1; i <= 1e6; i++) p[i] = 2;
	for (int i = 3; i <= n + 2; i++) {
		cin >> a[i];
		lst[i] = p[a[i]]; p[a[i]] = i;
	}
	for (int i = 3; i <= n + 2; i++) lst[i] = max(lst[i - 1], lst[i]);
	memset(f, -1, sizeof f); lst[2] = 1;
	for (int i = 2; i <= n + 2; i++) {
		lst[i]--; 
		if (lst[i] == -1) lst[i] = n + 1;
		f[i][0] = lst[i];
		for (int j = 1; j < 25; j++) f[i][j] = f[f[i][j - 1]][j - 1];
	} 
	while (q--) {
		int l, r;
		cin >> l >> r; l += 2, r += 2; 
		if (l > r) swap(l, r);
		int ans = 2 * (r - l);
		for (int i = 25; i >= 0; i--)
			if (f[r][i] + 1 >= l) r = f[r][i], ans -= 1ll << i;
		cout << ans << "\n";
	}
	return 0;
}

详细

Subtask #1:

score: 0
Runtime Error

Test #1:

score: 0
Runtime Error

input:

10000 100
84 85 52 2 78 53 20 21 23 76 37 44 18 5 37 8 81 65 46 58 69 1 69 37 53 46 37 35 35 89 1 77 35 6 46 59 89 46 25 55 50 38 61 67 44 23 29 24 46 4 42 15 34 77 20 34 83 79 12 50 69 26 38 14 9 66 80 72 22 26 9 68 35 38 19 84 92 30 83 62 100 71 81 60 7 37 64 50 33 60 86 75 45 78 32 53 3 48 87 60 ...

output:


result:


Subtask #2:

score: 0
Runtime Error

Test #7:

score: 0
Runtime Error

input:

100000 100000
3 2 3 3 3 3 2 3 2 1 3 1 1 1 3 2 1 3 1 2 2 1 3 1 2 2 1 1 1 3 2 1 3 3 3 3 1 1 1 2 3 3 2 1 1 1 3 1 3 1 3 2 1 3 2 3 3 2 3 3 2 3 3 3 3 3 2 3 2 3 1 3 3 3 3 3 3 3 1 2 3 3 1 3 1 1 2 2 3 1 1 2 3 2 3 1 3 2 1 3 2 3 2 1 1 3 3 1 3 1 2 2 2 3 2 3 2 3 2 1 1 3 1 3 2 2 3 3 3 1 2 2 3 3 2 1 3 1 2 2 2 3 2 ...

output:


result:


Subtask #3:

score: 0
Runtime Error

Test #15:

score: 0
Runtime Error

input:

5000 5000
256 63 197 36 75 66 33 72 27 75 66 248 29 166 209 252 141 95 84 226 147 249 116 94 192 256 199 273 182 166 116 274 27 211 154 144 283 23 53 110 215 11 164 284 161 221 251 96 43 47 18 115 12 51 156 61 116 209 93 98 47 165 174 106 83 67 184 75 12 290 183 197 112 240 67 56 215 148 104 5 141 2...

output:


result:


Subtask #4:

score: 0
Runtime Error

Test #23:

score: 0
Runtime Error

input:

1000000 1000000
1105 3246 1880 3554 818 2331 2576 4140 149 4562 3498 3536 3400 4788 4363 4742 1216 4218 4032 1701 1489 4889 1761 3022 3145 4945 3067 4304 5016 4624 1612 13 1335 3613 1086 2210 386 3464 1156 3352 4341 5006 3465 3900 622 654 1826 2983 1250 4164 3335 4308 2995 1982 1347 4335 2535 5054 4...

output:


result: