답안 #1053389

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1053389	2024-08-11T11:20:46 Z	Ludissey	Bikeparking (EGOI24_bikeparking)	C++17	44 / 100	758 ms	38352 KB

Main

#include <bits/stdc++.h>
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
 
using namespace std;
int N,M,Q;
vector<int> X,y;
struct node {
	node* left, *right;
	int sum, lazy;
    node(){
        left=NULL;
        left=NULL;
        sum=0;
        lazy=-1;
    }
    void update(){
        sum=left->sum+right->sum;
    }
    void propagate(){
        if(lazy>-1){
            sum=lazy;
            if(left!=NULL){
                left->lazy=lazy;
                right->lazy=lazy;
            }
            lazy=-1;
        }
    }
};
 
void build(node* x, int l, int r){
    if(l==r) x->sum=X[l];
    else{
        x->left=new node();
        x->right=new node();
        int mid=(l+r)/2;
        build(x->left, l, mid);
        build(x->right, mid+1, r);
        x->update();
    }
}
void update(node* x, int l, int r, int qL, int qR, int v){
    x->propagate();
    if(r<qR||l>qL) return;
    if(r<=qR&&l>=qL){
        x->sum=v;
        x->lazy=v;
        return;
    }
    int mid=(l+r)/2;
    update(x->left, l, mid, qL, qR,v);
    update(x->right, mid+1, r, qL, qR,v);
    x->update();
}
 
int query(node* x, int l, int r, int qL, int qR){
    if(r<qL||l>qR) return 0;
    x->propagate();
    if(r<=qR&&l>=qL){
        return x->sum;
    }
    int mid=(l+r)/2;
    return query(x->left, l, mid, qL, qR)+query(x->right, mid+1, r, qL, qR);
}
 
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N;
    X.resize(N),y.resize(N);
    for (int i = 0; i < N; i++) cin >> X[i];
    for (int i = 0; i < N; i++) cin >> y[i];
    node* root = new node();
    build(root,0,N-1);
    int sm=0;
    vector<int> kp(N);
    for (int i = 0; i < N; i++)
    {
        int l=0, r=i-1;
        int ans=0;
        bool b=false;
        while(l<=r){
            int mid=(l+r)/2;
            int q=query(root,0,N-1,mid,i-1);
            if(q>=y[i]){
                b=true;
                ans=mid;
                l=mid+1;
            }else{
                r=mid-1;
            }
        }
        if(ans+1<i) {
            int q=query(root,0,N-1,ans+1,i-1);
            y[i]-=q;
            sm+=q;
            update(root,0,N-1,ans+1,i-1,0);
        }
        if(b){
            int q=query(root,0,N-1,ans,ans);
            int df=min(q,y[i]);
            sm+=df;
            y[i]-=df;
            update(root,0,N-1,ans,ans,q-df);
        }else{
            if(ans<i){
                int q=query(root,0,N-1,ans,i-1);
                y[i]-=q;
                sm+=q;
                update(root,0,N-1,ans,i-1,0);
            }
        }
        kp[i]+=y[i];
    }   
    for (int i = 0; i < N; i++){
        int df=min(query(root,0,N-1,i,i),kp[i]);
        kp[i]-=df;
        sm-=kp[i];
    }
    cout << sm << "\n";
    return 0;
}

Subtask #1
16.0 / 16.0

#	결과	메모리	Grader output
1	Correct	348 KB	Output is correct
2	Correct	348 KB	Output is correct
3	Correct	348 KB	Output is correct
4	Correct	348 KB	Output is correct
5	Correct	348 KB	Output is correct
6	Correct	348 KB	Output is correct
7	Correct	348 KB	Output is correct
8	Correct	348 KB	Output is correct
9	Correct	348 KB	Output is correct
10	Correct	348 KB	Output is correct
11	Correct	348 KB	Output is correct
12	Correct	348 KB	Output is correct
13	Correct	348 KB	Output is correct
14	Correct	348 KB	Output is correct
15	Correct	348 KB	Output is correct
16	Correct	348 KB	Output is correct
17	Correct	348 KB	Output is correct
18	Correct	348 KB	Output is correct
19	Correct	348 KB	Output is correct
20	Correct	452 KB	Output is correct
21	Correct	348 KB	Output is correct

Subtask #2
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	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	737 ms	36572 KB	Output is correct
6	Correct	746 ms	36744 KB	Output is correct
7	Correct	732 ms	38352 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct

Subtask #3
19.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	731 ms	36788 KB	Output is correct
3	Correct	743 ms	36736 KB	Output is correct
4	Correct	0 ms	344 KB	Output is correct
5	Correct	0 ms	348 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	348 KB	Output is correct
10	Correct	750 ms	36656 KB	Output is correct
11	Correct	756 ms	36692 KB	Output is correct
12	Correct	744 ms	36712 KB	Output is correct
13	Correct	753 ms	36688 KB	Output is correct
14	Correct	758 ms	36436 KB	Output is correct
15	Correct	722 ms	36692 KB	Output is correct
16	Correct	746 ms	36688 KB	Output is correct
17	Correct	0 ms	348 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct

