제출 #1040415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1040415		vjudge1	Hedgehog Daniyar and Algorithms (IZhO19_sortbooks)	C++17	100 / 100	800 ms	65452 KiB

sortbooks

#include <bits/stdc++.h>
using namespace std;

#define f(i, a, b) for (int i = a; i <= b; i++)
#define fo(i, a, b) for (int i = a; i >= b; i--)
#define minimize(a, b) a = (a < b ? a : b)
#define maximize(a, b) a = (a > b ? a : b) 
#define fi first
#define se second
#define ll long long
#define pii pair <int, int>
#define pb push_back
#define pi acos(-1)
#define sz(a) (int)a.size()
#define getbit(a, b) (((a) >> (b)) & 1)
#define INOUT "main"
#define INFT 0x3f3f3f3f
#define debug(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
void err(istream_iterator<string> it) {}
template<typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args)
{
    cout << *it << " = [" << a << "]" << '\n';
    err(++it, args...);
}
#define debug1(a, st, en) { cout << #a << " = ["; int kt = false; f(i, st, en) {if (kt) cout << ", "; kt = true; cout << a[i];} cout << "]\n"; } 

void ctime()
{
    cerr << "\n" << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
}

void file()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    if (fopen(INOUT".INP", "r")) 
    {
        freopen(INOUT".INP", "r", stdin); 
        freopen(INOUT".OUT", "w", stdout);
    }
}

struct NEW
{
    int st, id, mood;
};

const int MX_N = 1e6 + 5;
int n, m;
int a[MX_N], t[MX_N * 4], res[MX_N];
vector <NEW> v[MX_N];

void UPDATE(int id, int l, int r, int pos, int val)
{
    if (l == r) 
    {
        t[id] = val;
        return;
    }

    int mid = (l + r) / 2;
    if (pos <= mid) UPDATE(id * 2, l, mid, pos, val);
    else UPDATE(id * 2 + 1, mid + 1, r, pos, val);

    t[id] = max(t[id * 2], t[id * 2 + 1]);
}

int GET(int id, int l, int r, int u, int v)
{
    if (r < u || l > v) return 0;
    if (l >= u && r <= v) return t[id];

    int mid = (l + r) / 2;
    return max(GET(id * 2, l, mid, u, v), GET(id * 2 + 1, mid + 1, r, u, v));
}

int main()
{
    file();

    cin >> n >> m;
    f(i, 1, n) cin >> a[i];
    f(i, 1, m) 
    {
        int l, r, k;
        cin >> l >> r >> k;

        v[r].pb({l, i, k});
    }

    stack <int> s;
    
    f(i, 1, n)
    {
        while(!s.empty() && a[s.top()] <= a[i]) s.pop();
        if (s.size()) UPDATE(1, 1, n, s.top(), a[s.top()] + a[i]);

        s.push(i);

        for (auto x : v[i])
        {
            if (GET(1, 1, n, x.st, i) <= x.mood) res[x.id] = 1;
            else res[x.id] = 0;
        }
    }

    f(i, 1, m) cout << res[i] << '\n';

    ctime();
    return 0;
}

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

sortbooks.cpp: In function 'void file()':
sortbooks.cpp:39:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   39 |         freopen(INOUT".INP", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
sortbooks.cpp:40:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   40 |         freopen(INOUT".OUT", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

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