oj.uz

답안 #651198

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
651198 2022-10-18T02:32:53 Z alexccc Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
0 / 100
 3000 ms 4656 KB 
#include <bits/stdc++.h> 

using namespace std;

int main(){

    int n, m;
    cin >> n >> m;
    vector<int> w(n + 1);
    for(int i = 1; i <= n; i ++) cin >> w[i];
    int l, r, k;
    for(int i = 0; i < m; i ++){
        cin >> l >> r >> k;
        int mx = w[l];
        int check = 1;
        for(int j = l; j <= r; j ++){
            if(w[i] < mx && mx + w[i] > k){
                check = 0;
                break;
            }
            mx = max(mx,w[i]);
        }
        cout << check << '\n';
    }


    return 0;
    
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3055 ms 4656 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2117 ms 1716 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 2 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -