oj.uz

Submission #883317

# Submission time Handle Problem Language Result Execution time Memory
883317 2023-12-05T07:00:13 Z AI_2512 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
 3000 ms 67112 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){
                    int t = vec[k];
                    vec[k] = vec[k+1];
                    vec[k+1] = t;
                }else{
                    broken = true;
                    break;
                }
            }
        }
        if (broken){
            cout << 0 << "\n";
        }else{
            cout << 1 << "\n";
        }
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:18:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   18 |         for (int k = 0;k < vec.size()-1;k++){
      |                        ~~^~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 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 13 ms 600 KB Output is correct
15 Correct 12 ms 768 KB Output is correct
16 Correct 22 ms 604 KB Output is correct
17 Correct 22 ms 604 KB Output is correct
18 Correct 21 ms 604 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3038 ms 67112 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1464 ms 7108 KB Output is correct
2 Execution timed out 3031 ms 7032 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 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 13 ms 600 KB Output is correct
15 Correct 12 ms 768 KB Output is correct
16 Correct 22 ms 604 KB Output is correct
17 Correct 22 ms 604 KB Output is correct
18 Correct 21 ms 604 KB Output is correct
19 Execution timed out 3031 ms 13668 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 7 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 13 ms 600 KB Output is correct
15 Correct 12 ms 768 KB Output is correct
16 Correct 22 ms 604 KB Output is correct
17 Correct 22 ms 604 KB Output is correct
18 Correct 21 ms 604 KB Output is correct
19 Execution timed out 3038 ms 67112 KB Time limit exceeded
20 Halted 0 ms 0 KB -