oj.uz

Submission #833672

# Submission time Handle Problem Language Result Execution time Memory
833672 2023-08-22T07:41:43 Z _martynas Aesthetic (NOI20_aesthetic) C++11
0 / 100
 135 ms 9616 KB 
#include <bits/stdc++.h>

using namespace std;

const int mxm = 5e5+5;

using ll = long long;

ll A[mxm], T[mxm];

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

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 129 ms 9364 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 135 ms 9616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 7780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Incorrect 101 ms 7780 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB Output isn't correct
2 Halted 0 ms 0 KB -