oj.uz

Submission #1102323

# Submission time Handle Problem Language Result Execution time Memory
1102323 2024-10-18T02:22:06 Z ioane Nile (IOI24_nile) C++17
17 / 100
 2000 ms 4292 KB 
#include <bits/stdc++.h>
 
#define LL long long
#define PB push_back
#define MP make_pair
#define F first
#define S second

#define FF fflush(stdout)
#define d(C) C-'a'
 
const LL N = 250005;
const LL mod = 1000000007;
 
using namespace std;

std::vector<long long> calculate_costs(
    std::vector<int> W, std::vector<int> A, 
    std::vector<int> B, std::vector<int> E) {
    
    int n = W.size();
    int q = E.size();
    long long total_a = 0;
    
    // vector<pair<int, pair<int, int> > > v;
    vector<pair<int, int> > v;
    for (int i = 0; i < n; ++i){
        // v.PB(MP(W[i], MP(A[i], B[i])));
        v.PB(MP(W[i], A[i] - B[i]));
        total_a += A[i];
    }
    sort(v.begin(), v.end());
    
    std::vector<long long> result;
    
    for (int i_E = 0; i_E < q; ++i_E){
        int d = E[i_E];
        LL dp[n+1];
        memset(dp, 0, (n+1) * sizeof(LL));
        for (int i = 1; i < n; ++i){
            LL ndp = dp[i-1];
            int j = i - 1;
            while (j >= 0 && v[j].F + d >= v[i].F){
                int profit = v[i].S + v[j].S;
                ndp = max(ndp, (j > 0 ? dp[j-1] : 0) + (LL)profit);
                --j;
            }
            dp[i] = ndp;
        }
        result.PB(total_a - dp[n-1]);
    }
    
    return result;
}

//      IIIIIIIII      OOOOO             A          NN        N    EEEEEEEEEE
//          I         O     O           A A         N N       N    E
//          I        O       O         A   A        N  N      N    E
//          I        O       O        A     A       N   N     N    E
//          I        O       O       AAAAAAAAA      N    N    N    EEEEEEEE
//          I        O       O      A         A     N     N   N    E
//          I        O       O     A           A    N      N  N    E
//          I         O     O     A             A   N       N N    E
//      IIIIIIIII      OOOOO     A               A  N        NN    EEEEEEEEEE ___ KAPANADZE

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 10 ms 524 KB Output is correct
3 Correct 11 ms 336 KB Output is correct
4 Correct 10 ms 540 KB Output is correct
5 Correct 13 ms 524 KB Output is correct
6 Correct 10 ms 336 KB Output is correct

Subtask #2
0.0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2040 ms 4284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 4292 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 10 ms 524 KB Output is correct
3 Correct 11 ms 336 KB Output is correct
4 Correct 10 ms 540 KB Output is correct
5 Correct 13 ms 524 KB Output is correct
6 Correct 10 ms 336 KB Output is correct
7 Correct 3 ms 336 KB Output is correct
8 Correct 3 ms 336 KB Output is correct
9 Correct 3 ms 336 KB Output is correct
10 Correct 3 ms 336 KB Output is correct
11 Correct 3 ms 336 KB Output is correct
12 Correct 4 ms 336 KB Output is correct

Subtask #5
0.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 504 KB Output is correct
2 Correct 10 ms 524 KB Output is correct
3 Correct 11 ms 336 KB Output is correct
4 Correct 10 ms 540 KB Output is correct
5 Correct 13 ms 524 KB Output is correct
6 Correct 10 ms 336 KB Output is correct
7 Execution timed out 2040 ms 4284 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0.0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2070 ms 4292 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 336 KB Output is correct
2 Correct 13 ms 504 KB Output is correct
3 Correct 10 ms 524 KB Output is correct
4 Correct 11 ms 336 KB Output is correct
5 Correct 10 ms 540 KB Output is correct
6 Correct 13 ms 524 KB Output is correct
7 Correct 10 ms 336 KB Output is correct
8 Execution timed out 2040 ms 4284 KB Time limit exceeded
9 Halted 0 ms 0 KB -