Submission #833731

#	Time	Username	Problem	Language	Result	Execution time	Memory
833731		_martynas	Arcade (NOI20_arcade)	C++11	0 / 100	1 ms	212 KiB

Arcade

#include <bits/stdc++.h>

using namespace std;

const int mxm = 105;

using ll = long long;

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

int n, m;
Button B[mxm];
bool dp[mxm][mxm];

int main(int argc, char const *argv[]) {
    cin >> n >> m;
    for(int i = 0; i < m; i++) cin >> B[i].t;
    for(int i = 0; i < m; i++) cin >> B[i].a;
    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;
    }
    if(poss1 || m <= 1) {
        cout << "1\n"; return 0;
    }
    for(int i = 0; i < m; i++) {
        for(int j = 0; j <= i; j++) {
            if(max(i, j) < 2) {
                dp[i][j] = true;
            }
            else {
                for(int k = 0; k < i; k++) {
                    if(labs(B[k].a-B[i].a) <= B[i].t-B[k].t) {
                        if(k < j) {
                            dp[i][j] = dp[i][j] || (dp[j][k] && j == i-1);
                        }
                        else {
                            dp[i][j] = dp[i][j] || (dp[k][j] && k == i-1);
                        }
                    }
                }
            }
        }
    }
    if(dp[m-1][m-2]) {
        cout << "2\n";
    }
    else {
        cout << "3\n";
    }
    return 0;
}

• Subtask 1: 0 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 12
• Subtask 4: 0 / 21
• Subtask 5: 0 / 14
• Subtask 6: 0 / 20
• Subtask 7: 0 / 15