Submission #1232417

#TimeUsernameProblemLanguageResultExecution timeMemory
1232417yixuan19Bikeparking (EGOI24_bikeparking)C++20
0 / 100
47 ms2632 KiB
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>

using namespace std;
int N, M, Q, f, start, target, min_time, r, l;

int find_friend(int f){
    if (f >= N) return f-N;
    return f + N;
}
int dist(int a, int b){
    if (b > a){
        swap(a,b);
    }
    return min(a-b,2*N - a + b);
}
int main(){
    int N, slot, user;
    cin >> N;
    vector<int> slots(N+1,0);
    vector<int> users(N+1,0);
    for (int i = 0; i < N; ++i){
        cin >> slots[i];
    }
    for (int i = 0; i < N; ++i){
        cin >> users[i];
    }
    if (N<=2){
        cout<<slots[0]-users[0]<<endl;
    }else{
        cout<<slots[0]<<endl;
    }
    
}
#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...