oj.uz

Submission #831543

# Submission time Handle Problem Language Result Execution time Memory
831543 2023-08-20T10:18:37 Z MrDeboo Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 138432 KB 
#include "fish.h"
#include "bits/stdc++.h"
using namespace std;
map<pair<int,pair<int,int>>,long long>dp;
map<int,long long>vct[200000];
vector<int>v[200000];
int N;
int slv(int a,int b,int c){
    if(a==N)return 0;
    if(dp.count({a,{b,c}}))return dp[{a,{b,c}}];
    // cerr<<a<<' '<<b<<endl;
    long long mx=0;
    long long tot=0;
    for(auto &i:v[a]){
        if(i<=b&&vct[a].count(i))tot-=vct[a][i];
        if(i>max(b,c)&&vct[a-1].count(i))tot+=vct[a-1][i];
        if(vct[a+1].count(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;
    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());
    for(int i=0;i<=n;i++)v[i].resize(unique(v[i].begin(),v[i].end())-v[i].begin());
    return slv(0,0,0);
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 138432 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 14292 KB Output is correct
2 Execution timed out 1079 ms 133116 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 45688 KB Output is correct
2 Correct 38 ms 45648 KB Output is correct
3 Incorrect 125 ms 58216 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '0'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14292 KB Output is correct
2 Correct 6 ms 14372 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 6 ms 14336 KB Output is correct
5 Correct 8 ms 14348 KB Output is correct
6 Correct 8 ms 14292 KB Output is correct
7 Correct 7 ms 14388 KB Output is correct
8 Correct 6 ms 14292 KB Output is correct
9 Incorrect 9 ms 14688 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '625086836'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14292 KB Output is correct
2 Correct 6 ms 14372 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 6 ms 14336 KB Output is correct
5 Correct 8 ms 14348 KB Output is correct
6 Correct 8 ms 14292 KB Output is correct
7 Correct 7 ms 14388 KB Output is correct
8 Correct 6 ms 14292 KB Output is correct
9 Incorrect 9 ms 14688 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '625086836'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 14292 KB Output is correct
2 Correct 6 ms 14372 KB Output is correct
3 Correct 8 ms 14292 KB Output is correct
4 Correct 6 ms 14336 KB Output is correct
5 Correct 8 ms 14348 KB Output is correct
6 Correct 8 ms 14292 KB Output is correct
7 Correct 7 ms 14388 KB Output is correct
8 Correct 6 ms 14292 KB Output is correct
9 Incorrect 9 ms 14688 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '625086836'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 45688 KB Output is correct
2 Correct 38 ms 45648 KB Output is correct
3 Incorrect 125 ms 58216 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '0'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1082 ms 138432 KB Time limit exceeded
2 Halted 0 ms 0 KB -