제출 #1093948

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1093948		KasymK	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	8 / 100	3021 ms	604 KiB

sortbooks

#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 5e3+5;
int v[N];

int main(){
    int n, q;
    scanf("%d%d", &n, &q);
    for(int i = 1; i <= n; ++i){
        int x;
        scanf("%d", &x);
        v[i] = x;
    }
    vector<int> A;
    int l, r, k;
    auto wow = [&]() -> bool {
        int mx = -1, sz = (int)A.size();
        for(int i = 0; i < sz; ++i)
            for(int j = i-1; j >= 0; --j)
                if(A[i] < A[j])
                    swap(A[i], A[j]), umax(mx, A[i]+A[j]);
        return (mx <= k);
    };
    while(q--){
        scanf("%d%d%d", &l, &r, &k);
        for(int i = l; i <= r; ++i)
            A.pb(v[i]);
        // hazel eyes with green flecks ---> the only thing, that I enjoy of looking...
        bool ok = wow();
        puts(ok ? "1" : "0");
        A.clear();
    }
    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

sortbooks.cpp: In function 'int main()':
sortbooks.cpp:20:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     scanf("%d%d", &n, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~
sortbooks.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d", &x);
      |         ~~~~~^~~~~~~~~~
sortbooks.cpp:37:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         scanf("%d%d%d", &l, &r, &k);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 8 / 8
• Subtask 2: 0 / 9
• Subtask 3: 0 / 13
• Subtask 4: 0 / 17
• Subtask 5: 0 / 30
• Subtask 6: 0 / 23