oj.uz

Submission #1053018

# Submission time Handle Problem Language Result Execution time Memory
1053018 2024-08-11T07:58:41 Z Ludissey Bikeparking (EGOI24_bikeparking) C++17
0 / 100
 22 ms 7260 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;
signed main() {
    ios_base::sync_with_stdio(false); cin.tie(nullptr);
    cin >> N;
    vector<int> x(N),y(N);
    vector<int> kp(N);
    for (int i = 0; i < N; i++) cin >> x[i];
    for (int i = 0; i < N; i++) cin >> y[i];
    
    int j=0;
    int sm=0;
    for (int i = 0; i < N; i++)
    {
        while(j<N&&j<i&&y[i]>0 ) {
            if(y[j]>0) { j++; continue; }
            int df=min(x[j],y[i]);
            x[j]-=df;
            y[i]-=df;
            sm+=df;
            if(x[j]==0) j++;
        }
    } 
    for (int i = 0; i < N; i++)
    {
        while(j<i&&y[i]>0 ) {
            int df=min(x[j],y[i]);
            x[j]-=df;
            y[i]-=df;
            sm+=df;
            if(x[j]==0) j++;
        }
        kp[i]+=y[i];
    }   
    for (int i = 0; i < N; i++){
        int df=min(x[i],kp[i]);
        x[i]-=df;
        kp[i]-=df;
        sm-=kp[i];
    }
    cout << sm << "\n";
    return 0;
}

Subtask #1
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0.0 / 9.0

# Verdict Execution time Memory 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 Incorrect 0 ms 348 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 22 ms 7260 KB Output is correct
3 Incorrect 20 ms 7260 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -