# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
883319 | 2023-12-05T07:11:57 Z | AI_2512 | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++17 | 3000 ms | 66872 KB |
#include <bits/stdc++.h> using namespace std; int main() { long long n,m; cin >> n >> m; vector<int> books(n); vector<vector<int>> days(m,vector<int>(3)); for (int i = 0; i <n; i++){ cin >> books[i]; } for (int i = 0; i<m; i++){ int l,r,ki; cin >> l >> r >> ki; vector<int> vec(books.begin()+l-1, books.begin()+r); bool broken = false; for (int k = 0;k < vec.size()-1;k++){ if (vec[k] > vec[k+1]){ if (vec[k]+vec[k+1] <= ki){ swap(vec[k], vec[k+1]); }else{ broken = true; break; } } } if (broken){ cout << 0 << "\n"; }else{ cout << 1 << "\n"; } } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 9 ms | 604 KB | Output is correct |
12 | Correct | 7 ms | 604 KB | Output is correct |
13 | Correct | 8 ms | 604 KB | Output is correct |
14 | Correct | 15 ms | 604 KB | Output is correct |
15 | Correct | 12 ms | 604 KB | Output is correct |
16 | Correct | 22 ms | 776 KB | Output is correct |
17 | Correct | 22 ms | 604 KB | Output is correct |
18 | Correct | 22 ms | 792 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3031 ms | 66872 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1470 ms | 7324 KB | Output is correct |
2 | Execution timed out | 3050 ms | 7036 KB | Time limit exceeded |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 9 ms | 604 KB | Output is correct |
12 | Correct | 7 ms | 604 KB | Output is correct |
13 | Correct | 8 ms | 604 KB | Output is correct |
14 | Correct | 15 ms | 604 KB | Output is correct |
15 | Correct | 12 ms | 604 KB | Output is correct |
16 | Correct | 22 ms | 776 KB | Output is correct |
17 | Correct | 22 ms | 604 KB | Output is correct |
18 | Correct | 22 ms | 792 KB | Output is correct |
19 | Execution timed out | 3026 ms | 13648 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Correct | 0 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 1 ms | 348 KB | Output is correct |
6 | Correct | 1 ms | 348 KB | Output is correct |
7 | Correct | 1 ms | 348 KB | Output is correct |
8 | Correct | 1 ms | 348 KB | Output is correct |
9 | Correct | 1 ms | 348 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 9 ms | 604 KB | Output is correct |
12 | Correct | 7 ms | 604 KB | Output is correct |
13 | Correct | 8 ms | 604 KB | Output is correct |
14 | Correct | 15 ms | 604 KB | Output is correct |
15 | Correct | 12 ms | 604 KB | Output is correct |
16 | Correct | 22 ms | 776 KB | Output is correct |
17 | Correct | 22 ms | 604 KB | Output is correct |
18 | Correct | 22 ms | 792 KB | Output is correct |
19 | Execution timed out | 3031 ms | 66872 KB | Time limit exceeded |
20 | Halted | 0 ms | 0 KB | - |