Submission #66746613

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include <bits/stdc++.h>
using namespace std;
int main() {
    int N, H, M;
    cin >> N >> H >> M;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i] >> B[i];
    }
    const int MAX = 3001;
    vector<vector<bool>> visited(MAX, vector<bool>(MAX, false));
    visited[H][M] = true;
    deque<pair<int, int>> cur;
    cur.emplace_back(H, M);
    int ans = 0;
    for (int i = 0; i < N; ++i) {
        deque<pair<int, int>> nxt;
        vector<vector<bool>> new_visited(MAX, vector<bool>(MAX, false));
        while (!cur.empty()) {
            auto [h, m] = cur.front(); cur.pop_front();
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include <bits/stdc++.h>
using namespace std;

int main() {
    int N, H, M;
    cin >> N >> H >> M;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; ++i) {
        cin >> A[i] >> B[i];
    }
    const int MAX = 3001;
    vector<vector<bool>> visited(MAX, vector<bool>(MAX, false));
    visited[H][M] = true;
    deque<pair<int, int>> cur;
    cur.emplace_back(H, M);
    int ans = 0;
    for (int i = 0; i < N; ++i) {
        deque<pair<int, int>> nxt;
        vector<vector<bool>> new_visited(MAX, vector<bool>(MAX, false));
        while (!cur.empty()) {
            auto [h, m] = cur.front(); cur.pop_front();
            if (h >= A[i]) {
                int nh = h - A[i], nm = m;
                if (!new_visited[nh][nm]) {
                    new_visited[nh][nm] = true;
                    nxt.emplace_back(nh, nm);
                }
            }
            if (m >= B[i]) {
                int nh = h, nm = m - B[i];
                if (!new_visited[nh][nm]) {
                    new_visited[nh][nm] = true;
                    nxt.emplace_back(nh, nm);
                }
            }
        }
        if (nxt.empty()) break;
        visited = move(new_visited);
        cur = move(nxt);
        ++ans;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result