제출 #330773

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
330773		ThaiBaHung	Pilot (NOI19_pilot)	C++14	89 / 100	1062 ms	122696 KiB

pilot

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 3;
int n, q;
int a[N];
int qu[N];
long long L[N], R[N];
stack < int > st;
vector < int > num[N];
vector < int > pos[N];
long long ans[N];
vector < int > cur;

int ma = 0;

int main()
{
    //ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    //freopen("pilot.in","r",stdin); freopen("pilot.out","w",stdout);

    cin >> n >> q;

    for (int i = 1; i <= n; i++)
    {
        scanf("%d", &a[i]);
        num[a[i]].push_back(i);
    }

    for (int i = 1; i <= q; i++)
        scanf("%d", &qu[i]), ma = max(ma, qu[i]), pos[qu[i]].push_back(i);

    st.push(0);
    a[0] = 1e9 + 7;

    for (int i = 1; i <= n; i++)
    {
        while (st.size() && a[i] >= a[st.top()])
            st.pop();
        L[i] = st.top() + 1;
        st.push(i);
    }

    while (st.size()) st.pop();
    a[n + 1] = 1e9 + 7;
    st.push(n + 1);

    for (int i = n; i >= 1; i--)
    {
        while (st.size() && a[i] > a[st.top()])
            st.pop();
        R[i] = st.top() - 1;
        st.push(i);
    }

    long long res = 0;

    for (int i = 1; i <= ma; i++)
    {
        for (int u : num[i])
            cur.push_back(u);

        if (pos[i].size())
        {
            for (int u : cur)
            {
                long long lo = u - L[u] + 1;
                long long hi = R[u] - u + 1;
                res += hi * lo;
            }

            for (int vt : pos[i])
                ans[vt] = res;

            cur.clear();
        }
    }

    for (int i = 1; i <= q; i++)
        cout << ans[i] << '\n';
}

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

pilot.cpp: In function 'int main()':
pilot.cpp:25:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   25 |         scanf("%d", &a[i]);
      |         ~~~~~^~~~~~~~~~~~~
pilot.cpp:30:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |         scanf("%d", &qu[i]), ma = max(ma, qu[i]), pos[qu[i]].push_back(i);
      |         ~~~~~^~~~~~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 0 / 11