oj.uz

답안 #1069325

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1069325 2024-08-21T19:31:14 Z beaconmc 메기 농장 (IOI22_fish) C++17
9 / 100
 1000 ms 140452 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<vector<ll>, ll> weights;

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

unordered_set<ll> temppos[maxn];
vector<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::vector<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::vector<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::vector<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 153 ms 102660 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 80964 KB Output is correct
2 Incorrect 338 ms 122476 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 67 ms 80976 KB Output is correct
2 Correct 64 ms 80980 KB Output is correct
3 Correct 200 ms 97364 KB Output is correct
4 Correct 183 ms 92180 KB Output is correct
5 Correct 273 ms 111696 KB Output is correct
6 Correct 263 ms 111444 KB Output is correct
7 Correct 292 ms 111444 KB Output is correct
8 Correct 264 ms 111580 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 44 ms 80976 KB Output is correct
2 Correct 48 ms 80976 KB Output is correct
3 Correct 45 ms 80976 KB Output is correct
4 Correct 48 ms 80988 KB Output is correct
5 Correct 42 ms 80832 KB Output is correct
6 Correct 41 ms 80988 KB Output is correct
7 Correct 58 ms 80976 KB Output is correct
8 Correct 53 ms 80980 KB Output is correct
9 Correct 42 ms 80980 KB Output is correct
10 Incorrect 56 ms 81500 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 44 ms 80976 KB Output is correct
2 Correct 48 ms 80976 KB Output is correct
3 Correct 45 ms 80976 KB Output is correct
4 Correct 48 ms 80988 KB Output is correct
5 Correct 42 ms 80832 KB Output is correct
6 Correct 41 ms 80988 KB Output is correct
7 Correct 58 ms 80976 KB Output is correct
8 Correct 53 ms 80980 KB Output is correct
9 Correct 42 ms 80980 KB Output is correct
10 Incorrect 56 ms 81500 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 44 ms 80976 KB Output is correct
2 Correct 48 ms 80976 KB Output is correct
3 Correct 45 ms 80976 KB Output is correct
4 Correct 48 ms 80988 KB Output is correct
5 Correct 42 ms 80832 KB Output is correct
6 Correct 41 ms 80988 KB Output is correct
7 Correct 58 ms 80976 KB Output is correct
8 Correct 53 ms 80980 KB Output is correct
9 Correct 42 ms 80980 KB Output is correct
10 Incorrect 56 ms 81500 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 67 ms 80976 KB Output is correct
2 Correct 64 ms 80980 KB Output is correct
3 Correct 200 ms 97364 KB Output is correct
4 Correct 183 ms 92180 KB Output is correct
5 Correct 273 ms 111696 KB Output is correct
6 Correct 263 ms 111444 KB Output is correct
7 Correct 292 ms 111444 KB Output is correct
8 Correct 264 ms 111580 KB Output is correct
9 Correct 480 ms 119376 KB Output is correct
10 Correct 298 ms 106836 KB Output is correct
11 Correct 684 ms 132760 KB Output is correct
12 Correct 40 ms 80984 KB Output is correct
13 Correct 42 ms 80976 KB Output is correct
14 Correct 43 ms 80980 KB Output is correct
15 Correct 53 ms 80976 KB Output is correct
16 Correct 45 ms 80980 KB Output is correct
17 Correct 39 ms 80980 KB Output is correct
18 Correct 57 ms 80984 KB Output is correct
19 Correct 58 ms 81232 KB Output is correct
20 Correct 59 ms 80984 KB Output is correct
21 Correct 58 ms 81232 KB Output is correct
22 Correct 570 ms 116560 KB Output is correct
23 Execution timed out 1052 ms 140452 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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