oj.uz

Submission #967174

# Submission time Handle Problem Language Result Execution time Memory
967174 2024-04-21T11:59:53 Z SzypkiBill Railway Trip 2 (JOI22_ho_t4) C++17
16 / 100
 2000 ms 85268 KB 
#include <bits/stdc++.h>
#define int long long
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define vi vector<int>
#define vb vector<bool>
#define vii vector<pii>
#define siz(x) (int)x.size()
#define pb push_back
#define st first
#define nd second
#define rep(i,a,b) for(int i=a; i<=b; i++)
using namespace std;
const int inf = 1e9, maxn = 1e5+5, mod = 1e9+7;

pii seg[maxn][20];
int base = (1<<17);
int n,k,m;

class segment_tree{
    vi mini;
    vi maxi;
public:
    void init(int p){
        mini.resize(base*2,inf);
        maxi.resize(base*2,-inf);
        rep(i,1,n)mini[i] = seg[i][p].st;
        rep(i,1,n)maxi[i] = seg[i][p].nd;
    }
    int query_min(int a, int b){
        int ans = inf;
        rep(i,a,b)ans = min(ans,mini[i]);
        return ans;
    }
    int query_max(int a, int b){
        int ans = -inf;
        rep(i,a,b)ans = max(ans,maxi[i]);
        return ans;
    }
};
class segment_tree_max{
    vi tree;
    public:
    segment_tree_max(){
        tree.resize(2*base);
        rep(i,1,n)tree[i] = i;
    }
    void add(int a, int b, int v){
        rep(i,a,b)tree[i] = max(tree[i],v);
    }
    int query(int a){
        return tree[a];
    }
};
class segment_tree_min{
    vi tree;
    public:
    segment_tree_min(){
        tree.resize(2*base);
        rep(i,1,n)tree[i] = i;
    }
    void add(int a, int b, int v){
        rep(i,a,b)tree[i] = min(tree[i],v);
    }
    int query(int a){
        return tree[a];
    }
};

int32_t main(){
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>k>>m;
    vii linie;
    rep(i,1,m){
        int a,b;cin>>a>>b;
        linie.pb({a,b});
    }

    segment_tree_max MX;
    for(auto [a,b] : linie){
        if(a<b)
            MX.add(a,min(a+k-1,n),b);
    }
    rep(i,1,n)seg[i][0].nd = MX.query(i);
    segment_tree_min MN;
    for(auto [a,b] : linie){
        if(a>b)
            MN.add(max(1ll,a-k+1),a,b);
    }
    rep(i,1,n)seg[i][0].st = MN.query(i);


    segment_tree tree[20];

    rep(i,1,19){
        tree[i-1].init(i-1);
        rep(j,1,n){
            seg[j][i].st = tree[i-1].query_min(seg[j][i-1].st,seg[j][i-1].nd);
            seg[j][i].nd = tree[i-1].query_max(seg[j][i-1].st,seg[j][i-1].nd);
        }
    }
  /*  rep(i,1,n)cout<<seg[i][2].st<<','<<seg[i][2].nd<<' ';cout<<'\n';
    rep(i,1,n)cout<<seg[i][3].st<<','<<seg[i][3].nd<<' ';cout<<'\n';
    return 0;
*/
    int q;cin>>q;
    rep(i,1,q){
        int a,b;cin>>a>>b;
        int ans = 0;
        pii naj = {a,a};
        for(int j=18; j>=0; j--){
            pii akt;
            akt.st = tree[j].query_min(naj.st,naj.nd);
            akt.nd = tree[j].query_max(naj.st,naj.nd);
            if(b<akt.st || b>akt.nd){
                ans+=(1<<j);
                naj = akt;
            }
        }
        ans++;
        naj.st = tree[0].query_min(naj.st,naj.nd);
        naj.nd = tree[0].query_max(naj.st,naj.nd);
        if(naj.st<=b && naj.nd>=b)cout<<ans<<'\n';
        else cout<<"-1\n";
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 82780 KB Output is correct
2 Correct 32 ms 83188 KB Output is correct
3 Correct 34 ms 82604 KB Output is correct
4 Correct 35 ms 82936 KB Output is correct
5 Correct 33 ms 82772 KB Output is correct
6 Correct 34 ms 82640 KB Output is correct
7 Correct 33 ms 82768 KB Output is correct
8 Correct 33 ms 82768 KB Output is correct
9 Correct 33 ms 82772 KB Output is correct
10 Correct 29 ms 82516 KB Output is correct
11 Correct 32 ms 82772 KB Output is correct
12 Correct 31 ms 82772 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 82780 KB Output is correct
2 Correct 32 ms 83188 KB Output is correct
3 Correct 34 ms 82604 KB Output is correct
4 Correct 35 ms 82936 KB Output is correct
5 Correct 33 ms 82772 KB Output is correct
6 Correct 34 ms 82640 KB Output is correct
7 Correct 33 ms 82768 KB Output is correct
8 Correct 33 ms 82768 KB Output is correct
9 Correct 33 ms 82772 KB Output is correct
10 Correct 29 ms 82516 KB Output is correct
11 Correct 32 ms 82772 KB Output is correct
12 Correct 31 ms 82772 KB Output is correct
13 Correct 143 ms 85012 KB Output is correct
14 Correct 111 ms 85268 KB Output is correct
15 Correct 77 ms 84740 KB Output is correct
16 Correct 173 ms 84796 KB Output is correct
17 Correct 84 ms 84816 KB Output is correct
18 Correct 176 ms 84824 KB Output is correct
19 Correct 160 ms 84772 KB Output is correct
20 Correct 173 ms 84816 KB Output is correct
21 Correct 172 ms 84820 KB Output is correct
22 Correct 203 ms 85204 KB Output is correct
23 Correct 138 ms 84820 KB Output is correct
24 Correct 63 ms 84820 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2033 ms 42184 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2035 ms 4816 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2023 ms 7948 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 32 ms 82780 KB Output is correct
2 Correct 32 ms 83188 KB Output is correct
3 Correct 34 ms 82604 KB Output is correct
4 Correct 35 ms 82936 KB Output is correct
5 Correct 33 ms 82772 KB Output is correct
6 Correct 34 ms 82640 KB Output is correct
7 Correct 33 ms 82768 KB Output is correct
8 Correct 33 ms 82768 KB Output is correct
9 Correct 33 ms 82772 KB Output is correct
10 Correct 29 ms 82516 KB Output is correct
11 Correct 32 ms 82772 KB Output is correct
12 Correct 31 ms 82772 KB Output is correct
13 Correct 143 ms 85012 KB Output is correct
14 Correct 111 ms 85268 KB Output is correct
15 Correct 77 ms 84740 KB Output is correct
16 Correct 173 ms 84796 KB Output is correct
17 Correct 84 ms 84816 KB Output is correct
18 Correct 176 ms 84824 KB Output is correct
19 Correct 160 ms 84772 KB Output is correct
20 Correct 173 ms 84816 KB Output is correct
21 Correct 172 ms 84820 KB Output is correct
22 Correct 203 ms 85204 KB Output is correct
23 Correct 138 ms 84820 KB Output is correct
24 Correct 63 ms 84820 KB Output is correct
25 Execution timed out 2033 ms 42184 KB Time limit exceeded
26 Halted 0 ms 0 KB -