Repository navigation
Expand file tree
/
Copy path1729_F.cpp
More file actions
64 lines (61 loc) · 1.85 KB
/
Copy path1729_F.cpp
File metadata and controls
64 lines (61 loc) · 1.85 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
void solve(){
string str; cin >> str;
int N = str.size();
int w, M; cin >> w >> M;
vector<vector<int>> arr(9);
int init = 0;
for (int i = 0; i < w; i++) init = (init + str[i] - '0') % 9;
arr[init].push_back(1);
for (int i = 1; i + w <= N; i++) {
init -= str[i-1] - '0';
init += str[i+w-1] - '0';
init = (init + 9) % 9;
arr[init].push_back(i+1);
}
int prefix[N]; memset(prefix, 0, sizeof prefix);
for (int i = 0; i < N; i++) {
if (i) prefix[i] += prefix[i-1];
prefix[i] *= 10;
prefix[i] += str[i] - '0';
prefix[i] %= 9;
}
while (M--) {
int l,r,k; cin >> l >> r >> k;
int n = (prefix[r-1] + 9 - (l==1?0:prefix[l-2])) % 9;
int rl = -1, rr = -1;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
if (arr[i].size() && arr[j].size()) {
if ((i * n + j) % 9 == k) {
int first = arr[i][0];
int last = arr[j][0];
if (i == j && arr[j].size() >= 2) last = arr[j][1];
else if (i == j) continue;
if (rl == -1) {
rl = first;
rr = last;
}
if (rl > first || (rl == first && rr > last)) {
rl = first;
rr = last;
}
}
}
}
}
cout << rl << ' ' << rr << '\n';
}
}
int main()
{
cin.tie(0)->sync_with_stdio(false);
int T = 1;
cin >> T;
while (T--) {
solve();
}
return 0;
}