# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1163005 | SmuggingSpun | Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) | C++20 | 73 ms | 98376 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
int n, m;
namespace sub12{
void solve(){
vector<int>w(n + 1);
for(int i = 1; i <= n; i++){
cin >> w[i];
}
vector<vector<int>>dp(n + 1, vector<int>(n + 1));
for(int i = 1; i <= n; i++){
dp[i][i] = 0;
int prev_max = w[i];
for(int j = i + 1; j <= n; j++){
if(w[j] >= prev_max){
dp[i][j] = dp[i][j - 1];
prev_max = w[j];
}
else{
dp[i][j] = max(dp[i][j - 1], w[j] + prev_max);
}
}
}
for(int _ = 0; _ < m; _++){
int l, r, k;
cin >> l >> r >> k;
cout << int(k >= dp[l][r]) << "\n";
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> m;
if(max(n, m) <= 5000){
sub12::solve();
}
}
컴파일 시 표준 에러 (stderr) 메시지
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |