oj.uz

Submission #1037079

# Submission time Handle Problem Language Result Execution time Memory
1037079 2024-07-28T03:17:18 Z RiverFlow Fruits (NOI22_fruits) C++14
5 / 100
 68 ms 33372 KB 
#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b or a==-1) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)4e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

int n, m, a[N], c[N];

namespace SUB4 {
    const int N=2007;
    long long dp[N][N];
    void sol(vector<int> val) {
        memset(dp, -1, sizeof dp);
        dp[0][0]=0;
        vector<int> ax(n + 1, 0);
        FOR(i, 1, n) ax[i] = max(ax[i-1], a[i]);

//        FOR(j,1,m) cout << val[j] << ' '; cout << nl;

        FOR(i, 0, n - 1)
        FOR(j, 0, m) if (dp[i][j] != -1) {
            maxi(dp[i][j+1], dp[i][j]);
            int CUR_MAX=max(ax[i], val[j]);
            if (a[i+1]==-1){
                maxi(dp[i+1][j+1], dp[i][j] + (val[j+1]>CUR_MAX)*c[val[j+1]]);
                maxi(dp[i+1][j], dp[i][j]);
            } else {
                maxi(dp[i+1][j], dp[i][j] + (a[i+1]>CUR_MAX)*c[a[i+1]]);
            }
        }

        // n, m
        FOR(k, 1, n) {
            long long ans=0;
            FOR(j,0,m)
                ans=max(ans,dp[k][j]);
            cout << ans << ' ';
        }
    }
};

void main_code() {
    cin >> n;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= n; ++i) cin >> c[i];

    vector<int> val(n + 1, 0);
    vector<bool> ex(n + 1, 0);
    for(int i = 1; i <= n; ++i) if (a[i] != -1) {
        ex[a[i]] = 1;
    }
    FOR(i, 1, n) if (ex[i] == 0) val[++m] = i;

    if (m == 0) {
        // case
        long long sum = 0;
        int mx = 0;
        FOR(i, 1, n) {
            if (a[i]>mx)sum+=c[a[i]];
            mx=max(mx,a[i]);
            cout << sum << ' ';
        }
        return ;
    }
    if (m == n) {
        // case
        vector<long long> pref(n+2,0);
        pref[n]=c[n];
        FOD(i,n-1,1)pref[i]=pref[i+1]+c[i];
        FOR(i, 1, n){
            cout << pref[n-i+1] << ' ';
        }
        return ;
    }
    if (n <= 2000) {
        return SUB4::sol(val), void();
    }
}


/*     Let the river flows naturally     */

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(task".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 6.0

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

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 4 ms 3108 KB Output is correct
4 Correct 34 ms 10660 KB Output is correct
5 Correct 68 ms 18516 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct

Subtask #3
0 / 11.0

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

Subtask #4
0 / 13.0

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

Subtask #5
0 / 23.0

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

Subtask #6
0 / 42.0

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