oj.uz

답안 #1010058

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1010058 2024-06-28T09:41:43 Z yeediot Fire (BOI24_fire) C++17
100 / 100
 132 ms 73340 KB 
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
#ifdef local
void CHECK();
void setio(){
    freopen("/Users/iantsai/cpp/input.txt","r",stdin);
    freopen("/Users/iantsai/cpp/output.txt","w",stdout);
}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
#define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio();
const int mxn = 4e5+5;
const int inf = 1e18;
int n, m, l[mxn], r[mxn], nxt[mxn], st[20][mxn];

signed main(){
    TOI_is_so_de;
    cin >> n >> m;
    for(int i=1;i<=n;i++){
        cin >> l[i] >> r[i];
        if(l[i] > r[i]) r[i] += m;
        l[i+n] = l[i] + m;
        r[i+n] = r[i] + m;
    }
    n *= 2;
    {
        vector<pii>temp;
        for(int i=1;i<=n;i++){
            temp.pb({l[i], -r[i]});
        }
        sort(all(temp));
        int cnt = 0, end = -1;
        for(auto [L, R] : temp){
            R = -R;
            if(R <= end){
                continue;
            }
            l[++cnt] = L;
            r[cnt] = R;
            end = R;
        }
        n = cnt;
    }
    {
        int id = 1;
        vector<pii>temp;
        for(int i=1;i<=n;i++){
            temp.pb({l[i], i});
        }
        sort(all(temp));
        for(int i=0;i<n;i++){
            while(id<n and temp[id].F <= r[temp[i].S]){
                id++;
            }
            st[0][temp[i].S] = temp[id-1].S;
        }
    }
    {
        for(int i=1;i<20;i++){
            for(int j=1;j<=n;j++){
                st[i][j] = st[i-1][st[i-1][j]];
            }
        }
    }
    int ans = inf;
    for(int i=1;i<=n;i++){
        if(l[i] >= m) break;
        int cur = i, temp = 1;
        for(int j=19;j>=0;j--){
            if(r[st[j][cur]]-m<l[i]){
                temp += (1 << j);
                cur = st[j][cur];
            }
        }
        cur = st[0][cur];
        temp++;
        if(r[cur] - m >= l[i]) ans = min(ans, temp);
    }
    cout << (ans == inf ? -1 : ans) << '\n';
    #ifdef local
    CHECK();
    #endif
}
/*
input:
 dp[i] = 
*/
#ifdef local
void CHECK(){
    cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
     function<bool(string,string)> compareFiles = [](string p1, string p2)->bool {
         std::ifstream file1(p1);
         std::ifstream file2(p2);
         if (!file1.is_open() || !file2.is_open())return false;
         std::string line1, line2;
         while (getline(file1, line1) && getline(file2, line2)) {
             if (line1 != line2)return false;
         }
         int cnta=0,cntb=0;
         while(getline(file1,line1))cnta++;
         while(getline(file2,line2))cntb++;
         return cntb-cnta<=1;
     };
     bool check = compareFiles("output.txt","expected.txt");
     if (check) cerr<<"ACCEPTED\n";
     else cerr<<"WRONG ANSWER!\n";
}
#else
#endif

Compilation message

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:35:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   35 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:36:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 2 ms 1112 KB Output is correct
40 Correct 3 ms 2356 KB Output is correct
41 Correct 2 ms 2340 KB Output is correct
42 Correct 2 ms 2372 KB Output is correct
43 Correct 2 ms 1112 KB Output is correct
44 Correct 3 ms 2596 KB Output is correct
45 Correct 3 ms 2596 KB Output is correct
46 Correct 3 ms 2340 KB Output is correct
47 Correct 2 ms 1116 KB Output is correct
48 Correct 2 ms 1116 KB Output is correct
49 Correct 2 ms 1600 KB Output is correct
50 Correct 2 ms 2592 KB Output is correct

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 716 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 3 ms 2340 KB Output is correct
16 Correct 3 ms 2340 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 3 ms 2500 KB Output is correct
19 Correct 2 ms 1112 KB Output is correct
20 Correct 32 ms 15708 KB Output is correct
21 Correct 67 ms 20328 KB Output is correct
22 Correct 71 ms 18888 KB Output is correct
23 Correct 105 ms 72328 KB Output is correct
24 Correct 99 ms 59044 KB Output is correct
25 Correct 58 ms 18120 KB Output is correct
26 Correct 84 ms 48964 KB Output is correct
27 Correct 111 ms 73272 KB Output is correct
28 Correct 66 ms 18884 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 0 ms 604 KB Output is correct
11 Correct 0 ms 604 KB Output is correct
12 Correct 5 ms 2340 KB Output is correct
13 Correct 4 ms 2340 KB Output is correct
14 Correct 4 ms 2340 KB Output is correct
15 Correct 33 ms 15824 KB Output is correct
16 Correct 132 ms 72200 KB Output is correct
17 Correct 111 ms 73132 KB Output is correct
18 Correct 106 ms 73276 KB Output is correct
19 Correct 119 ms 73340 KB Output is correct
20 Correct 106 ms 72252 KB Output is correct