Subtask #4
0.0 / 24.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	348 KB	Output is correct
5	Correct	0 ms	348 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 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	0 ms	452 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	344 KB	Output is correct
24	Correct	0 ms	348 KB	Output is correct
25	Correct	0 ms	348 KB	Output is correct
26	Correct	0 ms	348 KB	Output is correct
27	Correct	0 ms	348 KB	Output is correct
28	Correct	0 ms	348 KB	Output is correct
29	Correct	0 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	1 ms	344 KB	Output is correct
34	Correct	0 ms	348 KB	Output is correct
35	Correct	0 ms	348 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	1 ms	344 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	0 ms	348 KB	Output is correct
42	Correct	0 ms	348 KB	Output is correct
43	Correct	1 ms	348 KB	Output is correct
44	Correct	0 ms	348 KB	Output is correct
45	Correct	0 ms	348 KB	Output is correct
46	Correct	0 ms	348 KB	Output is correct
47	Correct	0 ms	348 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Incorrect	0 ms	348 KB	Output isn't correct
51	Halted	0 ms	0 KB	-

Subtask #5
0.0 / 32.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	348 KB	Output is correct
5	Correct	0 ms	348 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	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 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	0 ms	452 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	0 ms	348 KB	Output is correct
26	Correct	737 ms	36572 KB	Output is correct
27	Correct	746 ms	36744 KB	Output is correct
28	Correct	732 ms	38352 KB	Output is correct
29	Correct	1 ms	348 KB	Output is correct
30	Correct	0 ms	348 KB	Output is correct
31	Correct	0 ms	348 KB	Output is correct
32	Correct	0 ms	348 KB	Output is correct
33	Correct	731 ms	36788 KB	Output is correct
34	Correct	743 ms	36736 KB	Output is correct
35	Correct	0 ms	344 KB	Output is correct
36	Correct	0 ms	348 KB	Output is correct
37	Correct	0 ms	348 KB	Output is correct
38	Correct	0 ms	348 KB	Output is correct
39	Correct	0 ms	348 KB	Output is correct
40	Correct	0 ms	348 KB	Output is correct
41	Correct	750 ms	36656 KB	Output is correct
42	Correct	756 ms	36692 KB	Output is correct
43	Correct	744 ms	36712 KB	Output is correct
44	Correct	753 ms	36688 KB	Output is correct
45	Correct	758 ms	36436 KB	Output is correct
46	Correct	722 ms	36692 KB	Output is correct
47	Correct	746 ms	36688 KB	Output is correct
48	Correct	0 ms	348 KB	Output is correct
49	Correct	0 ms	348 KB	Output is correct
50	Correct	0 ms	348 KB	Output is correct
51	Correct	0 ms	344 KB	Output is correct
52	Correct	0 ms	348 KB	Output is correct
53	Correct	0 ms	348 KB	Output is correct
54	Correct	0 ms	348 KB	Output is correct
55	Correct	0 ms	348 KB	Output is correct
56	Correct	0 ms	348 KB	Output is correct
57	Correct	0 ms	348 KB	Output is correct
58	Correct	0 ms	348 KB	Output is correct
59	Correct	0 ms	348 KB	Output is correct
60	Correct	0 ms	348 KB	Output is correct
61	Correct	1 ms	344 KB	Output is correct
62	Correct	0 ms	348 KB	Output is correct
63	Correct	0 ms	348 KB	Output is correct
64	Correct	0 ms	348 KB	Output is correct
65	Correct	0 ms	348 KB	Output is correct
66	Correct	0 ms	348 KB	Output is correct
67	Correct	1 ms	344 KB	Output is correct
68	Correct	0 ms	348 KB	Output is correct
69	Correct	0 ms	348 KB	Output is correct
70	Correct	0 ms	348 KB	Output is correct
71	Correct	1 ms	348 KB	Output is correct
72	Correct	0 ms	348 KB	Output is correct
73	Correct	0 ms	348 KB	Output is correct
74	Correct	0 ms	348 KB	Output is correct
75	Correct	0 ms	348 KB	Output is correct
76	Correct	0 ms	348 KB	Output is correct
77	Correct	0 ms	348 KB	Output is correct
78	Incorrect	0 ms	348 KB	Output isn't correct
79	Halted	0 ms	0 KB	-

답안 #1053389

Compilation message

Subtask #1 16.0 / 16.0

Subtask #2 9.0 / 9.0

Subtask #3 19.0 / 19.0

Subtask #4 0.0 / 24.0

Subtask #5 0.0 / 32.0

Subtask #1
16.0 / 16.0

Subtask #2
9.0 / 9.0

Subtask #3
19.0 / 19.0

Subtask #4
0.0 / 24.0

Subtask #5
0.0 / 32.0