Submission #1237775

#TimeUsernameProblemLanguageResultExecution timeMemory
1237775clemmy14Bikeparking (EGOI24_bikeparking)C++20
9 / 100
77 ms4936 KiB
#include<bits/stdc++.h>
#define int long long
using namespace std;

signed main() {
    int n; cin >> n;
    vector<int> x(n), y(n), a, b;
    for(int i=0; i<n; i++) {
        cin >> x[i];
        //for(int j=0; j<x[i]; j++) a.push_back(i);
    }
    for(int i=0; i<n; i++) {
        cin >> y[i];
        //for(int j=0; j<y[i]; j++) b.push_back(i);
    }
    cout << max((long long)0, (n-2)*x[0]);
    // int ans=-1e12;
    // for(int j=0; j<b.size(); j++) {
    //     int cur=0, aa=0;
    //     for(int i=j; i<b.size(); i++) {
    //         if(a[aa] < b[i]) cur++;
    //         else if(a[aa] > b[i]) cur--;
    //         aa++;
    //     }
    //     for(int i=j-1; i>=0; i--) {
    //         if(a[aa] < b[i]) cur++;
    //         else if(a[aa] > b[i]) cur--;
    //         aa++;
    //     }
    //     ans=max(ans, cur);
    // }
    // cout << (ans == -1e12 ? 0 : ans);
    return 0; 
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...