oj.uz

답안 #1090206

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1090206 2024-09-18T01:35:34 Z steveonalex 메기 농장 (IOI22_fish) C++17
52 / 100
 1000 ms 2097152 KB 
#include <bits/stdc++.h>
#include "fish.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double cur = rngesus(0, MASK(60) - 1);
    cur /= MASK(60) - 1;
    return l + cur * (r - l);
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const ll INF = 1e18 + 69;

int n, m;
ll max_weights(int _n, int _m, vector<int> X, vector<int> Y, vector<int> W) {
    n = _n, m = _m;
    for(int i = 0; i<m; ++i){
        X[i]++; Y[i]++;
    }

    ll grid[n + 2][n + 2];
    memset(grid, 0, sizeof grid);
    for(int i = 0; i<m; ++i){
        grid[X[i]][Y[i]] = W[i];
    }

    for(int i = 1; i<=n; ++i){
        for(int j = 1; j<=n; ++j) grid[i][j] += grid[i][j-1];
    }

    ll dp[n+2][n+2][2];
    // dp[n][m][ascending];
    for(int i = 0; i<=n+1; ++i) for(int j = 0; j<=n+1; ++j) for(int x = 0; x <= 1; ++x)
        dp[i][j][x] = -INF;
    dp[0][0][1] = 0;
    for(int i = 1; i<=n; ++i){
        maximize(dp[i][0][1], dp[i-1][0][0]);
        // increase
        block_of_code{
            ll pref[n + 2]; fill(pref, pref + n + 2, -INF);
            for(int j = 0; j <= n; ++j) pref[j] = dp[i-1][j][1] - grid[i-1][j];

            for(int j = 0; j <= n; ++j){
                if (j > 0) maximize(pref[j], pref[j-1]);
                maximize(dp[i][j][1], pref[j] + grid[i-1][j]);
            }
        }

        // decrease
        block_of_code{
            ll suff[n+2]; fill(suff, suff + n + 2, -INF);
            for(int j = 0; j <= n; ++j) suff[j] = max(dp[i-1][j][0], dp[i-1][j][1]) + grid[i][j];

            for(int j = n; j >= 0; --j){
                if (j < n) maximize(suff[j], suff[j+1]);
                maximize(dp[i][j][0], suff[j] - grid[i][j]);
            }
        }


        // jump two
        if (i >= 2){
            ll pref[n+2], suff[n+2];
            fill(pref, pref + n + 2, -INF);
            fill(suff, suff + n + 2, -INF);
            for(int j = 0; j<=n; ++j) {
                pref[j] = max(dp[i-2][j][0], dp[i-2][j][1]);
                suff[j] = pref[j] + grid[i-1][j];
            }
            for(int j = 1; j<=n; ++j) maximize(pref[j], pref[j-1]);
            for(int j = n-1; j>=0; --j) maximize(suff[j], suff[j+1]);

            for(int j = 0; j<=n; ++j){
                maximize(dp[i][j][1], max(pref[j] + grid[i-1][j], suff[j]));
            }
        }
    }


    ll ans = 0;
    for(int j = 0; j <= n; ++j) for(int x = 0; x <= 1; ++x) maximize(ans, dp[n][j][x]);
    return ans;
}


// int main(void){
//     ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
//     clock_t start = clock();

//     int n, m; cin >> n >> m;
//     vector<int> X(m), Y(m), W(m);
//     for(int i = 0; i<m; ++i){
//         cin >> X[i] >> Y[i] >> W[i];
//     }

//     cout << max_weights(n, m, X, Y, W) << "\n";


//     cerr << "Time elapsed: " << clock() - start << " ms\n";
//     return 0;
// }

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 1035 ms 2097152 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 946 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 2 ms 2608 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 2 ms 2608 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 10 ms 3420 KB Output is correct
18 Correct 10 ms 3532 KB Output is correct
19 Correct 10 ms 3420 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 9 ms 3536 KB Output is correct
22 Correct 17 ms 4696 KB Output is correct
23 Correct 4 ms 2648 KB Output is correct
24 Correct 7 ms 3164 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 4 ms 2904 KB Output is correct

Subtask #6
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 360 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 2396 KB Output is correct
11 Correct 1 ms 860 KB Output is correct
12 Correct 2 ms 2608 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 2 ms 2396 KB Output is correct
15 Correct 2 ms 2396 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 10 ms 3420 KB Output is correct
18 Correct 10 ms 3532 KB Output is correct
19 Correct 10 ms 3420 KB Output is correct
20 Correct 10 ms 3420 KB Output is correct
21 Correct 9 ms 3536 KB Output is correct
22 Correct 17 ms 4696 KB Output is correct
23 Correct 4 ms 2648 KB Output is correct
24 Correct 7 ms 3164 KB Output is correct
25 Correct 3 ms 2396 KB Output is correct
26 Correct 4 ms 2904 KB Output is correct
27 Correct 183 ms 211956 KB Output is correct
28 Correct 49 ms 22356 KB Output is correct
29 Correct 237 ms 224596 KB Output is correct
30 Correct 236 ms 224716 KB Output is correct
31 Correct 243 ms 224596 KB Output is correct
32 Correct 58 ms 19436 KB Output is correct
33 Correct 249 ms 224596 KB Output is correct
34 Correct 267 ms 224736 KB Output is correct
35 Correct 209 ms 216772 KB Output is correct
36 Correct 252 ms 224596 KB Output is correct

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 946 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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