oj.uz

Submission #1084300

# Submission time Handle Problem Language Result Execution time Memory
1084300 2024-09-05T18:58:40 Z De3b0o Fire (BOI24_fire) C++17
53 / 100
 149 ms 12992 KB 
#include<bits/stdc++.h>
#include<random>
#define ll long long
#define F first
#define S second
#define in insert
#define pb push_back
#define ppb pop_back()
#define d3 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define cans cout << ans << "\n";
#define yes cout << "Yes" << "\n";
#define no cout << "No" << "\n";
#define pll pair<ll,ll>
#define lin cout << "\n";
#define sqr 340
#define mod 1000000007
#define mid ((l+r)/2)
#define lc (2*x)
#define rc (2*x+1)
#define sq 547

using namespace std;

ll n , m;
vector<pll> v;
ll ans;
ll l[200009] , r[200009];
ll idx;

void pro(ll s , ll e , ll t)
{
    bool g = 1;
    ll ans1 = t;
    ll id = s;
    while(id<=e)
    {
        if(id==e&&e!=m-1)
            break;
        while(idx<v.size())
        {
            if(v[idx].F<=id)
                idx++;
            else
                break;
        }
        if(idx==0)
        {
            g=0;
            break;
        }
        ll ne = v[idx-1].S;
        if(ne<=id)
        {
            g=0;
            break;
        }
        ans1++;
        id=ne;
    }
    if(g&&ans1!=1)
        ans=min(ans,ans1);
}

int main()
{
    cin >> n >> m;
    ans=n+1;
    for(int i = 0 ; n>i ; i++)
        cin >> l[i] >> r[i];
    for(int i = 0 ; n>i ; i++)
    {
        ll x = l[i] , y = r[i];
        if(x>y)
            y=m-1;
        v.pb({x,y});
    }
    sort(v.begin(),v.end());
    for(int i = 1 ; v.size()>i ; i++)
        v[i].S=max(v[i].S,v[i-1].S);
    ll mn = 1e10 , id1 = -1;
    ll mx = -1 , id2 = -1;
    ll mnn = 1e10;
    bool ws = 0;
    ll d = 0;
    for(int i = 0 ; n>i ; i++)
    {
        if(min(l[i],r[i])==0&&max(l[i],r[i])==m-1)
            ws=1;
        if(l[i]==0||r[i]==m-1||l[i]>r[i])
            d++;
        if(l[i]>r[i])
        {
            if(r[i]==0)
            {
                mnn=min(mnn,l[i]);
            }
            if(l[i]<mn)
            {
                mn=l[i];
                id1=i;
            }
            else if(l[i]==mn&&r[i]>r[id1])
            {
                mn=l[i];
                id1=i;
            }
            if(r[i]>mx)
            {
                mx=r[i];
                id2=i;
            }
            else if(r[i]==mx&&l[i]<l[id2])
            {
                mx=r[i];
                id2=i;
            }
        }
    }
    pro(0,m-1,0);
    idx=0;
    if(id1!=-1)
    {
        idx=0;
        pro(r[id1],l[id1],1);
    }
    if(id2!=-1)
    {
        idx=0;
        pro(r[id2],l[id2],1);
    }
    idx=0;
    if(mnn!=1e10)
        pro(0,mnn,1);
    if(ws&&d>1)
        ans=2;
    if(ans==n+1)
        ans=-1;
    cans
}

Compilation message

Main.cpp: In function 'void pro(long long int, long long int, long long int)':
Main.cpp:39:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |         while(idx<v.size())
      |               ~~~^~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:78:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   78 |     for(int i = 1 ; v.size()>i ; i++)
      |                     ~~~~~~~~^~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2464 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2464 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 3 ms 2652 KB Output is correct
