Submission #833777

#TimeUsernameProblemLanguageResultExecution timeMemory
833777LiudasArcade (NOI20_arcade)C++17
7 / 100
1 ms240 KiB
#include <iostream>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
struct button{
    int A, T;
    bool operator<(button &x){
        return T < x.T;
    }
};
int main(){
    int N, M;
    cin >> N >> M;
    vector<button> arr(M);
    for(int i = 0; i < M; i ++){
        cin >> arr[i].T;
    }
    for(int j = 0; j < M; j ++){
        cin >> arr[j].A;
    }
    sort(arr.begin(), arr.end());
    int s = arr[0].A, t = arr[0].T;
    for(int i = 0; i < M; i ++){
        if(arr[i].T-t < abs(arr[i].A-s)){
            cout << 2 << endl;
            return 0;
        }
        t = arr[i].T;
        s = arr[i].A;
    }
    cout << 1 << endl;
    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...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...