-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path23253.h
57 lines (48 loc) · 931 Bytes
/
23253.h
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
#pragma once
#include <iostream>
#include <vector>
#include <climits>
using namespace std;
vector<vector<int>> books = vector<vector<int>>();
int bookAmount[200000];
int N, M;
bool isSorted(vector<int> v) {
if (v.empty())
return true;
bool ret = true;
int previous = INT_MAX;
for (int i = 0; i < v.size(); i++) {
if (previous < v[i]) {
ret = false;
break;
}
previous = v[i];
}
return ret;
}
int main_23253() {
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> N;
cin >> M;
for (int i = 0; i < M; i++) {
int input;
cin >> input;
bookAmount[i] = input;
books.push_back(vector<int>());
for (int j = 0; j < bookAmount[i]; j++) {
cin >> input;
books[i].push_back(input);
}
}
bool isOk = true;
for(int i = 0; i < M; i++) { //i´Â Ã¥¹øÈ£
if (!isSorted(books[i])) {
isOk = false;
break;
}
}
string answer = isOk ? "Yes" : "No";
cout << answer << endl;
return 0;
}