Repository navigation
Expand file tree
/
Copy pathF.cpp
More file actions
58 lines (56 loc) · 1.26 KB
/
Copy pathF.cpp
File metadata and controls
58 lines (56 loc) · 1.26 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
#include <algorithm>
#include <iostream>
#include <vector>
int BinSearch(std::vector<std::vector<int> >& a,
std::vector<std::vector<int> >& b, int i, int j, int l) {
int left = 0;
int right = l - 1;
while (right - left > 1) {
int mid = (right + left) / 2;
if (a[i][mid] - b[j][mid] <= 0) {
left = mid;
} else {
right = mid;
}
}
int ans1 = std::max(a[i][left], b[j][left]);
int ans2 = std::max(a[i][right], b[j][right]);
if (ans1 < ans2) {
return left + 1;
}
return right + 1;
}
int main() {
int n;
int m;
int l;
std::cin >> n >> m >> l;
std::vector<std::vector<int> > a(n, std::vector<int>(l));
std::vector<std::vector<int> > b(m, std::vector<int>(l));
for (int i = 0; i < n; ++i) {
for (int j = 0; j < l; ++j) {
std::cin >> a[i][j];
}
}
for (int i = 0; i < m; ++i) {
for (int j = 0; j < l; ++j) {
std::cin >> b[i][j];
}
}
int q;
std::cin >> q;
for (int iter = 0; iter < q; ++iter) {
int i;
int j;
std::cin >> i >> j;
i--;
j--;
if (a[i][0] - b[j][0] >= 0) {
std::cout << 1 << "\n";
} else if (a[i][l - 1] - b[j][l - 1] <= 0) {
std::cout << l << "\n";
} else {
std::cout << BinSearch(a, b, i, j, l) << "\n";
}
}
}