oj.uz

답안 #906665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
906665 2024-01-14T16:39:56 Z vjudge1 메기 농장 (IOI22_fish) C++17
35 / 100
 345 ms 6228 KB 
#include "fish.h"

#pragma GCC target ("avx2")
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")

#include<bits/stdc++.h>
#include<math.h>
using namespace std;

typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pl;
typedef vector<ll> vl;
#define FD(i, r, l) for(ll i = r; i > (l); --i)

#define K first
#define V second
#define G(x) ll x; cin >> x;
#define GD(x) ld x; cin >> x;
#define GS(s) string s; cin >> s;
#define EX(x) { cout << x << '\n'; exit(0); }
#define A(a) (a).begin(), (a).end()
#define F(i, l, r) for (ll i = l; i < (r); ++i)

#define NN 310

ll grid[NN][NN];
ll n;

ll dp1[NN][NN];
ll noreq(ll, ll); // no request fishies, so len == prev wall. 

ll dp2[NN][NN];
ll req(ll, ll); 

// previous column did NOT request any right fishies here
// so we simply have a free wall to attach to 
ll noreq(ll i, ll len) {
    // assert(len == 0 or len == n);
    if (i == n) return 0;
    auto &DP = dp1[i][len];
    if (!~DP) {
        DP = noreq(i+1, n); // no restrictions so build big wall.

        F(nlen, 0, n+1) DP = max(DP, req(i, nlen)); // basically can set up any wall here before taking right fishes

        ll lsum = 0;
        F(j, 0, len) {
            lsum += grid[i][j];
        }
        DP = max(DP, lsum + noreq(i+1, 0));
        {
            ll tsum = lsum;
            F(j, 0, len) {
                tsum -= grid[i][j];
                DP = max(DP, tsum + noreq(i+1, j+1));
            }
        }


        F(covering, len, n) {
            // not lsum naymore jsut cum sum
            lsum += grid[i][covering];
            DP = max(DP, lsum + req(i+1, covering + 1));
        }

    }   
    return DP;   
}


// previous column requested right fishes here;
// so len == min bound on wall (we cannot take anything below len)

ll req(ll i, ll len) {
    if (i == n) return len == 0 ? 0 : -9e18; // i should need 0 fishes here
    auto &DP = dp2[i][len];
    if (!~DP) {
        // note that we cannot request any left fishes here.
        DP = noreq(i+1, n);  // if we don't request ANY fish here, just go up to max 

        ll sm = 0;
        F(covering, len, n) {
            sm += grid[i][covering];
            DP = max(DP, sm + req(i+1, covering + 1));
        }
    }   
    return DP;
}

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    if (N > 300) return -1;
    
    memset(dp1, -1, sizeof dp1);
    memset(dp2, -1, sizeof dp2);
    
    n = N;
    memset(grid, 0, sizeof grid);
    F(i, 0, M) grid[X[i]][Y[i]] = W[i];
    
    return noreq(0, 0);          
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 2128 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '-1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Incorrect 36 ms 4144 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '-1'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '10082010', found: '-1'
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 42 ms 2652 KB Output is correct
10 Correct 324 ms 2652 KB Output is correct
11 Correct 44 ms 2764 KB Output is correct
12 Correct 326 ms 2824 KB Output is correct
13 Correct 6 ms 2652 KB Output is correct
14 Correct 332 ms 2812 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 42 ms 2652 KB Output is correct
10 Correct 324 ms 2652 KB Output is correct
11 Correct 44 ms 2764 KB Output is correct
12 Correct 326 ms 2824 KB Output is correct
13 Correct 6 ms 2652 KB Output is correct
14 Correct 332 ms 2812 KB Output is correct
15 Correct 326 ms 2780 KB Output is correct
16 Correct 7 ms 2652 KB Output is correct
17 Correct 337 ms 4692 KB Output is correct
18 Correct 334 ms 4604 KB Output is correct
19 Correct 344 ms 4604 KB Output is correct
20 Correct 334 ms 4420 KB Output is correct
21 Correct 341 ms 4696 KB Output is correct
22 Correct 345 ms 6228 KB Output is correct
23 Correct 330 ms 3156 KB Output is correct
24 Correct 340 ms 3932 KB Output is correct
25 Correct 327 ms 2820 KB Output is correct
26 Correct 334 ms 3108 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2652 KB Output is correct
2 Correct 1 ms 2652 KB Output is correct
3 Correct 1 ms 2652 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 2648 KB Output is correct
6 Correct 1 ms 2652 KB Output is correct
7 Correct 1 ms 2648 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 42 ms 2652 KB Output is correct
10 Correct 324 ms 2652 KB Output is correct
11 Correct 44 ms 2764 KB Output is correct
12 Correct 326 ms 2824 KB Output is correct
13 Correct 6 ms 2652 KB Output is correct
14 Correct 332 ms 2812 KB Output is correct
15 Correct 326 ms 2780 KB Output is correct
16 Correct 7 ms 2652 KB Output is correct
17 Correct 337 ms 4692 KB Output is correct
18 Correct 334 ms 4604 KB Output is correct
19 Correct 344 ms 4604 KB Output is correct
20 Correct 334 ms 4420 KB Output is correct
21 Correct 341 ms 4696 KB Output is correct
22 Correct 345 ms 6228 KB Output is correct
23 Correct 330 ms 3156 KB Output is correct
24 Correct 340 ms 3932 KB Output is correct
25 Correct 327 ms 2820 KB Output is correct
26 Correct 334 ms 3108 KB Output is correct
27 Incorrect 2 ms 348 KB 1st lines differ - on the 1st token, expected: '2999', found: '-1'
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '10082010', found: '-1'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 18 ms 2128 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '-1'
2 Halted 0 ms 0 KB -