답안 #938477

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
938477	2024-03-05T07:46:03 Z	GrindMachine	추월 (IOI23_overtaking)	C++17	65 / 100	3500 ms	34532 KB

overtaking

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

already know some key ideas

*/

const int MOD = 1e9 + 7;
const int N = 1e3 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "overtaking.h"

vector<ll> T;
vector<int> W,S;
ll X,m;
vector<ll> tim[N], pmx[N];

void init(int L, int n, std::vector<long long> T_, std::vector<int> W_, int X_, int M, std::vector<int> S_)
{
    T = T_, W = W_, S = S_;
    X = X_, m = M;

    ll e[n][m], t[n][n];
    rep(i,n){
        e[i][0] = t[i][0] = T[i];
    }

    rep1(j,m-1){
        rep(i,n){
            e[i][j] = t[i][j-1]+(ll)W[i]*(S[j]-S[j-1]);
            t[i][j] = e[i][j];
        }

        vector<pll> ord;
        rep(i,n){
            ord.pb({t[i][j-1],i});
        }

        sort(all(ord));
        ll ptr = 0, mx = 0;

        rep(i,n){
            while(ptr < n and ord[ptr].ff < ord[i].ff){
                amax(mx,e[ord[ptr].ss][j]);
                ptr++;
            }

            amax(t[ord[i].ss][j],mx);
        }

        mx = 0;
        rep(i,n){
            tim[j-1].pb(ord[i].ff);
            amax(mx,t[ord[i].ss][j]);
            pmx[j-1].pb(mx);
        }
    }
}

long long arrival_time(long long t)
{
    rep(j,m-1){
        ll pos = lower_bound(all(tim[j]),t)-tim[j].begin()-1;
        t += X*(S[j+1]-S[j]);
        if(pos >= 0){
            amax(t,pmx[j][pos]);
        }
    }
    
    return t;    
}

Subtask #0

0.0 / 0.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct

Subtask #1

9.0 / 9.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	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	2 ms	348 KB	Output is correct
7	Correct	3 ms	348 KB	Output is correct
8	Correct	3 ms	492 KB	Output is correct
9	Correct	3 ms	604 KB	Output is correct
10	Correct	3 ms	604 KB	Output is correct
11	Correct	3 ms	604 KB	Output is correct

Subtask #2

10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	0 ms	344 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	1628 KB	Output is correct
6	Correct	3 ms	5468 KB	Output is correct
7	Correct	5 ms	8284 KB	Output is correct
8	Correct	5 ms	8284 KB	Output is correct
9	Correct	4 ms	8284 KB	Output is correct
10	Correct	5 ms	8280 KB	Output is correct
11	Correct	5 ms	8284 KB	Output is correct
12	Correct	4 ms	8284 KB	Output is correct
13	Correct	5 ms	8284 KB	Output is correct
14	Correct	5 ms	8280 KB	Output is correct

Subtask #3

20.0 / 20.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	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	1 ms	348 KB	Output is correct
8	Correct	0 ms	344 KB	Output is correct
9	Correct	1 ms	856 KB	Output is correct
10	Correct	1 ms	860 KB	Output is correct
11	Correct	1 ms	740 KB	Output is correct
12	Correct	1 ms	860 KB	Output is correct
13	Correct	1 ms	860 KB	Output is correct
14	Correct	1 ms	860 KB	Output is correct
15	Correct	1 ms	856 KB	Output is correct
16	Correct	1 ms	860 KB	Output is correct
17	Correct	1 ms	860 KB	Output is correct
18	Correct	1 ms	860 KB	Output is correct
19	Correct	1 ms	860 KB	Output is correct
20	Correct	1 ms	860 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	1 ms	680 KB	Output is correct
23	Correct	1 ms	860 KB	Output is correct
24	Correct	1 ms	860 KB	Output is correct
25	Correct	1 ms	856 KB	Output is correct
26	Correct	1 ms	860 KB	Output is correct
27	Correct	1 ms	744 KB	Output is correct
28	Correct	1 ms	600 KB	Output is correct
29	Correct	1 ms	740 KB	Output is correct
30	Correct	1 ms	604 KB	Output is correct
31	Correct	1 ms	604 KB	Output is correct
32	Correct	1 ms	860 KB	Output is correct
33	Correct	1 ms	860 KB	Output is correct
34	Correct	1 ms	860 KB	Output is correct
35	Correct	1 ms	732 KB	Output is correct
36	Correct	1 ms	860 KB	Output is correct
37	Correct	1 ms	860 KB	Output is correct
38	Correct	1 ms	856 KB	Output is correct
39	Correct	1 ms	860 KB	Output is correct
40	Correct	1 ms	788 KB	Output is correct

Subtask #4

26.0 / 26.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	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	492 KB	Output is correct
10	Correct	3 ms	604 KB	Output is correct
11	Correct	3 ms	604 KB	Output is correct
12	Correct	3 ms	604 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	344 KB	Output is correct
16	Correct	1 ms	856 KB	Output is correct
17	Correct	1 ms	860 KB	Output is correct
18	Correct	1 ms	740 KB	Output is correct
19	Correct	1 ms	860 KB	Output is correct
20	Correct	1 ms	860 KB	Output is correct
21	Correct	1 ms	860 KB	Output is correct
22	Correct	1 ms	856 KB	Output is correct
23	Correct	1 ms	860 KB	Output is correct
24	Correct	1 ms	860 KB	Output is correct
25	Correct	1 ms	860 KB	Output is correct
26	Correct	1 ms	860 KB	Output is correct
27	Correct	1 ms	860 KB	Output is correct
28	Correct	1 ms	604 KB	Output is correct
29	Correct	1 ms	680 KB	Output is correct
30	Correct	1 ms	860 KB	Output is correct
31	Correct	1 ms	860 KB	Output is correct
32	Correct	1 ms	856 KB	Output is correct
33	Correct	1 ms	860 KB	Output is correct
34	Correct	1 ms	744 KB	Output is correct
35	Correct	1 ms	600 KB	Output is correct
36	Correct	1 ms	740 KB	Output is correct
37	Correct	1 ms	604 KB	Output is correct
38	Correct	1 ms	604 KB	Output is correct
39	Correct	1 ms	860 KB	Output is correct
40	Correct	1 ms	860 KB	Output is correct
41	Correct	1 ms	860 KB	Output is correct
42	Correct	1 ms	732 KB	Output is correct
43	Correct	1 ms	860 KB	Output is correct
44	Correct	1 ms	860 KB	Output is correct
45	Correct	1 ms	856 KB	Output is correct
46	Correct	1 ms	860 KB	Output is correct
47	Correct	1 ms	788 KB	Output is correct
48	Correct	110 ms	32140 KB	Output is correct
49	Correct	209 ms	32360 KB	Output is correct
50	Correct	196 ms	32340 KB	Output is correct
51	Correct	203 ms	32384 KB	Output is correct
52	Correct	201 ms	32340 KB	Output is correct
53	Correct	208 ms	32388 KB	Output is correct
54	Correct	194 ms	32336 KB	Output is correct
55	Correct	118 ms	32168 KB	Output is correct
56	Correct	193 ms	32336 KB	Output is correct
57	Correct	209 ms	32344 KB	Output is correct
58	Correct	204 ms	32340 KB	Output is correct
59	Correct	210 ms	32384 KB	Output is correct
60	Correct	202 ms	32388 KB	Output is correct
61	Correct	210 ms	32336 KB	Output is correct
62	Correct	12 ms	604 KB	Output is correct
63	Correct	5 ms	8436 KB	Output is correct
64	Correct	191 ms	14548 KB	Output is correct
65	Correct	177 ms	20436 KB	Output is correct
66	Correct	392 ms	32344 KB	Output is correct
67	Correct	409 ms	32420 KB	Output is correct
68	Correct	413 ms	32412 KB	Output is correct
69	Correct	239 ms	32384 KB	Output is correct
70	Correct	251 ms	32348 KB	Output is correct
71	Correct	265 ms	32528 KB	Output is correct
72	Correct	259 ms	32220 KB	Output is correct
73	Correct	264 ms	32336 KB	Output is correct
74	Correct	268 ms	32212 KB	Output is correct
75	Correct	370 ms	32340 KB	Output is correct
76	Correct	369 ms	32384 KB	Output is correct
77	Correct	386 ms	32336 KB	Output is correct
78	Correct	187 ms	32340 KB	Output is correct

Subtask #5

