oj.uz

Submission #672441

# Submission time Handle Problem Language Result Execution time Memory
672441 2022-12-16T08:26:36 Z Koful123 Džumbus (COCI19_dzumbus) C++17
20 / 110
 4 ms 724 KB 
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cerr << #x << " = " << x << endl
#define _ << " _ " <<
 
typedef long long ll;
typedef long double ld;

const int MAXN = 1010, MAXS = 1010, MAXQ = 2e5 + 10;
const int INF = 1e8;

int n, m, q;
ll c[MAXN];
vector<int> e[MAXN];
int dp[MAXS][2][2];

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> n >> m;
    for (int i = 0; i < n; i++) cin >> c[i];
    for (int i = 0; i < m; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        e[a].push_back(b);
        e[b].push_back(a);
    }

    int x = -1, prev_x = -1;
    for (int i = 0; i < n; i++)
        if (e[i].size() == 1) {
            prev_x = i;
            x = e[i][0];
            break;
        }

    for (int i = 0; i < MAXS; i++)
        dp[i][1][0] = -INF;

    while (true) {
        for (int i = 0; i < MAXS; i++) {
            dp[i][0][1] = max(dp[i][0][0], dp[i][1][0]);
            dp[i][1][1] = -INF;
            if (c[x] <= i) dp[i][1][1] = dp[i - c[x]][1][0] + 1;
            if (c[x] + c[prev_x] <= i)
                dp[i][1][1] = max(dp[i][1][1],
                        dp[i - c[x] - c[prev_x]][0][0] + 2);
        }

        for (int i = 0; i < MAXS; i++) {
            dp[i][0][0] = dp[i][0][1];
            dp[i][1][0] = dp[i][1][1];
        }

        if (e[x].size() == 1) break;
        int tmp = e[x][0] + e[x][1] - prev_x;
        prev_x = x;
        x = tmp;
    }

    cin >> q;
    while (q--) {
        int s;
        cin >> s;
        cout << max(dp[s][0][0], dp[s][1][0]) << "\n";
    }

    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 364 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Runtime error 4 ms 724 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -

Subtask #3
0 / 30.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 488 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 340 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Runtime error 4 ms 724 KB Execution killed with signal 11
4 Halted 0 ms 0 KB -