oj.uz

답안 #1069327

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069327 2024-08-21T19:34:07 Z beaconmc 메기 농장 (IOI22_fish) C++17
9 / 100
 1000 ms 145964 KB 
#include "fish.h"

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

typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)

const ll maxn = 100005;


unordered_set<ll> fish[maxn];

map<basic_string<ll>, ll> weights;

ll dp[8][8][maxn];

unordered_set<ll> temppos[maxn];
basic_string<ll> possibles[maxn];

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {
    FOR(i,0,8){
        FOR(j,0,8){
            FOR(k,0,maxn){
                dp[i][j][k] = 0;
            }
        }
    }
    FOR(i,0,maxn) temppos[i].insert(0);


    FOR(i,0,M){
        Y[i]++;
        fish[X[i]].insert(Y[i]);
        weights[{X[i], Y[i]}] = W[i];
        if (X[i] > 0) temppos[X[i]-1].insert(Y[i]);
        temppos[X[i]+1].insert(Y[i]);
        temppos[X[i]].insert(Y[i]);
    }
    FOR(i,0,maxn){
        for (auto&k : temppos[i]) possibles[i].push_back(k);
    }
    FOR(i,0,maxn) sort(possibles[i].begin(), possibles[i].end());

    FOR(k,0,N){
        FOR(X,0,8){
            FOR(Y,0,8){
                ll i=0,j=0;
 
                if (k>=2 && possibles[k-2].size() <= X) continue;
                else if (k>=2) i = possibles[k-2][X];
                if (k>=1 && possibles[k-1].size() <= Y) continue;
                else if (k>=1) j  = possibles[k-1][Y];
                


                ll temp = 0;
                FOR(Z, 0, 8){
                    if (possibles[k].size() <= Z) continue;
                    ll height = possibles[k][Z];

                    if (fish[k+1].count(height)) temp += weights[{k+1, height}];

                    if (fish[k].count(height) && j>=height) temp -= weights[{k, height}];

                    if (k>0 && fish[k-1].count(height) && i < height && j<height) temp += weights[{k-1, height}];

                    dp[Y][Z][k+1] = max(dp[Y][Z][k+1], dp[X][Y][k] + temp);
                }
            }
        }
    }




    ll ans = 0;
    FOR(i,0,8){
        FOR(j,0,8){
            FOR(k,0,N+1){
                ans = max(ans, dp[i][j][k]);
                //if (dp[i][j][k]==11) cout << i << " " << j << " " << k << endl;

            }
        }
    }
    return ans;





}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:52:51: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   52 |                 if (k>=2 && possibles[k-2].size() <= X) continue;
      |                             ~~~~~~~~~~~~~~~~~~~~~~^~~~
fish.cpp:54:51: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   54 |                 if (k>=1 && possibles[k-1].size() <= Y) continue;
      |                             ~~~~~~~~~~~~~~~~~~~~~~^~~~
fish.cpp:61:45: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   61 |                     if (possibles[k].size() <= Z) continue;
      |                         ~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 78676 KB Output is correct
2 Correct 52 ms 78672 KB Output is correct
3 Correct 155 ms 97108 KB Output is correct
4 Correct 128 ms 91324 KB Output is correct
5 Correct 266 ms 112208 KB Output is correct
6 Correct 298 ms 112208 KB Output is correct
7 Correct 277 ms 112208 KB Output is correct
8 Correct 307 ms 112216 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 78668 KB Output is correct
2 Correct 39 ms 78672 KB Output is correct
3 Correct 34 ms 78676 KB Output is correct
4 Correct 36 ms 78672 KB Output is correct
5 Correct 42 ms 78684 KB Output is correct
6 Correct 36 ms 78684 KB Output is correct
7 Correct 34 ms 78676 KB Output is correct
8 Correct 34 ms 78620 KB Output is correct
9 Correct 51 ms 78840 KB Output is correct
10 Incorrect 55 ms 79184 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '702028901154'
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 78668 KB Output is correct
2 Correct 39 ms 78672 KB Output is correct
3 Correct 34 ms 78676 KB Output is correct
4 Correct 36 ms 78672 KB Output is correct
5 Correct 42 ms 78684 KB Output is correct
6 Correct 36 ms 78684 KB Output is correct
7 Correct 34 ms 78676 KB Output is correct
8 Correct 34 ms 78620 KB Output is correct
9 Correct 51 ms 78840 KB Output is correct
10 Incorrect 55 ms 79184 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '702028901154'
11 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 78668 KB Output is correct
2 Correct 39 ms 78672 KB Output is correct
3 Correct 34 ms 78676 KB Output is correct
4 Correct 36 ms 78672 KB Output is correct
5 Correct 42 ms 78684 KB Output is correct
6 Correct 36 ms 78684 KB Output is correct
7 Correct 34 ms 78676 KB Output is correct
8 Correct 34 ms 78620 KB Output is correct
9 Correct 51 ms 78840 KB Output is correct
10 Incorrect 55 ms 79184 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '702028901154'
11 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 78676 KB Output is correct
2 Correct 52 ms 78672 KB Output is correct
3 Correct 155 ms 97108 KB Output is correct
4 Correct 128 ms 91324 KB Output is correct
5 Correct 266 ms 112208 KB Output is correct
6 Correct 298 ms 112208 KB Output is correct
7 Correct 277 ms 112208 KB Output is correct
8 Correct 307 ms 112216 KB Output is correct
9 Correct 427 ms 120144 KB Output is correct
10 Correct 316 ms 106068 KB Output is correct
11 Correct 619 ms 133460 KB Output is correct
12 Correct 43 ms 78676 KB Output is correct
13 Correct 34 ms 78680 KB Output is correct
14 Correct 49 ms 78676 KB Output is correct
15 Correct 47 ms 78544 KB Output is correct
16 Correct 36 ms 78464 KB Output is correct
17 Correct 41 ms 78676 KB Output is correct
18 Correct 50 ms 78468 KB Output is correct
19 Correct 54 ms 78676 KB Output is correct
20 Correct 75 ms 78676 KB Output is correct
21 Correct 54 ms 78680 KB Output is correct
22 Correct 494 ms 117076 KB Output is correct
23 Correct 987 ms 141136 KB Output is correct
24 Execution timed out 1016 ms 145964 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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