Subtask #6
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 604 KB Output is correct
2 Correct 0 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 604 KB Output is correct
6 Correct 0 ms 604 KB Output is correct
7 Correct 0 ms 604 KB Output is correct
8 Correct 0 ms 604 KB Output is correct
9 Correct 0 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 0 ms 604 KB Output is correct
13 Correct 0 ms 604 KB Output is correct
14 Correct 0 ms 604 KB Output is correct
15 Correct 0 ms 604 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 460 KB Output is correct
20 Correct 0 ms 604 KB Output is correct
21 Correct 0 ms 604 KB Output is correct
22 Correct 0 ms 604 KB Output is correct
23 Correct 0 ms 604 KB Output is correct
24 Correct 0 ms 604 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 0 ms 604 KB Output is correct
28 Correct 0 ms 604 KB Output is correct
29 Correct 0 ms 604 KB Output is correct
30 Correct 0 ms 604 KB Output is correct
31 Correct 0 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 0 ms 604 KB Output is correct
34 Correct 0 ms 604 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 604 KB Output is correct
37 Correct 0 ms 604 KB Output is correct
38 Correct 0 ms 604 KB Output is correct
39 Correct 2 ms 1112 KB Output is correct
40 Correct 3 ms 2356 KB Output is correct
41 Correct 2 ms 2340 KB Output is correct
42 Correct 2 ms 2372 KB Output is correct
43 Correct 2 ms 1112 KB Output is correct
44 Correct 3 ms 2596 KB Output is correct
45 Correct 3 ms 2596 KB Output is correct
46 Correct 3 ms 2340 KB Output is correct
47 Correct 2 ms 1116 KB Output is correct
48 Correct 2 ms 1116 KB Output is correct
49 Correct 2 ms 1600 KB Output is correct
50 Correct 2 ms 2592 KB Output is correct
51 Correct 0 ms 604 KB Output is correct
52 Correct 0 ms 604 KB Output is correct
53 Correct 0 ms 604 KB Output is correct
54 Correct 0 ms 604 KB Output is correct
55 Correct 0 ms 604 KB Output is correct
56 Correct 0 ms 604 KB Output is correct
57 Correct 1 ms 604 KB Output is correct
58 Correct 0 ms 604 KB Output is correct
59 Correct 1 ms 852 KB Output is correct
60 Correct 1 ms 608 KB Output is correct
61 Correct 0 ms 604 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 1 ms 716 KB Output is correct
64 Correct 0 ms 604 KB Output is correct
65 Correct 3 ms 2340 KB Output is correct
66 Correct 3 ms 2340 KB Output is correct
67 Correct 2 ms 1112 KB Output is correct
68 Correct 3 ms 2500 KB Output is correct
69 Correct 2 ms 1112 KB Output is correct
70 Correct 32 ms 15708 KB Output is correct
71 Correct 67 ms 20328 KB Output is correct
72 Correct 71 ms 18888 KB Output is correct
73 Correct 105 ms 72328 KB Output is correct
74 Correct 99 ms 59044 KB Output is correct
75 Correct 58 ms 18120 KB Output is correct
76 Correct 84 ms 48964 KB Output is correct
77 Correct 111 ms 73272 KB Output is correct
78 Correct 66 ms 18884 KB Output is correct
79 Correct 0 ms 604 KB Output is correct
80 Correct 0 ms 604 KB Output is correct
81 Correct 0 ms 604 KB Output is correct
82 Correct 0 ms 604 KB Output is correct
83 Correct 0 ms 604 KB Output is correct
84 Correct 0 ms 604 KB Output is correct
85 Correct 0 ms 604 KB Output is correct
86 Correct 1 ms 604 KB Output is correct
87 Correct 0 ms 604 KB Output is correct
88 Correct 0 ms 604 KB Output is correct
89 Correct 0 ms 604 KB Output is correct
90 Correct 5 ms 2340 KB Output is correct
91 Correct 4 ms 2340 KB Output is correct
92 Correct 4 ms 2340 KB Output is correct
93 Correct 33 ms 15824 KB Output is correct
94 Correct 132 ms 72200 KB Output is correct
95 Correct 111 ms 73132 KB Output is correct
96 Correct 106 ms 73276 KB Output is correct
97 Correct 119 ms 73340 KB Output is correct
98 Correct 106 ms 72252 KB Output is correct
99 Correct 79 ms 31976 KB Output is correct
100 Correct 72 ms 18940 KB Output is correct
101 Correct 114 ms 72332 KB Output is correct
102 Correct 99 ms 61444 KB Output is correct
103 Correct 98 ms 73280 KB Output is correct
104 Correct 71 ms 21340 KB Output is correct
105 Correct 63 ms 47916 KB Output is correct