oj.uz

Submission #757933

# Submission time Handle Problem Language Result Execution time Memory
757933 2023-06-14T02:13:20 Z Dexva Fruits (NOI22_fruits) C++14
11 / 100
 91 ms 16844 KB 
#include <bits/stdc++.h>
using namespace std;

#define lln long long

void solve() {
    int n; cin >> n;
    lln ans[n], ref[n], cost[n];
    for (int i=0;i<n;i++) ans[i] = 0;
    for (int i=0;i<n;i++) cin >> ref[i];
    for (int i=0;i<n;i++) cin >> cost[i];
    
    vector<int> cur; //what we will permutate over
    for (int i=0;i<n;i++) {
        cur.push_back(i);
    }

    if (n<=8) { // do brute force solution
        do {
            bool ok = true;
            for (int i=0;i<n;i++) {
                if (ref[i]!=-1 && ref[i]-1!=cur[i]) {
                    ok = false;
                    break;
                }
            }
            if (!ok) continue;
            // else {
            //     for (int i=0;i<n;i++) cout << cur[i] << " ";
            //     cout << '\n';
            // }

            lln cursum = 0, maxtaste = -1;
            for (int k=0;k<n;k++) {
                if (cur[k]>maxtaste) {
                    cursum += cost[cur[k]];
                    maxtaste = cur[k];
                }
                // if (cursum > ans[k]) {
                //     cout << k << " | | " << "current perm: ";
                //     for (int i=0;i<n;i++) cout << cur[i] << " ";
                //     cout << '\n';
                // }
                ans[k] = max(ans[k], cursum);
            }
        } while (next_permutation(cur.begin(),cur.end()));
    } 

    else {
        lln cursum = 0;
        for (int k=n-1;k>=0;k--) {
            cursum += cost[k];
            ans[n-k-1] = cursum;
        }
    } //do dumb greedy solution

    for (int k=0;k<n;k++) {
        cout << ans[k] << " ";
    } cout << '\n';
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    while (t--) solve();
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 5 ms 1236 KB Output is correct
4 Correct 46 ms 8568 KB Output is correct
5 Correct 91 ms 16844 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #5
0 / 23.0

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

Subtask #6
0 / 42.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 5 ms 1236 KB Output is correct
14 Correct 46 ms 8568 KB Output is correct
15 Correct 91 ms 16844 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Incorrect 1 ms 212 KB Output isn't correct
18 Halted 0 ms 0 KB -