0.0 / 35.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	1 ms	344 KB	Output is correct
5	Correct	1 ms	348 KB	Output is correct
6	Correct	1 ms	348 KB	Output is correct
7	Correct	2 ms	348 KB	Output is correct
8	Correct	3 ms	348 KB	Output is correct
9	Correct	3 ms	492 KB	Output is correct
10	Correct	3 ms	604 KB	Output is correct
11	Correct	3 ms	604 KB	Output is correct
12	Correct	3 ms	604 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	344 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	1628 KB	Output is correct
18	Correct	3 ms	5468 KB	Output is correct
19	Correct	5 ms	8284 KB	Output is correct
20	Correct	5 ms	8284 KB	Output is correct
21	Correct	4 ms	8284 KB	Output is correct
22	Correct	5 ms	8280 KB	Output is correct
23	Correct	5 ms	8284 KB	Output is correct
24	Correct	4 ms	8284 KB	Output is correct
25	Correct	5 ms	8284 KB	Output is correct
26	Correct	5 ms	8280 KB	Output is correct
27	Correct	1 ms	856 KB	Output is correct
28	Correct	1 ms	860 KB	Output is correct
29	Correct	1 ms	740 KB	Output is correct
30	Correct	1 ms	860 KB	Output is correct
31	Correct	1 ms	860 KB	Output is correct
32	Correct	1 ms	860 KB	Output is correct
33	Correct	1 ms	856 KB	Output is correct
34	Correct	1 ms	860 KB	Output is correct
35	Correct	1 ms	860 KB	Output is correct
36	Correct	1 ms	860 KB	Output is correct
37	Correct	1 ms	860 KB	Output is correct
38	Correct	1 ms	860 KB	Output is correct
39	Correct	1 ms	604 KB	Output is correct
40	Correct	1 ms	680 KB	Output is correct
41	Correct	1 ms	860 KB	Output is correct
42	Correct	1 ms	860 KB	Output is correct
43	Correct	1 ms	856 KB	Output is correct
44	Correct	1 ms	860 KB	Output is correct
45	Correct	1 ms	744 KB	Output is correct
46	Correct	1 ms	600 KB	Output is correct
47	Correct	1 ms	740 KB	Output is correct
48	Correct	1 ms	604 KB	Output is correct
49	Correct	1 ms	604 KB	Output is correct
50	Correct	1 ms	860 KB	Output is correct
51	Correct	1 ms	860 KB	Output is correct
52	Correct	1 ms	860 KB	Output is correct
53	Correct	1 ms	732 KB	Output is correct
54	Correct	1 ms	860 KB	Output is correct
55	Correct	1 ms	860 KB	Output is correct
56	Correct	1 ms	856 KB	Output is correct
57	Correct	1 ms	860 KB	Output is correct
58	Correct	1 ms	788 KB	Output is correct
59	Correct	110 ms	32140 KB	Output is correct
60	Correct	209 ms	32360 KB	Output is correct
61	Correct	196 ms	32340 KB	Output is correct
62	Correct	203 ms	32384 KB	Output is correct
63	Correct	201 ms	32340 KB	Output is correct
64	Correct	208 ms	32388 KB	Output is correct
65	Correct	194 ms	32336 KB	Output is correct
66	Correct	118 ms	32168 KB	Output is correct
67	Correct	193 ms	32336 KB	Output is correct
68	Correct	209 ms	32344 KB	Output is correct
69	Correct	204 ms	32340 KB	Output is correct
70	Correct	210 ms	32384 KB	Output is correct
71	Correct	202 ms	32388 KB	Output is correct
72	Correct	210 ms	32336 KB	Output is correct
73	Correct	12 ms	604 KB	Output is correct
74	Correct	5 ms	8436 KB	Output is correct
75	Correct	191 ms	14548 KB	Output is correct
76	Correct	177 ms	20436 KB	Output is correct
77	Correct	392 ms	32344 KB	Output is correct
78	Correct	409 ms	32420 KB	Output is correct
79	Correct	413 ms	32412 KB	Output is correct
80	Correct	239 ms	32384 KB	Output is correct
81	Correct	251 ms	32348 KB	Output is correct
82	Correct	265 ms	32528 KB	Output is correct
83	Correct	259 ms	32220 KB	Output is correct
84	Correct	264 ms	32336 KB	Output is correct
85	Correct	268 ms	32212 KB	Output is correct
86	Correct	370 ms	32340 KB	Output is correct
87	Correct	369 ms	32384 KB	Output is correct
88	Correct	386 ms	32336 KB	Output is correct
89	Correct	187 ms	32340 KB	Output is correct
90	Execution timed out	3543 ms	34532 KB	Time limit exceeded
91	Halted	0 ms	0 KB	-