oj.uz

Submission #831509

# Submission time Handle Problem Language Result Execution time Memory
831509 2023-08-20T09:59:43 Z MrDeboo Catfish Farm (IOI22_fish) C++17
3 / 100
 79 ms 236144 KB 
#include "fish.h"
#include "bits/stdc++.h"
#define int long long
using namespace std;
int dp[311][311][311];
int vct[311][311];
int vctt[311][311];
vector<int>v[311];
int N;
int slv(int a,int b,int c){
    if(a==N)return 0;
    if(dp[a][b][c]!=-1)return dp[a][b][c];
    // cerr<<a<<' '<<b<<endl;
    int mx=0;
    int tot=0;
    for(auto &i:v[a]){
        if(i<=b)tot-=vct[a][i];
        if(i>max(b,c))tot+=vct[a-1][i];
        tot+=vct[a+1][i];
        mx=max(mx,slv(a+1,i,b)+tot);
    }
    return dp[a][b][c]=mx;
}
long long max_weights(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> y, std::vector<int32_t> w) {
    N=n;
    if(n>300){
        int g=0;
        for(auto &i:w)g+=i;
        return g;
    }
    memset(dp,-1,sizeof dp);
    for(int i=0;i<=n;i++)v[i].push_back(0);
    for(int i=0;i<m;i++){
        vct[x[i]][y[i]+1]=w[i];
        if(x[i])v[x[i]-1].push_back(y[i]+1);
        v[x[i]].push_back(y[i]+1);
        v[x[i]+1].push_back(y[i]+1);
    }
    for(int i=0;i<=n;i++)sort(v[i].begin(),v[i].end());
    return slv(0,0,0);
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2672 KB Output is correct
2 Correct 22 ms 3160 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 67 ms 8000 KB Output is correct
6 Correct 68 ms 8008 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 235724 KB Output is correct
2 Incorrect 36 ms 4880 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '80901044391025'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Incorrect 13 ms 2056 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '26722970331638'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 235760 KB Output is correct
2 Correct 73 ms 235696 KB Output is correct
3 Correct 75 ms 235660 KB Output is correct
4 Correct 78 ms 235716 KB Output is correct
5 Correct 76 ms 235696 KB Output is correct
6 Correct 76 ms 235676 KB Output is correct
7 Correct 76 ms 235748 KB Output is correct
8 Correct 79 ms 235728 KB Output is correct
9 Incorrect 78 ms 236144 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '647253201945'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 235760 KB Output is correct
2 Correct 73 ms 235696 KB Output is correct
3 Correct 75 ms 235660 KB Output is correct
4 Correct 78 ms 235716 KB Output is correct
5 Correct 76 ms 235696 KB Output is correct
6 Correct 76 ms 235676 KB Output is correct
7 Correct 76 ms 235748 KB Output is correct
8 Correct 79 ms 235728 KB Output is correct
9 Incorrect 78 ms 236144 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '647253201945'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 235760 KB Output is correct
2 Correct 73 ms 235696 KB Output is correct
3 Correct 75 ms 235660 KB Output is correct
4 Correct 78 ms 235716 KB Output is correct
5 Correct 76 ms 235696 KB Output is correct
6 Correct 76 ms 235676 KB Output is correct
7 Correct 76 ms 235748 KB Output is correct
8 Correct 79 ms 235728 KB Output is correct
9 Incorrect 78 ms 236144 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '647253201945'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 320 KB Output is correct
2 Correct 1 ms 316 KB Output is correct
3 Incorrect 13 ms 2056 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '26722970331638'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 2672 KB Output is correct
2 Correct 22 ms 3160 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 67 ms 8000 KB Output is correct
6 Correct 68 ms 8008 KB Output is correct
7 Correct 78 ms 235724 KB Output is correct
8 Incorrect 36 ms 4880 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '80901044391025'
9 Halted 0 ms 0 KB -