oj.uz

답안 #1075693

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1075693 2024-08-26T08:38:50 Z Sir_Ahmed_Imran 메기 농장 (IOI22_fish) C++17
35 / 100
 60 ms 11644 KB 
                            ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define append push_back
#define add insert
#define nl '\n'
#define ff first
#define ss second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(x) (x).begin(),(x).end()
#define L0TA ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define terminator main
int n,m;
vector<int> x,y,w;
ll dps(){
    ll hs[n+1][n+1];
    ll dp[n+1][n+1];
    ll dp2[n+1][n+1];
    for(int i=0;i<=n;i++)
        for(int j=0;j<=n;j++)
            hs[i][j]=dp[i][j]=dp2[i][j]=0;
    for(int i=1;i<=n;i++)
        dp[0][i]=dp2[0][i]=-1e17;
    for(int i=0;i<m;i++)
        hs[x[i]+1][y[i]+1]+=w[i];
    for(int i=1;i<=n;i++)
        for(int j=0;j<n;j++)
            hs[i][j+1]+=hs[i][j];
    for(int i=1;i<=n;i++){
        for(int j=0;j<=n;j++){
            for(int k=0;k<=n;k++){
                if(j<k){
                    dp[i][j]=max(dp[i][j],dp[i-1][k]+hs[i][k]-hs[i][j]);
                    dp2[i][k]=max(dp2[i][k],dp[i-1][k]+hs[i][k]-hs[i][j]);
                }
                else{
                    dp[i][j]=max(dp[i][j],dp2[i-1][k]+hs[i-1][j]-hs[i-1][k]);
                    dp2[i][j]=max(dp2[i][j],dp2[i-1][k]+hs[i-1][j]-hs[i-1][k]);
                }
            }
            dp2[i][j]=max(dp2[i][j],dp[i-1][j]+hs[i][j]);
        }
    }
    ll ans=0;
    for(int i=0;i<=n;i++)
        ans=max(ans,max(dp[n][i],dp2[n][i]));
    return ans;
}
ll xs(){
    ll hs[3][n+1];
    for(int i=0;i<m;i++)
        hs[x[i]+1][y[i]+1]+=w[i];
    for(int i=1;i<3;i++)
        for(int j=0;j<n;j++)
            hs[i][j+1]+=hs[i][j];
    ll ans=0;
    for(int i=0;i<=n;i++)
        ans=max(ans,hs[1][i]+hs[2][n]-hs[2][i]);
    return ans;
}
ll ys(){
    ll hs[n+1][2];
    ll dp[n+1][2];
    ll dp2[n+1][2];
    for(int i=0;i<=n;i++)
        for(int j=0;j<2;j++)
            hs[i][j]=dp[i][j]=dp2[i][j]=0;
    for(int i=1;i<=n;i++)
        dp[0][i]=dp2[0][i]=-1e17;
    for(int i=0;i<m;i++)
        hs[x[i]+1][y[i]+1]+=w[i];
    for(int i=1;i<=n;i++)
        for(int j=0;j<n;j++)
            hs[i][j+1]+=hs[i][j];
    for(int i=1;i<2;i++)
        dp[0][i]=dp2[0][i]=-1e17;
    for(int i=1;i<=n;i++){
        for(int j=0;j<2;j++){
            for(int k=0;k<2;k++){
                if(j<k){
                    dp[i][j]=max(dp[i][j],dp[i-1][k]+hs[i][k]-hs[i][j]);
                    dp2[i][k]=max(dp2[i][k],dp[i-1][k]+hs[i][k]-hs[i][j]);
                }
                else{
                    dp[i][j]=max(dp[i][j],dp2[i-1][k]+hs[i-1][j]-hs[i-1][k]);
                    dp2[i][j]=max(dp2[i][j],dp2[i-1][k]+hs[i-1][j]-hs[i-1][k]);
                }
            }
            dp2[i][j]=max(dp2[i][j],dp[i-1][j]+hs[i][j]);
        }
    }
    ll ans=0;
    for(int i=0;i<2;i++)
        ans=max(ans,max(dp[n][i],dp2[n][i]));
    return ans;
}
ll max_weights(int N,int M,vector<int> X,vector<int> Y,vector<int> W){
    n=N;
    m=M;
    x=X;
    y=Y;
    w=W;
    if(n<301) return dps();
    int mx,my;
    ll o=0;
    for(int i=mx=my=0;i<m;i++){
        mx=max(mx,x[i]);
        my=max(my,y[i]);
        o+=w[i];
    }
    if(mx<2) return xs();
    if(my<1) return ys();
    return o;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 5184 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '3900131656853281465'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 32 ms 10912 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '7282061700483963614'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2652 KB 1st lines differ - on the 1st token, expected: '10082010', found: '2971153271848657516'
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 444 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 8 ms 1000 KB Output is correct
10 Correct 49 ms 2652 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 40 ms 2600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 40 ms 2588 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 444 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 8 ms 1000 KB Output is correct
10 Correct 49 ms 2652 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 40 ms 2600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 40 ms 2588 KB Output is correct
15 Correct 39 ms 2548 KB Output is correct
16 Correct 2 ms 676 KB Output is correct
17 Correct 45 ms 4936 KB Output is correct
18 Correct 51 ms 4860 KB Output is correct
19 Correct 58 ms 4700 KB Output is correct
20 Correct 47 ms 4884 KB Output is correct
21 Correct 59 ms 4876 KB Output is correct
22 Correct 60 ms 7108 KB Output is correct
23 Correct 41 ms 3004 KB Output is correct
24 Correct 45 ms 4096 KB Output is correct
25 Correct 40 ms 2600 KB Output is correct
26 Correct 43 ms 2908 KB Output is correct

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 444 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 8 ms 1000 KB Output is correct
10 Correct 49 ms 2652 KB Output is correct
11 Correct 6 ms 860 KB Output is correct
12 Correct 40 ms 2600 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 40 ms 2588 KB Output is correct
15 Correct 39 ms 2548 KB Output is correct
16 Correct 2 ms 676 KB Output is correct
17 Correct 45 ms 4936 KB Output is correct
18 Correct 51 ms 4860 KB Output is correct
19 Correct 58 ms 4700 KB Output is correct
20 Correct 47 ms 4884 KB Output is correct
21 Correct 59 ms 4876 KB Output is correct
22 Correct 60 ms 7108 KB Output is correct
23 Correct 41 ms 3004 KB Output is correct
24 Correct 45 ms 4096 KB Output is correct
25 Correct 40 ms 2600 KB Output is correct
26 Correct 43 ms 2908 KB Output is correct
27 Correct 1 ms 452 KB Output is correct
28 Incorrect 40 ms 11644 KB 1st lines differ - on the 1st token, expected: '72142312796929', found: '107871302004498'
29 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 2652 KB 1st lines differ - on the 1st token, expected: '10082010', found: '2971153271848657516'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 15 ms 5184 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '3900131656853281465'
2 Halted 0 ms 0 KB -