oj.uz

답안 #1070751

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1070751 2024-08-22T17:51:00 Z beaconmc 메기 농장 (IOI22_fish) C++17
35 / 100
 1000 ms 369236 KB 
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#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 = 3005;


set<ll> heights[maxn];
vector<ll> realheights[maxn];

map<ll,ll> fish[maxn];
map<ll,ll> weights[maxn];

map<ll,ll> p[maxn];

vector<array<ll,2>>  dp[maxn];

map<ll,ll> pref[maxn][2];
map<ll,ll> pref2[maxn][2];
map<ll,ll> suff[maxn][2];


long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,
                      std::vector<int> W) {

    FOR(i,0,M){
        Y[i]++;
        fish[X[i]][Y[i]] = 1;
        weights[X[i]][Y[i]] = W[i];

        if (X[i] > 0) heights[X[i]-1].insert(Y[i]);
        if (X[i] > 1) heights[X[i]-2].insert(Y[i]);
        heights[X[i]].insert(Y[i]);
        heights[X[i]+1].insert(Y[i]);
        heights[X[i]+2].insert(Y[i]);
    }
    FOR(i,0,maxn) heights[i].insert(0);

    FOR(i,0,maxn) FOR(j,0,305) heights[i].insert(j);

    FOR(i,0,maxn){
        p[i][0] = 0;
        ll prev = 0;
        for (auto j : heights[i]){
            if (j==0) continue;
            p[i][j] = p[i][prev] + weights[i][j];
            prev = j;
        }
    }
    FOR(i,0,maxn){
        for (auto k : heights[i]) realheights[i].push_back(k);
    }
    FOR(i,0,maxn){
        dp[i].resize(heights[i].size());
    }

    FOR(i,1,N+1){
        FOR(X,0,dp[i].size()){
            ll j = realheights[i][X];
            FOR(k,0,2){


                if (i<2) continue;
                ll temp = 0;
                ll add = 0;
                if (k==0){
                    if (X==dp[i].size()-1) continue;
                    if (p[i-1].count(j) && suff[i-1][0].count(realheights[i][X+1])) temp = max(temp, suff[i-1][0][realheights[i][X+1]] - p[i-1][j]);
                    if (p[i-1].count(j) && suff[i-1][1].count(realheights[i][X+1])) temp = max(temp, suff[i-1][1][realheights[i][X+1]] - p[i-1][j]);

                    // FOR(p,j+1,N+1){
                    //     if (fish[i-1][p]) add += weights[i-1][p];
                    //     temp = max(temp, dp[i-1][p][0] + add);
                    //     temp = max(temp, dp[i-1][p][1] + add);
                    // }
                }else{
                    if (pref[i-1][0].count(j)) temp = max(temp, pref[i-1][0][j]);
                    if (p[i-2].count(j) && pref[i-1][1].count(j)) temp = max(temp, pref[i-1][1][j] + p[i-2][j]);

                    // FOR(p,0,j+1) if (fish[i-2][p]) add += weights[i-2][p];
                    // FOR(p,0,j+1){
                    //     if (fish[i-2][p]) add -= weights[i-2][p];
                    //     temp = max(temp, dp[i-1][p][0]);
                    //     temp = max(temp, dp[i-1][p][1] + add);
                    // }
                }


                dp[i][X][k] = temp;
            }
        }
        ll sz = realheights[i].size();

        FOR(k,0,2){
            ll tempadd = 0;
            ll tempadd2 = 0;


            FOR(j,0,sz){
                tempadd += weights[i][realheights[i][j]];
                suff[i][k][realheights[i][j]] = dp[i][j][k]+tempadd;
            }

            FOR(j,0,sz){
                tempadd2 -= weights[i-1][realheights[i][j]];
                pref[i][k][realheights[i][j]] = dp[i][j][k] + tempadd2;
                pref2[i][k][realheights[i][j]] = dp[i][j][k];
            }
            ll prev = 0;
            FOR(j,1,sz){
                pref[i][k][realheights[i][j]] = max(pref[i][k][realheights[i][j]], pref[i][k][prev]);
                pref2[i][k][realheights[i][j]] = max(pref2[i][k][realheights[i][j]], pref2[i][k][prev]);
                prev = realheights[i][j];
            }
            prev = realheights[i][sz-1];
            FORNEG(j,sz-2,-1){
                suff[i][k][realheights[i][j]] = max(suff[i][k][realheights[i][j]], suff[i][k][prev]);

                prev = realheights[i][j];
            }

        }
        // cout << i << endl;
        // cout << suff[2][2][0] << "FUCK" << endl;

    }


    // cout << dp[3][2][0] << endl;



    ll ans = 0;

    FOR(i,0,N+1){
        FOR(j,0,dp[i].size()){
            ans = max(dp[i][j][0], ans);
            ans = max(dp[i][j][1], ans);
        }
    }
    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:9:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
   65 |         FOR(X,0,dp[i].size()){
      |             ~~~~~~~~~~~~~~~~     
fish.cpp:65:9: note: in expansion of macro 'FOR'
   65 |         FOR(X,0,dp[i].size()){
      |         ^~~
fish.cpp:74:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   74 |                     if (X==dp[i].size()-1) continue;
      |                         ~^~~~~~~~~~~~~~~~
fish.cpp:72:20: warning: unused variable 'add' [-Wunused-variable]
   72 |                 ll add = 0;
      |                    ^~~
fish.cpp:9:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::array<long long int, 2> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
  143 |         FOR(j,0,dp[i].size()){
      |             ~~~~~~~~~~~~~~~~     
fish.cpp:143:9: note: in expansion of macro 'FOR'
  143 |         FOR(j,0,dp[i].size()){
      |         ^~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

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

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 186448 KB Output is correct
2 Correct 325 ms 186984 KB Output is correct
3 Correct 311 ms 186196 KB Output is correct
4 Correct 308 ms 186196 KB Output is correct
5 Correct 298 ms 186196 KB Output is correct
6 Correct 296 ms 186192 KB Output is correct
7 Correct 308 ms 186196 KB Output is correct
8 Correct 288 ms 186452 KB Output is correct
9 Correct 419 ms 203204 KB Output is correct
10 Correct 503 ms 220496 KB Output is correct
11 Correct 392 ms 203344 KB Output is correct
12 Correct 519 ms 220496 KB Output is correct
13 Correct 347 ms 194640 KB Output is correct
14 Correct 521 ms 220496 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 186448 KB Output is correct
2 Correct 325 ms 186984 KB Output is correct
3 Correct 311 ms 186196 KB Output is correct
4 Correct 308 ms 186196 KB Output is correct
5 Correct 298 ms 186196 KB Output is correct
6 Correct 296 ms 186192 KB Output is correct
7 Correct 308 ms 186196 KB Output is correct
8 Correct 288 ms 186452 KB Output is correct
9 Correct 419 ms 203204 KB Output is correct
10 Correct 503 ms 220496 KB Output is correct
11 Correct 392 ms 203344 KB Output is correct
12 Correct 519 ms 220496 KB Output is correct
13 Correct 347 ms 194640 KB Output is correct
14 Correct 521 ms 220496 KB Output is correct
15 Correct 504 ms 220508 KB Output is correct
16 Correct 344 ms 194644 KB Output is correct
17 Correct 581 ms 224220 KB Output is correct
18 Correct 550 ms 224332 KB Output is correct
19 Correct 572 ms 224340 KB Output is correct
20 Correct 582 ms 224336 KB Output is correct
21 Correct 574 ms 224336 KB Output is correct
22 Correct 641 ms 228208 KB Output is correct
23 Correct 520 ms 221052 KB Output is correct
24 Correct 615 ms 222908 KB Output is correct
25 Correct 522 ms 220604 KB Output is correct
26 Correct 547 ms 220996 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 297 ms 186448 KB Output is correct
2 Correct 325 ms 186984 KB Output is correct
3 Correct 311 ms 186196 KB Output is correct
4 Correct 308 ms 186196 KB Output is correct
5 Correct 298 ms 186196 KB Output is correct
6 Correct 296 ms 186192 KB Output is correct
7 Correct 308 ms 186196 KB Output is correct
8 Correct 288 ms 186452 KB Output is correct
9 Correct 419 ms 203204 KB Output is correct
10 Correct 503 ms 220496 KB Output is correct
11 Correct 392 ms 203344 KB Output is correct
12 Correct 519 ms 220496 KB Output is correct
13 Correct 347 ms 194640 KB Output is correct
14 Correct 521 ms 220496 KB Output is correct
15 Correct 504 ms 220508 KB Output is correct
16 Correct 344 ms 194644 KB Output is correct
17 Correct 581 ms 224220 KB Output is correct
18 Correct 550 ms 224332 KB Output is correct
19 Correct 572 ms 224340 KB Output is correct
20 Correct 582 ms 224336 KB Output is correct
21 Correct 574 ms 224336 KB Output is correct
22 Correct 641 ms 228208 KB Output is correct
23 Correct 520 ms 221052 KB Output is correct
24 Correct 615 ms 222908 KB Output is correct
25 Correct 522 ms 220604 KB Output is correct
26 Correct 547 ms 220996 KB Output is correct
27 Execution timed out 1089 ms 348404 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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