40 Correct 3 ms 2652 KB Output is correct
41 Correct 3 ms 2584 KB Output is correct
42 Correct 3 ms 2652 KB Output is correct
43 Correct 3 ms 2652 KB Output is correct
44 Correct 3 ms 2652 KB Output is correct
45 Correct 3 ms 2648 KB Output is correct
46 Correct 3 ms 2528 KB Output is correct
47 Correct 4 ms 2652 KB Output is correct
48 Correct 3 ms 2652 KB Output is correct
49 Correct 2 ms 2652 KB Output is correct
50 Correct 2 ms 2744 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 4 ms 2652 KB Output is correct
16 Correct 2 ms 2652 KB Output is correct
17 Correct 3 ms 2652 KB Output is correct
18 Correct 3 ms 2652 KB Output is correct
19 Correct 3 ms 2652 KB Output is correct
20 Correct 43 ms 8128 KB Output is correct
21 Correct 109 ms 9496 KB Output is correct
22 Correct 112 ms 8896 KB Output is correct
23 Correct 98 ms 8920 KB Output is correct
24 Correct 116 ms 9412 KB Output is correct
25 Correct 102 ms 9152 KB Output is correct
26 Correct 149 ms 9156 KB Output is correct
27 Correct 119 ms 12220 KB Output is correct
28 Correct 111 ms 12992 KB Output is correct

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 0 ms 2492 KB Output is correct
12 Correct 3 ms 2652 KB Output is correct
13 Correct 3 ms 2652 KB Output is correct
14 Correct 2 ms 2652 KB Output is correct
15 Correct 49 ms 7900 KB Output is correct
16 Correct 93 ms 8656 KB Output is correct
17 Incorrect 112 ms 8900 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 0 ms 2396 KB Output is correct
18 Correct 0 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 0 ms 2396 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 1 ms 2392 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 1 ms 2392 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 0 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 1 ms 2396 KB Output is correct
35 Correct 1 ms 2464 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 3 ms 2652 KB Output is correct
40 Correct 3 ms 2652 KB Output is correct
41 Correct 3 ms 2584 KB Output is correct
42 Correct 3 ms 2652 KB Output is correct
43 Correct 3 ms 2652 KB Output is correct
44 Correct 3 ms 2652 KB Output is correct
45 Correct 3 ms 2648 KB Output is correct
46 Correct 3 ms 2528 KB Output is correct
47 Correct 4 ms 2652 KB Output is correct
48 Correct 3 ms 2652 KB Output is correct
49 Correct 2 ms 2652 KB Output is correct
50 Correct 2 ms 2744 KB Output is correct
51 Correct 0 ms 2396 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 1 ms 2396 KB Output is correct
54 Correct 1 ms 2396 KB Output is correct
55 Correct 1 ms 2392 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 0 ms 2396 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2392 KB Output is correct
61 Correct 1 ms 2392 KB Output is correct
62 Correct 1 ms 2396 KB Output is correct
63 Correct 1 ms 2396 KB Output is correct
64 Correct 1 ms 2396 KB Output is correct
65 Correct 4 ms 2652 KB Output is correct
66 Correct 2 ms 2652 KB Output is correct
67 Correct 3 ms 2652 KB Output is correct
68 Correct 3 ms 2652 KB Output is correct
69 Correct 3 ms 2652 KB Output is correct
70 Correct 43 ms 8128 KB Output is correct
71 Correct 109 ms 9496 KB Output is correct
72 Correct 112 ms 8896 KB Output is correct
73 Correct 98 ms 8920 KB Output is correct
74 Correct 116 ms 9412 KB Output is correct
75 Correct 102 ms 9152 KB Output is correct
76 Correct 149 ms 9156 KB Output is correct
77 Correct 119 ms 12220 KB Output is correct
78 Correct 111 ms 12992 KB Output is correct
79 Correct 1 ms 2396 KB Output is correct
80 Correct 0 ms 2396 KB Output is correct
81 Correct 0 ms 2396 KB Output is correct
82 Correct 0 ms 2396 KB Output is correct
83 Correct 1 ms 2396 KB Output is correct
84 Correct 0 ms 2396 KB Output is correct
85 Correct 0 ms 2396 KB Output is correct
86 Correct 1 ms 2396 KB Output is correct
87 Correct 1 ms 2396 KB Output is correct
88 Correct 1 ms 2396 KB Output is correct
89 Correct 0 ms 2492 KB Output is correct
90 Correct 3 ms 2652 KB Output is correct
91 Correct 3 ms 2652 KB Output is correct
92 Correct 2 ms 2652 KB Output is correct
93 Correct 49 ms 7900 KB Output is correct
94 Correct 93 ms 8656 KB Output is correct
95 Incorrect 112 ms 8900 KB Output isn't correct
96 Halted 0 ms 0 KB -