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

10 3
1 2 3
1 4 6
1 6 8
1 9 1
2 3 4
2 4 1
2 9 0
3 0 1
4 6 7
7 8 4
10 
1 2 3
1 4 6
1 4 7
1 9 1
1 9 2
2 2 2
2 3 4
3 0 1
3 0 2
7 8 4

6 3 1 2 3 1 4 6 1 6 8 1 9 1 2 3 4 9 9 9 3 1 2 3 1 2 6 2 3 4
6 3 1 2 3 1 4 6 1 6 8 1 9 1 2 3 4 9 9 9 3 1 2 2 1 3 1 9 8 9
6 3 1 2 3 1 4 6 1 6 8 1 9 1 2 3 4 9 9 9 3 1 6 8 1 9 1 9 9 9

3 10 1 1 1 1 1 1 1 1 1 1 2 2 2 2 2 2 2 2 2 2 3 3 3 3 3 3 3 3 3 3 3 1 1 1 1 1 1 1 1 1 1 3 3 3 3 3 3 3 3 3 3 2 2 2 2 2 2 2 2 2 2

2 5
1 2 3 4 5
2 3 4 5 6
5
1 1 2 3 4
1 2 3 4 5
1 2 3 4 6
2 3 4 5 5
2 3 4 5 6
stdout
DA
DA
NU
NU
DA
NU
NU
DA