35 lines
831 B
C++
35 lines
831 B
C++
#include <iostream>
|
|
#include <vector>
|
|
using namespace std;
|
|
int main(){
|
|
int m, n, k;
|
|
cin >> m >> n >> k;
|
|
vector<int> st;
|
|
vector<vector<int>> data(k, vector<int>(n));
|
|
for(int i = 0; i < k; ++i){
|
|
for(int j = 0; j < n; ++j){
|
|
int a; cin >> a;
|
|
data[i][j] = a;
|
|
}
|
|
}
|
|
|
|
//模拟输入
|
|
for(int i = 0; i < k; ++i){
|
|
int p = 0;
|
|
bool flag = true;
|
|
for(int j = 1; j <= n; ++j){
|
|
st.push_back(j);
|
|
if(st.size() > m){
|
|
flag = false;
|
|
break;
|
|
}
|
|
while(data[i][p] == st.back() && !st.empty()) {
|
|
st.pop_back();
|
|
p++;
|
|
}
|
|
}
|
|
cout << ((st.empty() && flag == true) ? "YES" : "NO") << endl;
|
|
st.clear();
|
|
}
|
|
return 0;
|
|
} |