oj.uz

Submission #938184

# Submission time Handle Problem Language Result Execution time Memory
938184 2024-03-05T01:47:14 Z irmuun Catfish Farm (IOI22_fish) C++17
9 / 100
 75 ms 7268 KB 
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()

ll max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
    int even=0,X=0,Y=0;
    for(int i=0;i<m;i++){
        X=max(X,x[i]);
        Y=max(Y,y[i]);
        if(x[i]%2==0) even++;
    }
    if(even==m){
        ll ans=0;
        for(int i=0;i<m;i++){
            ans+=w[i];
        }
        return ans;
    }
    if(X<=1){
        ll ans=0,cur=0;
        for(int i=0;i<m;i++){
            if(x[i]==0){
                ans+=w[i];
            }
            else{
                cur+=w[i];
            }
        }
        if(n==2) return max(ans,cur);
        ll sum[n][2];
        memset(sum,0,sizeof sum);
        for(int i=0;i<m;i++){
            sum[y[i]][x[i]]+=w[i];
        }
        for(int i=1;i<n;i++){
            sum[i][0]+=sum[i-1][0];
            sum[i][1]+=sum[i-1][1];
        }
        ans=max(ans,cur);
        for(int i=0;i<n;i++){
            ans=max(ans,sum[i][0]+sum[n-1][1]-sum[i][1]);
        }
        return ans;
    }
    if(Y==0){
        ll sum[n];
        fill(sum,sum+n,0);
        for(int i=0;i<m;i++){
            sum[x[i]]+=w[i];
        }
        ll dp[n][2][2];//i, i,i-1
        dp[1][0][0]=0;
        dp[1][0][1]=sum[0];
        dp[1][1][0]=sum[1];
        dp[1][1][1]=0;
        for(ll i=2;i<n;i++){
            dp[i][1][1]=max(dp[i-1][1][0],dp[i-1][1][1]);
            dp[i][1][0]=max(dp[i-1][0][1],dp[i-1][0][0]+sum[i-1]);
            dp[i][0][1]=max(dp[i-1][1][0],dp[i-1][1][1])+sum[i];
            dp[i][0][0]=max(dp[i-1][0][1],dp[i-1][0][0]);
        }
        return max({dp[n-1][0][0],dp[n-1][0][1],dp[n-1][1][0],dp[n-1][1][1]});
    }
    return 0ll;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2140 KB Output is correct
2 Correct 21 ms 2772 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 75 ms 7252 KB Output is correct
6 Correct 63 ms 7268 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 36 ms 5420 KB Output is correct
3 Correct 45 ms 6632 KB Output is correct
4 Correct 18 ms 2172 KB Output is correct
5 Correct 22 ms 2652 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 18 ms 3676 KB Output is correct
13 Correct 23 ms 4188 KB Output is correct
14 Correct 19 ms 3672 KB Output is correct
15 Correct 21 ms 3932 KB Output is correct
16 Correct 19 ms 3704 KB Output is correct
17 Correct 25 ms 3928 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB 1st lines differ - on the 1st token, expected: '3', found: '0'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 2140 KB Output is correct
2 Correct 21 ms 2772 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 75 ms 7252 KB Output is correct
6 Correct 63 ms 7268 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 36 ms 5420 KB Output is correct
9 Correct 45 ms 6632 KB Output is correct
10 Correct 18 ms 2172 KB Output is correct
11 Correct 22 ms 2652 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 18 ms 3676 KB Output is correct
19 Correct 23 ms 4188 KB Output is correct
20 Correct 19 ms 3672 KB Output is correct
21 Correct 21 ms 3932 KB Output is correct
22 Correct 19 ms 3704 KB Output is correct
23 Correct 25 ms 3928 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 3 ms 4188 KB Output is correct
26 Incorrect 13 ms 5180 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21261930173730'
27 Halted 0 ms 0 KB -