oj.uz

답안 #1099784

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1099784 2024-10-12T05:16:42 Z model_code 나일강 (IOI24_nile) C++17
17 / 100
 2000 ms 6700 KB 
// time_limit/hazem_dp_qn2.cpp

#include "bits/stdc++.h"
#include "nile.h"
using namespace std;

const long long INF = 1e14;

vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
    int n = W.size();
    int q = E.size();

    vector<int> ordW(n);
    iota(ordW.begin() ,ordW.end() ,0);
    sort(ordW.begin() ,ordW.end() ,[&](int i ,int j){
        return W[i] < W[j];
    });
    vector<int> w(n), a(n), b(n);
    for(int i = 0; i < n; i++){
        int j = ordW[i];
        w[i] = W[j];
        a[i] = A[j];
        b[i] = B[j];
    }

    auto solve = [&](int d){
        vector<vector<long long>> dp(2, vector<long long>(n+1, INF));
        dp[n&1][n] = 0;
        for(int i = n - 1; i >= 0; i--){
            dp[i&1][n] = min(a[i] + dp[i&1^1][n], b[i] + dp[i&1^1][i]);
            for(int j = i - 1; j >= 0 && w[i] - w[j] <= d; j--)
                dp[i&1][j] = min(a[i] + dp[i&1^1][j], b[i] + dp[i&1^1][n]);
        }
        return dp[0][n];
    };

    vector<long long> R(q);
    for(int i = 0; i < q; i++)
        R[i] = solve(E[i]);
    return R;
}

Compilation message

nile.cpp: In lambda function:
nile.cpp:30:41: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   30 |             dp[i&1][n] = min(a[i] + dp[i&1^1][n], b[i] + dp[i&1^1][i]);
      |                                        ~^~
nile.cpp:30:62: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   30 |             dp[i&1][n] = min(a[i] + dp[i&1^1][n], b[i] + dp[i&1^1][i]);
      |                                                             ~^~
nile.cpp:32:45: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   32 |                 dp[i&1][j] = min(a[i] + dp[i&1^1][j], b[i] + dp[i&1^1][n]);
      |                                            ~^~
nile.cpp:32:66: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
   32 |                 dp[i&1][j] = min(a[i] + dp[i&1^1][j], b[i] + dp[i&1^1][n]);
      |                                                                 ~^~

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 556 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 9 ms 560 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 9 ms 348 KB Output is correct

Subtask #2
0.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2062 ms 6700 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2062 ms 6692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 556 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 9 ms 560 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 9 ms 348 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 3 ms 348 KB Output is correct
9 Correct 3 ms 348 KB Output is correct
10 Correct 3 ms 552 KB Output is correct
11 Correct 3 ms 516 KB Output is correct
12 Correct 3 ms 348 KB Output is correct

Subtask #5
0.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 556 KB Output is correct
2 Correct 9 ms 344 KB Output is correct
3 Correct 9 ms 560 KB Output is correct
4 Correct 10 ms 348 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 9 ms 348 KB Output is correct
7 Execution timed out 2062 ms 6700 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #6
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2062 ms 6692 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 9 ms 556 KB Output is correct
3 Correct 9 ms 344 KB Output is correct
4 Correct 9 ms 560 KB Output is correct
5 Correct 10 ms 348 KB Output is correct
6 Correct 10 ms 348 KB Output is correct
7 Correct 9 ms 348 KB Output is correct
8 Execution timed out 2062 ms 6700 KB Time limit exceeded
9 Halted 0 ms 0 KB -