제출 #1165641

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165641		phamducluong	Sum Zero (RMI20_sumzero)	C++20	61 / 100	217 ms	23524 KiB

sumzero

#include <bits/stdc++.h>

using namespace std;

const int maxN  = 4e5 + 5;
vector<pair<pair<int, int>, int> > query;

bool cmp_query(const pair<pair<int, int>, int> &a, const pair<pair<int, int>, int> &b)
{
    return a.first.first > b.first.first;
}

map<long long, int> helper;
map<long long, int>::iterator m_iter;

int lq[maxN], val[maxN];
int last_l;
int calc(const int &l, const int &r)
{
    //cout << "Start " << l << ' ' << r << '\n';
    if(r < l)return 0;
    if(val[r])last_l = lq[r];
    val[r] = val[r] + calc(l, lq[r] - 1);
    lq[r] = (val[r] ? last_l : l);
    //cout << " Calc " << l << ' ' << r << ' ' << val[r] << '\n';
    return val[r];
}

int re[maxN];
int res[maxN];
int n, q;
int main()
{
    if(fopen("input.txt", "r"))
    {
        freopen("input.txt", "r", stdin);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    cin >> n;
    for(int i = 1; i <= n; ++i)
    {
        cin >> re[i];
        lq[i] = i;
        val[i] = 0;
    }

    cin >> q;
    query.resize(q + 1);
    for(int i = 1; i <= q; ++i)
    {
        cin >> query[i].first.first >> query[i].first.second;
        query[i].second = i;
    }
    sort(query.begin() + 1, query.end(), cmp_query);

    helper.clear();
    helper.insert(make_pair(0LL, n + 1));
    long long sum = 0;
    for(int i = n; i > 0; --i)
    {
        sum += re[i];
        re[i] = -1;
        m_iter = helper.find(sum);
        if(m_iter == helper.end())
        {
            helper.insert(make_pair(sum, i));
        }
        else
        {
            re[i] = m_iter->second - 1;
            m_iter->second = i;
        }
    }

    int itl = n;
    for(int i = 1; i <= q; ++i)
    {
        while(itl >= query[i].first.first)
        {
            if(re[itl] != -1)
            {
                calc(itl, re[itl]);
                if(!val[re[itl]])
                {
                    val[re[itl]] = 1;
                    lq[re[itl]] = itl;
                    for(int j = re[itl] + 1; j <= n; ++j)
                        if(val[j])break;
                        else lq[j] = re[itl] + 1;
                }
            }
            itl--;
        }
        res[query[i].second] = calc(query[i].first.first, query[i].first.second);
    }
    for(int i = 1; i <= q; ++i)
        cout << res[i] << '\n';

    return 0;
}

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

sumzero.cpp: In function 'int main()':
sumzero.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen("input.txt", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 22 / 22
• Subtask 2: 39 / 39
• Subtask 3: 0 / 39