oj.uz

Submission #883289

# Submission time Handle Problem Language Result Execution time Memory
883289 2023-12-05T04:42:00 Z AI_2512 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
8 / 100
 3000 ms 77068 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++){
        cin >>days[i][0] >> days[i][1] >> days[i][2];
        vector<int> vec(books.begin()+days[i][0]-1, books.begin()+days[i][1]);
        bool broken = false;
        while (is_sorted(vec.begin(), vec.end()) == false){
            for (int k = 0;k < vec.size()-1;k++){
                if (vec[k] > vec[k+1]){
                    if (vec[k]+vec[k+1] <=days[i][2]){
                        int t = vec[k];
                        vec[k] = vec[k+1];
                        vec[k+1] = t;
                    }else{
                        broken = true;
                        break;
                    }
                }
            }
            if (broken){
                    break;
            }
        }
        if (broken){
            cout << 0 << "\n";
        }else{
            cout << 1 << "\n";
        }
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:18:30: 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 348 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 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct

Subtask #2
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 9 ms 604 KB Output is correct
12 Correct 15 ms 1056 KB Output is correct
13 Correct 21 ms 700 KB Output is correct
14 Correct 52 ms 700 KB Output is correct
15 Correct 14 ms 856 KB Output is correct
16 Execution timed out 3020 ms 856 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

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

Subtask #4
0 / 17.0

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

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 9 ms 604 KB Output is correct
12 Correct 15 ms 1056 KB Output is correct
13 Correct 21 ms 700 KB Output is correct
14 Correct 52 ms 700 KB Output is correct
15 Correct 14 ms 856 KB Output is correct
16 Execution timed out 3020 ms 856 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 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 1 ms 348 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 9 ms 348 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 9 ms 604 KB Output is correct
12 Correct 15 ms 1056 KB Output is correct
13 Correct 21 ms 700 KB Output is correct
14 Correct 52 ms 700 KB Output is correct
15 Correct 14 ms 856 KB Output is correct
16 Execution timed out 3020 ms 856 KB Time limit exceeded
17 Halted 0 ms 0 KB -