답안 #883327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
883327 2023-12-05T07:24:28 Z AI_2512 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
17 / 100
3000 ms 66892 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 < r-l;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;
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 348 KB Output is correct
11 Correct 7 ms 604 KB Output is correct
12 Correct 7 ms 616 KB Output is correct
13 Correct 13 ms 604 KB Output is correct
14 Correct 13 ms 780 KB Output is correct
15 Correct 12 ms 604 KB Output is correct
16 Correct 28 ms 780 KB Output is correct
17 Correct 23 ms 860 KB Output is correct
18 Correct 23 ms 856 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3044 ms 66892 KB Time limit exceeded
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1672 ms 7076 KB Output is correct
2 Execution timed out 3055 ms 6888 KB Time limit exceeded
3 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 348 KB Output is correct
11 Correct 7 ms 604 KB Output is correct
12 Correct 7 ms 616 KB Output is correct
13 Correct 13 ms 604 KB Output is correct
14 Correct 13 ms 780 KB Output is correct
15 Correct 12 ms 604 KB Output is correct
16 Correct 28 ms 780 KB Output is correct
17 Correct 23 ms 860 KB Output is correct
18 Correct 23 ms 856 KB Output is correct
19 Execution timed out 3054 ms 15700 KB Time limit exceeded
20 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 0 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 348 KB Output is correct
11 Correct 7 ms 604 KB Output is correct
12 Correct 7 ms 616 KB Output is correct
13 Correct 13 ms 604 KB Output is correct
14 Correct 13 ms 780 KB Output is correct
15 Correct 12 ms 604 KB Output is correct
16 Correct 28 ms 780 KB Output is correct
17 Correct 23 ms 860 KB Output is correct
18 Correct 23 ms 856 KB Output is correct
19 Execution timed out 3044 ms 66892 KB Time limit exceeded
20 Halted 0 ms 0 KB -