Submission #833675

#	Time	Username	Problem	Language	Result	Execution time	Memory
833675		_martynas	Aesthetic (NOI20_aesthetic)	C++11	0 / 100	158 ms	4956 KiB

Aesthetic

#include <bits/stdc++.h>

using namespace std;

const int mxm = 5e5+5;

using ll = long long;

struct Button {
    ll a, t;
    bool operator<(const Button& other) {
        return t < other.t;
    }
};

Button B[mxm];

int main(int argc, char const *argv[]) {
    int n, m; cin >> n >> m;
    for(int i = 0; i < m; i++) cin >> B[i].a;
    for(int i = 0; i < m; i++) cin >> B[i].t;
    sort(B, B+m);
    bool poss1 = true;
    ll x = B[0].a;
    for(int i = 1; i < m; i++) {
        if(labs(B[i].a-x) > B[i].t-B[i-1].t) {
            poss1 = false;
        }
        x = B[i].a;
    }
    cout << (poss1 ? 1 : 2) << "\n";
    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 8
• Subtask 3: 0 / 7
• Subtask 4: 0 / 15
• Subtask 5: 0 / 16
• Subtask 6: 0 / 22
• Subtask 7: 0 / 27