oj.uz

답안 #1020150

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020150 2024-07-11T15:54:42 Z bachhoangxuan Fire (BOI24_fire) C++17
100 / 100
 288 ms 135900 KB 
// Judges with GCC >= 12 only needs Ofast
// #pragma GCC optimize("O3,no-stack-protector,fast-math,unroll-loops,tree-vectorize")
// MLE optimization
// #pragma GCC optimize("conserve-stack")
// Old judges
// #pragma GCC target("sse4.2,popcnt,lzcnt,abm,mmx,fma,bmi,bmi2")
// New judges. Test with assert(__builtin_cpu_supports("avx2"));
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")
// Atcoder
// #pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma")
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
- insert(x),erase(x)
- find_by_order(k): return iterator to the k-th smallest element
- order_of_key(x): the number of elements that are strictly smaller
*/
#include<bits/stdc++.h>
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
uniform_real_distribution<> pp(0.0,1.0);
#define int long long
#define ld long double
#define pii pair<int,int>
#define piii pair<int,pii>
#define mpp make_pair
#define fi first
#define se second
const long long inf=1e18;
const int mod=998244353;
const int maxn=800005;
const int B=650;
const int maxs=655;
const int maxm=200005;
const int maxq=1000005;
const int maxl=20;
const int maxa=1000000;
const int root=3;
int power(int a,int n){
    int res=1;
    while(n){
        if(n&1) res=res*a%mod;
        a=a*a%mod;n>>=1;
    }
    return res;
}
const int iroot=power(3,mod-2);
const int base=101;

int n,m,l[maxn],r[maxn];
int nxt[maxn][maxl];
vector<int> com;

void solve(){
    cin >> n >> m;
    com.push_back(0);
    for(int i=1;i<=n;i++){
        cin >> l[i] >> r[i];
        com.push_back(l[i]);
        com.push_back(r[i]);
    }
    sort(com.begin(),com.end());
    com.erase(unique(com.begin(),com.end()),com.end());
    m=(int)com.size();
    for(int i=0;i<2*m;i++) nxt[i][0]=i;
    //cout << m << '\n';
    for(int i=1;i<=n;i++){
        l[i]=lower_bound(com.begin(),com.end(),l[i])-com.begin();
        r[i]=lower_bound(com.begin(),com.end(),r[i])-com.begin();
        if(l[i]>r[i]){
            nxt[l[i]][0]=max(nxt[l[i]][0],m+r[i]);
        }
        else{
            nxt[l[i]][0]=max(nxt[l[i]][0],r[i]);
            nxt[m+l[i]][0]=max(nxt[m+l[i]][0],m+r[i]);
        }
        //cout << l[i] << ' ' << r[i] << '\n';
    }
    for(int i=1;i<2*m;i++) nxt[i][0]=max(nxt[i][0],nxt[i-1][0]);
    for(int i=1;i<20;i++){
        for(int j=0;j<2*m;j++) nxt[j][i]=nxt[nxt[j][i-1]][i-1];
    }
    int res=inf;
    for(int i=0;i<m;i++){
        int cnt=0,u=i;
        for(int j=19;j>=0;j--){
            if(nxt[u][j]<i+m) cnt+=(1<<j),u=nxt[u][j];
        }
        cnt++;u=nxt[u][0];
        //cout << i << ' ' << u << ' ' << cnt << '\n';
        if(u>=i+m) res=min(res,cnt);
    }
    cout << (res==inf?-1:res) << '\n';
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);cout.tie(NULL);
    int test=1;//cin >> test;
    while(test--) solve();
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 348 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 5 ms 3932 KB Output is correct
40 Correct 5 ms 3932 KB Output is correct
41 Correct 4 ms 3932 KB Output is correct
42 Correct 3 ms 2316 KB Output is correct
43 Correct 3 ms 1884 KB Output is correct
44 Correct 4 ms 2436 KB Output is correct
45 Correct 3 ms 2396 KB Output is correct
46 Correct 3 ms 2396 KB Output is correct
47 Correct 5 ms 3932 KB Output is correct
48 Correct 5 ms 3932 KB Output is correct
49 Correct 4 ms 3932 KB Output is correct
50 Correct 3 ms 2140 KB Output is correct

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 472 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 5 ms 3808 KB Output is correct
16 Correct 3 ms 2316 KB Output is correct
17 Correct 3 ms 1884 KB Output is correct
18 Correct 4 ms 2396 KB Output is correct
19 Correct 4 ms 3932 KB Output is correct
20 Correct 28 ms 7632 KB Output is correct
21 Correct 260 ms 135876 KB Output is correct
22 Correct 243 ms 135872 KB Output is correct
23 Correct 179 ms 72380 KB Output is correct
24 Correct 287 ms 135872 KB Output is correct
25 Correct 150 ms 60032 KB Output is correct
26 Correct 177 ms 73200 KB Output is correct
27 Correct 177 ms 73196 KB Output is correct
28 Correct 245 ms 132700 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 464 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 5 ms 3932 KB Output is correct
13 Correct 4 ms 2316 KB Output is correct
14 Correct 5 ms 2136 KB Output is correct
15 Correct 28 ms 7632 KB Output is correct
16 Correct 212 ms 72384 KB Output is correct
17 Correct 265 ms 135868 KB Output is correct
18 Correct 266 ms 135868 KB Output is correct
19 Correct 274 ms 135888 KB Output is correct
20 Correct 181 ms 72244 KB Output is correct

