Submission #1105227

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1105227	2024-10-25T18:50:06 Z	alexdd	Fire (BOI24_fire)	C++17	13 / 100	2000 ms	7336 KB

Main

#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9;
int n,m;
pair<int,int> v[200005];
int prefmax[200005];
int nxt[200005];
int get_ult(int lim)
{
    int st=0,dr=n,ans=0;
    while(st<=dr)
    {
        int mij=(st+dr)/2;
        if(v[mij].first <= lim)
        {
            ans = mij;
            st = mij+1;
        }
        else
            dr = mij-1;
    }
    return ans;
}
void calc_nxt()
{
    for(int i=1;i<=n;i++)
    {
        nxt[i] = prefmax[get_ult(v[i].second)];
        //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;
    }
    sort(v+1,v+1+n);
    prefmax[0] = -1;
    for(int i=1;i<=n;i++)
    {
        if(v[i].second > v[prefmax[i-1]].second)
            prefmax[i] = i;
        else
            prefmax[i] = prefmax[i-1];
    }
    calc_nxt();
    int rez=INF;
    for(int i=1;i<=n;i++)
    {
        if(v[i].second >= m)
        {
            int unde = prefmax[get_ult(v[i].second-m)];
            if(unde==i) unde = -1;

            int cur=unde,cnt=1;
            while(cur!=-1)
            {
                cnt++;
                if(v[cur].second >= v[i].first)
                    break;
                cur = nxt[cur];
            }
            if(cur!=-1) rez = min(rez, cnt);
        }
    }
    if(rez==INF)
        rez=-1;
    cout<<rez;
    return 0;
}

Subtask #1

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2552 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Execution timed out	2091 ms	2384 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-

Subtask #2

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2552 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Execution timed out	2091 ms	2384 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-

Subtask #3

0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2552 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Execution timed out	2091 ms	2384 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-

Subtask #4

13.0 / 13.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2384 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Correct	1 ms	2384 KB	Output is correct
9	Correct	1 ms	2384 KB	Output is correct
10	Correct	1 ms	2384 KB	Output is correct
11	Correct	1 ms	2384 KB	Output is correct
12	Correct	1 ms	2384 KB	Output is correct
13	Correct	1 ms	2384 KB	Output is correct
14	Correct	1 ms	2384 KB	Output is correct
15	Correct	4 ms	2384 KB	Output is correct
16	Correct	3 ms	2384 KB	Output is correct
17	Correct	4 ms	2384 KB	Output is correct
18	Correct	4 ms	2384 KB	Output is correct
19	Correct	4 ms	2384 KB	Output is correct
20	Correct	44 ms	3512 KB	Output is correct
21	Correct	124 ms	7200 KB	Output is correct
22	Correct	131 ms	7336 KB	Output is correct
23	Correct	105 ms	6216 KB	Output is correct
24	Correct	121 ms	7332 KB	Output is correct
25	Correct	125 ms	6728 KB	Output is correct
26	Correct	116 ms	7244 KB	Output is correct
27	Correct	117 ms	7336 KB	Output is correct
28	Correct	114 ms	7240 KB	Output is correct

Subtask #5

0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Execution timed out	2063 ms	2384 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #6

0 / 26.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2384 KB	Output is correct
2	Correct	1 ms	2384 KB	Output is correct
3	Correct	1 ms	2384 KB	Output is correct
4	Correct	1 ms	2384 KB	Output is correct
5	Correct	1 ms	2552 KB	Output is correct
6	Correct	1 ms	2384 KB	Output is correct
7	Correct	1 ms	2384 KB	Output is correct
8	Execution timed out	2091 ms	2384 KB	Time limit exceeded
9	Halted	0 ms	0 KB	-