oj.uz

답안 #1053435

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1053435 2024-08-11T11:50:43 Z Ludissey Bikeparking (EGOI24_bikeparking) C++17
68 / 100
 1000 ms 40364 KB 
#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->lazy=v;
        x->propagate();
        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);
    vector<int> Y(N);
    for (int i = 0; i < N; i++) cin >> X[i];
    for (int i = 0; i < N; i++) cin >> y[i];
    for (int i = 0; i < N; i++) Y[i]=y[i];
    node* root = new node();
    build(root,0,N-1);
    int sm=0;
    vector<int> kp(N,0);
    /*for (int i = 0; i < N; i++)
    {
        int xsm=sm;
        if(y[i]==0||i==0) {kp[i]+=y[i]; continue;}
        int l=0, r=i-1;
        while(l<r){
            int mid=(l+r+1)/2;
            int q=query(root,0,N-1,mid,i-1);
            if(q>=y[i]){
                l=mid;
            }else{
                r=mid-1;
            }
        }
        if(l+1<i) {
            int q=query(root,0,N-1,l+1,i-1);
            y[i]-=q;
            sm+=q;
            update(root,0,N-1,l+1,i-1,0);
        }
        int q=query(root,0,N-1,l,l);
        int df=min(q,y[i]);
        sm+=df;
        y[i]-=df;
        update(root,0,N-1,l,l,q-df);
        kp[i]+=y[i];
        cout<< "MADE " << sm-xsm << "\n";
        for (int j = 0; j < N; j++)
        {
            cout<< query(root,0,N-1,j,j) << " ";
        }
        cout<<"\n";
        kp[i]=0;
    }
    cout << "\n";*/
    sm=0;
    for (int i = 0; i < N; i++)
    {
        int xsm=sm;
        int l=i-1;
        while(l>=0){
            int df=min(Y[i],X[l]);
            X[l]-=df;
            Y[i]-=df;
            sm+=df;
            if(Y[i]==0) break;
            l--;
        }
        kp[i]+=Y[i];
        //cout<< "MADE " << sm-xsm << "\n";
        for (int j = 0; j < N; j++)
        {
            //cout<< X[j] << " ";
        }
        //cout<<"\n";
    }   
    for (int i = 0; i < N; i++){
        int df=min(X[i],kp[i]);
        kp[i]-=df;
        sm-=kp[i];
    }
    cout << sm << "\n";
    return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:118:13: warning: unused variable 'xsm' [-Wunused-variable]
  118 |         int xsm=sm;
      |             ^~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 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 38 ms 37784 KB Output is correct
6 Correct 35 ms 37968 KB Output is correct
7 Correct 48 ms 37972 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

Subtask #3
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 34 ms 37968 KB Output is correct
3 Correct 34 ms 37772 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 76 ms 37968 KB Output is correct
11 Correct 82 ms 38012 KB Output is correct
12 Correct 61 ms 37804 KB Output is correct
13 Correct 65 ms 37860 KB Output is correct
14 Correct 41 ms 37976 KB Output is correct
15 Correct 46 ms 37980 KB Output is correct
16 Correct 78 ms 38012 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #4
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 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 0 ms 348 KB Output is correct
27 Correct 0 ms 344 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 356 KB Output is correct
33 Correct 0 ms 348 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 344 KB Output is correct
39 Correct 0 ms 348 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 0 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 1 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 460 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 344 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 456 KB Output is correct
61 Correct 0 ms 348 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 0 ms 348 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 452 KB Output is correct
71 Correct 0 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 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 344 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 344 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 0 ms 352 KB Output is correct
89 Correct 0 ms 348 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct

