oj.uz

답안 #1075664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075664 2024-08-26T08:26:52 Z Muhammad_Aneeq 메기 농장 (IOI22_fish) C++17
18 / 100
 87 ms 13900 KB 
#include <vector>
using namespace std;
long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W)
{
    bool subt1=1,subt2=1,subt3=1,subt4=(N<=300);
    for (int i=0;i<M;i++)
    {
        if (X[i]%2)
            subt1=0;
        if (X[i]>1)
            subt2=0;
        if (Y[i]!=0)
            subt3=0;
        if (Y[i]>8)
            subt4=0;
    }
    if (subt1)
    {
        long long sm=0;
        for (int i=0;i<M;i++)
            sm+=W[i];
        return sm;
    }
    if (subt2)
    {
        long long sm[N]={};
        long long val[N][2]={};
        for (int i=0;i<M;i++)
            val[Y[i]][X[i]]=W[i];
        sm[0]=val[0][1];
        for (int i=1;i<N;i++)
            sm[i]=sm[i-1]+val[i][1];
        long long ans=sm[N-1];
        long long x=0;
        for (int i=0;i<N;i++)
        {
            x+=val[i][0];
            if (N>2)
                ans=max(ans,x+sm[N-1]-sm[i]);
        }
        ans=max(ans,x);
        return ans;
    }
    if (subt3)
    {
        long long dp[N][2]={};
        int val[N]={};
        for (int i=0;i<M;i++)
            val[X[i]]=W[i];
        dp[0][0]=0,dp[0][1]=val[0];
        long long ans=0;
        long long mx=0;
        for (int i=1;i<N;i++)
        {
            if (i>1)
                dp[i][0]=mx+val[i];
            if (i<N-1)
                dp[i][1]=max(dp[i][0],dp[i-1][0]+val[i]);
            mx=max(mx,max(dp[i-1][0],dp[i-1][1]));
            ans=max(ans,max(dp[i][0],dp[i][1]));
        }
        return ans;
    }
    if (N<=3000)
    {
        vector<vector<vector<long long>>>dp(2,vector<vector<long long>>(N,vector<long long>(N,0)));
        long long val[N][N]={};
        for (int i=0;i<M;i++)
            val[X[i]][Y[i]]=W[i];
        long long pre[N][N]={};
        for (int i=0;i<N;i++)
        {
            pre[i][0]=val[i][0];
            for (int j=1;j<N;j++)
                pre[i][j]=pre[i][j-1]+val[i][j];
        }
        long long mx[N]={};
        long long ans=0;
        for (int i=0;i<N;i++)
            dp[1][0][i]=pre[0][i];
        for (int i=0;i<N;i++)
            dp[0][1][i]=pre[1][i];
        mx[0]=pre[0][N-1];
        for (int i=1;i<N;i++)
        {
            for (int j=0;j<N;j++)
            {
                if (i>1)
                {
                    dp[0][i][j]=mx[i-2]+pre[i][j];
                    dp[0][i][j]=max(dp[0][i][j],pre[i][j]+pre[i-1][N-1]-pre[i-1][j]);
                }
                if (i>2)
                    dp[0][i][j]=max(dp[0][i][j],mx[i-3]+pre[i][j]+pre[i-1][N-1]-pre[i-1][j]);
                if (i+1<N)
                {
                    dp[1][i][j]=max(dp[0][i][j],dp[0][i-1][N-1]+pre[i][j]);
                    if (j>0)
                        dp[1][i][j]=max(dp[1][i][j],dp[1][i-1][j-1]+val[i][j]);
                }
            }
            mx[i]=max(mx[i-1],max(dp[0][i][N-1],dp[1][i][N-1]));
        }
        for (int i=0;i<N;i++)
            for (int j=0;j<N;j++)
                ans=max(ans,max(dp[0][i][j],dp[1][i][j]));
        return ans;
    }
    return 0;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:5:34: warning: variable 'subt4' set but not used [-Wunused-but-set-variable]
    5 |     bool subt1=1,subt2=1,subt3=1,subt4=(N<=300);
      |                                  ^~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 3676 KB Output is correct
2 Correct 29 ms 4276 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 59 ms 13784 KB Output is correct
6 Correct 87 ms 13900 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 30 ms 8980 KB Output is correct
3 Correct 44 ms 10700 KB Output is correct
4 Correct 14 ms 3668 KB Output is correct
5 Correct 17 ms 4284 KB Output is correct
6 Correct 1 ms 424 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 344 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 16 ms 5864 KB Output is correct
13 Correct 18 ms 6644 KB Output is correct
14 Correct 18 ms 5724 KB Output is correct
15 Correct 22 ms 6228 KB Output is correct
16 Correct 17 ms 5616 KB Output is correct
17 Correct 32 ms 6200 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Correct 10 ms 4380 KB Output is correct
4 Correct 18 ms 3784 KB Output is correct
5 Correct 22 ms 6204 KB Output is correct
6 Correct 16 ms 5556 KB Output is correct
7 Correct 18 ms 6232 KB Output is correct
8 Correct 17 ms 6076 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Incorrect 3 ms 4016 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '798600481950'
11 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Incorrect 3 ms 4016 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '798600481950'
11 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 1116 KB Output is correct
10 Incorrect 3 ms 4016 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '798600481950'
11 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 2 ms 2140 KB Output is correct
3 Correct 10 ms 4380 KB Output is correct
4 Correct 18 ms 3784 KB Output is correct
5 Correct 22 ms 6204 KB Output is correct
6 Correct 16 ms 5556 KB Output is correct
7 Correct 18 ms 6232 KB Output is correct
8 Correct 17 ms 6076 KB Output is correct
9 Incorrect 16 ms 3932 KB 1st lines differ - on the 1st token, expected: '99999', found: '0'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 3676 KB Output is correct
2 Correct 29 ms 4276 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 59 ms 13784 KB Output is correct
6 Correct 87 ms 13900 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 30 ms 8980 KB Output is correct
9 Correct 44 ms 10700 KB Output is correct
10 Correct 14 ms 3668 KB Output is correct
11 Correct 17 ms 4284 KB Output is correct
12 Correct 1 ms 424 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 344 KB Output is correct
16 Correct 0 ms 344 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 16 ms 5864 KB Output is correct
19 Correct 18 ms 6644 KB Output is correct
20 Correct 18 ms 5724 KB Output is correct
21 Correct 22 ms 6228 KB Output is correct
22 Correct 17 ms 5616 KB Output is correct
23 Correct 32 ms 6200 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 2 ms 2140 KB Output is correct
26 Correct 10 ms 4380 KB Output is correct
27 Correct 18 ms 3784 KB Output is correct
28 Correct 22 ms 6204 KB Output is correct
29 Correct 16 ms 5556 KB Output is correct
30 Correct 18 ms 6232 KB Output is correct
31 Correct 17 ms 6076 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 1116 KB Output is correct
41 Incorrect 3 ms 4016 KB 1st lines differ - on the 1st token, expected: '799839985182', found: '798600481950'
42 Halted 0 ms 0 KB -