Subtask #6
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 0 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 604 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 1 ms 604 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 5 ms 3932 KB Output is correct
40 Correct 5 ms 3932 KB Output is correct
41 Correct 4 ms 3932 KB Output is correct
42 Correct 3 ms 2316 KB Output is correct
43 Correct 3 ms 1884 KB Output is correct
44 Correct 4 ms 2436 KB Output is correct
45 Correct 3 ms 2396 KB Output is correct
46 Correct 3 ms 2396 KB Output is correct
47 Correct 5 ms 3932 KB Output is correct
48 Correct 5 ms 3932 KB Output is correct
49 Correct 4 ms 3932 KB Output is correct
50 Correct 3 ms 2140 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 1 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 472 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 1 ms 604 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 604 KB Output is correct
64 Correct 1 ms 604 KB Output is correct
65 Correct 5 ms 3808 KB Output is correct
66 Correct 3 ms 2316 KB Output is correct
67 Correct 3 ms 1884 KB Output is correct
68 Correct 4 ms 2396 KB Output is correct
69 Correct 4 ms 3932 KB Output is correct
70 Correct 28 ms 7632 KB Output is correct
71 Correct 260 ms 135876 KB Output is correct
72 Correct 243 ms 135872 KB Output is correct
73 Correct 179 ms 72380 KB Output is correct
74 Correct 287 ms 135872 KB Output is correct
75 Correct 150 ms 60032 KB Output is correct
76 Correct 177 ms 73200 KB Output is correct
77 Correct 177 ms 73196 KB Output is correct
78 Correct 245 ms 132700 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 468 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 464 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 604 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 1 ms 604 KB Output is correct
89 Correct 0 ms 348 KB Output is correct
90 Correct 5 ms 3932 KB Output is correct
91 Correct 4 ms 2316 KB Output is correct
92 Correct 5 ms 2136 KB Output is correct
93 Correct 28 ms 7632 KB Output is correct
94 Correct 212 ms 72384 KB Output is correct
95 Correct 265 ms 135868 KB Output is correct
96 Correct 266 ms 135868 KB Output is correct
97 Correct 274 ms 135888 KB Output is correct
98 Correct 181 ms 72244 KB Output is correct
99 Correct 268 ms 135868 KB Output is correct
100 Correct 248 ms 135872 KB Output is correct
101 Correct 288 ms 135900 KB Output is correct
102 Correct 275 ms 135684 KB Output is correct
103 Correct 181 ms 73148 KB Output is correct
104 Correct 242 ms 129468 KB Output is correct
105 Correct 262 ms 134644 KB Output is correct