Subtask #5
0.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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 344 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 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 38 ms 37784 KB Output is correct
27 Correct 35 ms 37968 KB Output is correct
28 Correct 48 ms 37972 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 1 ms 348 KB Output is correct
33 Correct 34 ms 37968 KB Output is correct
34 Correct 34 ms 37772 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 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 76 ms 37968 KB Output is correct
42 Correct 82 ms 38012 KB Output is correct
43 Correct 61 ms 37804 KB Output is correct
44 Correct 65 ms 37860 KB Output is correct
45 Correct 41 ms 37976 KB Output is correct
46 Correct 46 ms 37980 KB Output is correct
47 Correct 78 ms 38012 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 348 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 344 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 356 KB Output is correct
61 Correct 0 ms 348 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 344 KB Output is correct
67 Correct 0 ms 348 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 0 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 1 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 460 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 0 ms 348 KB Output is correct
85 Correct 0 ms 344 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 0 ms 456 KB Output is correct
89 Correct 0 ms 348 KB Output is correct
90 Correct 0 ms 348 KB Output is correct
91 Correct 0 ms 348 KB Output is correct
92 Correct 0 ms 348 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 0 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 0 ms 348 KB Output is correct
98 Correct 0 ms 452 KB Output is correct
99 Correct 0 ms 348 KB Output is correct
100 Correct 0 ms 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 0 ms 348 KB Output is correct
103 Correct 0 ms 348 KB Output is correct
104 Correct 0 ms 348 KB Output is correct
105 Correct 0 ms 348 KB Output is correct
106 Correct 0 ms 348 KB Output is correct
107 Correct 0 ms 348 KB Output is correct
108 Correct 0 ms 348 KB Output is correct
109 Correct 0 ms 344 KB Output is correct
110 Correct 0 ms 348 KB Output is correct
111 Correct 0 ms 348 KB Output is correct
112 Correct 0 ms 344 KB Output is correct
113 Correct 0 ms 348 KB Output is correct
114 Correct 0 ms 348 KB Output is correct
115 Correct 0 ms 348 KB Output is correct
116 Correct 0 ms 352 KB Output is correct
117 Correct 0 ms 348 KB Output is correct
118 Correct 0 ms 348 KB Output is correct
119 Correct 0 ms 348 KB Output is correct
120 Correct 0 ms 344 KB Output is correct
121 Correct 0 ms 360 KB Output is correct
122 Correct 0 ms 348 KB Output is correct
123 Correct 0 ms 360 KB Output is correct
124 Correct 0 ms 352 KB Output is correct
125 Correct 0 ms 356 KB Output is correct
126 Correct 0 ms 360 KB Output is correct
127 Correct 0 ms 356 KB Output is correct
128 Correct 0 ms 428 KB Output is correct
129 Correct 0 ms 348 KB Output is correct
130 Correct 0 ms 356 KB Output is correct
131 Correct 0 ms 360 KB Output is correct
132 Correct 0 ms 348 KB Output is correct
133 Correct 0 ms 360 KB Output is correct
134 Correct 0 ms 360 KB Output is correct
135 Correct 0 ms 360 KB Output is correct
136 Correct 0 ms 356 KB Output is correct
137 Correct 1 ms 360 KB Output is correct
138 Correct 0 ms 360 KB Output is correct
139 Correct 0 ms 360 KB Output is correct
140 Correct 0 ms 360 KB Output is correct
141 Correct 0 ms 360 KB Output is correct
142 Correct 0 ms 360 KB Output is correct
143 Correct 34 ms 39088 KB Output is correct
144 Correct 35 ms 39004 KB Output is correct
145 Correct 42 ms 40364 KB Output is correct
146 Correct 0 ms 360 KB Output is correct
147 Correct 0 ms 360 KB Output is correct
148 Correct 0 ms 468 KB Output is correct
149 Correct 0 ms 360 KB Output is correct
150 Correct 0 ms 360 KB Output is correct
151 Correct 0 ms 360 KB Output is correct
152 Correct 75 ms 39004 KB Output is correct
153 Correct 71 ms 38604 KB Output is correct
154 Correct 62 ms 39092 KB Output is correct
155 Correct 70 ms 38996 KB Output is correct
156 Correct 38 ms 39108 KB Output is correct
157 Correct 51 ms 38992 KB Output is correct
158 Correct 78 ms 39052 KB Output is correct
159 Correct 0 ms 344 KB Output is correct
160 Correct 0 ms 348 KB Output is correct
161 Correct 0 ms 348 KB Output is correct
162 Correct 0 ms 348 KB Output is correct
163 Correct 0 ms 348 KB Output is correct
164 Correct 0 ms 348 KB Output is correct
165 Correct 0 ms 348 KB Output is correct
166 Correct 0 ms 348 KB Output is correct
167 Correct 0 ms 348 KB Output is correct
168 Correct 1 ms 348 KB Output is correct
169 Correct 0 ms 348 KB Output is correct
170 Correct 0 ms 348 KB Output is correct
171 Correct 0 ms 348 KB Output is correct
172 Correct 0 ms 348 KB Output is correct
173 Correct 0 ms 348 KB Output is correct
174 Correct 0 ms 348 KB Output is correct
175 Correct 0 ms 348 KB Output is correct
176 Correct 0 ms 348 KB Output is correct
177 Correct 0 ms 344 KB Output is correct
178 Correct 0 ms 348 KB Output is correct
179 Correct 0 ms 348 KB Output is correct
180 Correct 0 ms 348 KB Output is correct
181 Correct 0 ms 348 KB Output is correct
182 Correct 0 ms 348 KB Output is correct
183 Correct 0 ms 348 KB Output is correct
184 Correct 0 ms 348 KB Output is correct
185 Correct 0 ms 348 KB Output is correct
186 Correct 0 ms 348 KB Output is correct
187 Correct 0 ms 348 KB Output is correct
188 Correct 0 ms 452 KB Output is correct
189 Correct 0 ms 452 KB Output is correct
190 Correct 0 ms 348 KB Output is correct
191 Correct 1 ms 344 KB Output is correct
192 Correct 0 ms 348 KB Output is correct
193 Correct 0 ms 344 KB Output is correct
194 Correct 0 ms 348 KB Output is correct
195 Correct 0 ms 348 KB Output is correct
196 Correct 0 ms 348 KB Output is correct
197 Correct 34 ms 39140 KB Output is correct
198 Execution timed out 1097 ms 39520 KB Time limit exceeded
199 Halted 0 ms 0 KB -