oj.uz

Submission #1034246

# Submission time Handle Problem Language Result Execution time Memory
1034246 2024-07-25T11:15:24 Z Antekb Escape Route 2 (JOI24_escape2) C++17
23 / 100
 3000 ms 73220 KB 
#include "bits/stdc++.h"	/** keep-include */
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
	return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
	o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
	return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
	((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

const int K=19, N=3e5+5;

vector<pii> loty[N];
vector<int> id[N];
int nxt[K][N];
ll czas[K][N];

pair<int, ll> jump(int v, int t){
    ll res=0;
    for(int k=K-1; k>=0; k--){
        if(t>=(1<<k)){
            res+=czas[k][v];
            v=nxt[k][v];
            t-=(1<<k);
        }
    }
    return mp(v, res);
}

void solve() {
	int n, t;
    cin>>n>>t;
    vector<pair<pii, int> > co;
    co.pb(mp(mp(0, 0), 0));
    for(int i=1; i<n; i++){
        int k;
        cin>>k;
        vector<pair<int, int> > V(k);
        for(auto &j:V){
            cin>>j.st>>j.nd;
        }
        sort(all(V));
        vector<pii> V2;
        for(auto &j:V){
            while(V2.size() && V2.back().nd>=j.nd){
                V.pop_back();
            }
            V2.pb(j);
        }
        k=V2.size();
        for(int j=0; j<k; j++){
            id[i].pb(co.size());
            co.pb(mp(V2[j], i));
        }
        loty[i]=V2;
    }

    for(int j=1; j<co.size(); j++){
        auto &[seg, i] = co[j];
        if(i!=n-1){
            auto it=lower_bound(all(loty[i+1]), mp(seg.nd, 0));
            if(it==loty[i+1].end()){
                it=loty[i+1].begin();
                nxt[0][j]=id[i+1][it-loty[i+1].begin()];
                czas[0][j]=it->nd-seg.nd+t;
                deb(czas[0][j], it->nd, seg.nd,t);
            }
            else{
                nxt[0][j]=id[i+1][it-loty[i+1].begin()];
                czas[0][j]=it->nd-seg.nd;
            }
        }
        deb(j, seg, i, co[nxt[0][j]], czas[0][j]);
    }
    for(int k=1; k<K; k++){
        for(int i=1; i<co.size(); i++){
            nxt[k][i]=nxt[k-1][nxt[k-1][i]];
            czas[k][i]=czas[k-1][i]+czas[k-1][nxt[k-1][i]];
        }
    }
    map<pair<int, int> , ll> old_ans;
    int q;
    cin>>q;
    while(q--){
        int l, r;
        cin>>l>>r;
        if(old_ans.find(mp(l, r))!=old_ans.end()){
            cout<<old_ans[mp(l, r)]<<"\n";
            continue;
        }
        ll ans=1e18;
        for(int i=0; i<loty[l].size(); i++){
            ll part=loty[l][i].nd-loty[l][i].st;
            int lot=id[l][i];
            deb(lot);
            /*for(int j=l+1; j<r; j++){
                part+=czas[0][lot];
                lot=nxt[0][lot];
            }*/
            part+=jump(lot, r-l-1).nd;
            deb(part);
            ans=min(ans, part);
        }
        old_ans[mp(l, r)]=ans;
        cout<<ans<<"\n";
    }
}

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int tt = 1;
	// cin >> tt;
	FOR(te, 0, tt) solve();
	return 0;
}

Compilation message

Main.cpp:17:18: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                  ^~~~
Main.cpp:17:32: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                ^~~~
Main.cpp:17:38: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   17 | auto &operator<<(auto &o, pair<auto, auto> p) {
      |                                      ^~~~
Main.cpp:19:17: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                 ^~~~
Main.cpp:19:26: warning: use of 'auto' in parameter declaration only available with '-fconcepts-ts'
   19 | auto operator<<(auto &o, auto x)->decltype(end(x), o) {
      |                          ^~~~
Main.cpp: In function 'void solve()':
Main.cpp:76:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   76 |     for(int j=1; j<co.size(); j++){
      |                  ~^~~~~~~~~~
Main.cpp:94:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |         for(int i=1; i<co.size(); i++){
      |                      ~^~~~~~~~~~
Main.cpp:110:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  110 |         for(int i=0; i<loty[l].size(); i++){
      |                      ~^~~~~~~~~~~~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 41 ms 17664 KB Output is correct
3 Correct 152 ms 31656 KB Output is correct
4 Correct 214 ms 36948 KB Output is correct
5 Correct 170 ms 32084 KB Output is correct
6 Correct 260 ms 36724 KB Output is correct
7 Correct 215 ms 36756 KB Output is correct
8 Correct 163 ms 31056 KB Output is correct
9 Correct 211 ms 36696 KB Output is correct

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 41 ms 17664 KB Output is correct
3 Correct 152 ms 31656 KB Output is correct
4 Correct 214 ms 36948 KB Output is correct
5 Correct 170 ms 32084 KB Output is correct
6 Correct 260 ms 36724 KB Output is correct
7 Correct 215 ms 36756 KB Output is correct
8 Correct 163 ms 31056 KB Output is correct
9 Correct 211 ms 36696 KB Output is correct
10 Correct 6 ms 14684 KB Output is correct
11 Correct 161 ms 23764 KB Output is correct
12 Correct 159 ms 23568 KB Output is correct
13 Correct 158 ms 23528 KB Output is correct
14 Correct 159 ms 23636 KB Output is correct
15 Correct 196 ms 30124 KB Output is correct
16 Execution timed out 3082 ms 14428 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 41 ms 17664 KB Output is correct
3 Correct 152 ms 31656 KB Output is correct
4 Correct 214 ms 36948 KB Output is correct
5 Correct 170 ms 32084 KB Output is correct
6 Correct 260 ms 36724 KB Output is correct
7 Correct 215 ms 36756 KB Output is correct
8 Correct 163 ms 31056 KB Output is correct
9 Correct 211 ms 36696 KB Output is correct
10 Correct 255 ms 54512 KB Output is correct
11 Correct 365 ms 71940 KB Output is correct
12 Correct 420 ms 71932 KB Output is correct
13 Correct 304 ms 66620 KB Output is correct
14 Correct 409 ms 73220 KB Output is correct
15 Correct 391 ms 73220 KB Output is correct
16 Correct 244 ms 58112 KB Output is correct
17 Correct 423 ms 73104 KB Output is correct
18 Correct 124 ms 51204 KB Output is correct
19 Correct 107 ms 49960 KB Output is correct
20 Correct 121 ms 51208 KB Output is correct
21 Correct 122 ms 51460 KB Output is correct

Subtask #4
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 41 ms 17664 KB Output is correct
3 Correct 152 ms 31656 KB Output is correct
4 Correct 214 ms 36948 KB Output is correct
5 Correct 170 ms 32084 KB Output is correct
6 Correct 260 ms 36724 KB Output is correct
7 Correct 215 ms 36756 KB Output is correct
8 Correct 163 ms 31056 KB Output is correct
9 Correct 211 ms 36696 KB Output is correct
10 Correct 6 ms 14684 KB Output is correct
11 Correct 161 ms 23764 KB Output is correct
12 Correct 159 ms 23568 KB Output is correct
13 Correct 158 ms 23528 KB Output is correct
14 Correct 159 ms 23636 KB Output is correct
15 Correct 196 ms 30124 KB Output is correct
16 Execution timed out 3082 ms 14428 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 6 ms 14684 KB Output is correct
3 Correct 293 ms 40716 KB Output is correct
4 Correct 325 ms 40812 KB Output is correct
5 Correct 288 ms 40960 KB Output is correct
6 Correct 297 ms 43160 KB Output is correct
7 Correct 296 ms 43012 KB Output is correct
8 Execution timed out 3089 ms 14424 KB Time limit exceeded
9 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14684 KB Output is correct
2 Correct 41 ms 17664 KB Output is correct
3 Correct 152 ms 31656 KB Output is correct
4 Correct 214 ms 36948 KB Output is correct
5 Correct 170 ms 32084 KB Output is correct
6 Correct 260 ms 36724 KB Output is correct
7 Correct 215 ms 36756 KB Output is correct
8 Correct 163 ms 31056 KB Output is correct
9 Correct 211 ms 36696 KB Output is correct
10 Correct 6 ms 14684 KB Output is correct
11 Correct 161 ms 23764 KB Output is correct
12 Correct 159 ms 23568 KB Output is correct
13 Correct 158 ms 23528 KB Output is correct
14 Correct 159 ms 23636 KB Output is correct
15 Correct 196 ms 30124 KB Output is correct
16 Execution timed out 3082 ms 14428 KB Time limit exceeded
17 Halted 0 ms 0 KB -