제출 #673253

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

sortbooks

#include <bits/stdc++.h>
// include <ext/pb_ds/assoc_container.hpp>
// include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
// define ordered_set tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update>
#define mpr make_pair
#define ln '\n'
void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
#define int long long
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n, m; cin >> n >> m;
    vector <int> p(n);
    for ( auto &i: p ) cin >> i;
    auto ok = [&](int l, int r, int k){
        vector <int> sorted, _list;
        --l, --r;
        for ( int i = l; i <= r; i++ ) sorted.pb(p[i]), _list.pb(p[i]);
        sort(all(sorted));
        for ( int i = 0; i < (int)_list.size(); i++ ){
            for ( int j = 0; j+1 < (int)_list.size(); j++ ){
                if ( _list[j] > _list[j+1] and _list[j]+_list[j+1] <= k ) swap(_list[j], _list[j+1]);
            }
        }
        return sorted == _list;
    };
    while ( m-- ){
        int l, r, k; cin >> l >> r >> k;
        cout << ok(l, r, k) << ln;
    }

    cout << '\n';
}

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

sortbooks.cpp: In function 'void IO(std::string)':
sortbooks.cpp:11:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:11:70: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 | void IO(string name){freopen((name+".in").c_str(),"r",stdin); freopen((name+".out").c_str(),"w",stdout);}
      |                                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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