제출 #1105219

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1105219		alexdd	Fire (BOI24_fire)	C++17	40 / 100	2068 ms	3404 KiB

Main

#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n,m;
pair<int,int> v[200005];
int nxt[200005];
void calc_nxt()
{
    for(int i=1;i<=n;i++)
    {
        int mxm=v[i].second;
        nxt[i]=-1;
        for(int j=1;j<=n;j++)
        {
            if(j==i)
                continue;
            if(v[j].first <= v[i].second && v[j].second > mxm)
            {
                mxm = v[j].second;
                nxt[i] = j;
            }
        }
        //cout<<i<<" "<<nxt[i]<<" nxt\n";
    }
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    {
        cin>>v[i].first>>v[i].second;
        if(v[i].first > v[i].second)
            v[i].second += m;
    }
    calc_nxt();
    int rez=INF;
    for(int i=1;i<=n;i++)
    {
        if(v[i].second >= m)
        {
            int unde=-1,mxm=-1;
            for(int j=1;j<=n;j++)
            {
                if(i!=j && v[j].first <= v[i].second-m)
                {
                    if(v[j].second > mxm)
                    {
                        mxm = v[j].second;
                        unde = j;
                    }
                }
            }
            //cout<<i<<" "<<unde<<" incearca\n";
            int cur=unde,cnt=1;
            while(cur!=-1)
            {
                cnt++;
                if(v[cur].second >= v[i].first)
                    break;
                //cout<<cur<<" cur\n";
                cur = nxt[cur];
            }
            if(cur!=-1) rez = min(rez, cnt);
        }
    }
    if(rez==INF)
        rez=-1;
    cout<<rez;
    return 0;
}

• Subtask 1: 14 / 14
• Subtask 2: 17 / 17
• Subtask 3: 9 / 9
• Subtask 4: 0 / 13
• Subtask 5: 0 / 21
• Subtask 6: 0 / 26