fork download
  1. #include <iostream>
  2. using namespace std;
  3.  
  4. const int MAX_SIZE = 1000;
  5.  
  6. int main() {
  7. int n, m, q, mt[MAX_SIZE + 1][MAX_SIZE + 1], v[MAX_SIZE + 1];
  8. cin >> n >> m;
  9. for (int i = 1; i <= n; ++i) {
  10. for (int j = 1; j <= m; ++j) {
  11. cin >> mt[i][j] ;
  12. }
  13. }
  14. cin >> q;
  15. while (q) {
  16. for (int j = 1; j <= m; ++j) {
  17. cin >> v[j];
  18. }
  19. int stanga = 1, dreapta = n, midle;
  20. while (stanga < dreapta) {
  21. midle = (stanga + dreapta) / 2 + 1;
  22. if (mt[midle][1] > v[1]) {
  23. dreapta = midle - 1;
  24. } else {
  25. stanga = midle;
  26. }
  27. }
  28. int flag = 1;
  29.  
  30. cout << mt[stanga][stanga] <<" " << stanga <<" ";
  31. if (flag == 1) {
  32. cout << "DA\n";
  33. } else {
  34. cout << "NU\n";
  35. }
  36. --q;
  37. }
  38. return 0;
  39. }
Success #stdin #stdout 0.01s 5296KB
stdin
3 4 
1 2 3 4 
2 3 4 5 
3 4 5 6 
3
4 5 9 8 
5 2 3 6 
4 5 6 6 
stdout
5 3 DA
5 3 DA
5 3 DA