oj.uz

답안 #795479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
795479 2023-07-27T10:16:22 Z ln_e 메기 농장 (IOI22_fish) C++17
32 / 100
 180 ms 100480 KB 
     #include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
    #include "fish.h"
    using ll=long long;
    using ld=long double;
    int const INF=1000000005;
    ll const LINF=1000000000000000005;
    ll const mod=1000000007;
    ld const PI=3.14159265359;
    ll const MAX_N=3e5+5;
    ld const EPS=0.00000001;
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast")
    #define f first
    #define s second
    #define pb push_back
    #define mp make_pair
    #define endl '\n'
    #define sz(a) (int)a.size()
    #define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    using namespace std;
    long long a[100005][10],dp[100005][10][10],sum[100005][10];
    bool check1(vector<int>x){
        for(ll i=0;i<x.size();i++)
        {
            if(x[i]%2==1){
                return 0;
            }
    }
    return 1;
}
bool check2(vector<int>x){
    for(ll i=0;i<x.size();i++)
    {
        if(x[i]>1){
            return 0;
        }
}
return 1;
}
bool check3(vector<int>y){
for(ll i=0;i<y.size();i++){
    if(y[i]!=0){
        return 0;
    }
}
return 1;
}
    long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
    if(check1(X)){
        ll ans=0;
        for(ll i=0;i<M;i++)
        {
            ans+=W[i];
        }
        return ans;
    }else if(check2(X)){
        ll sum1=0,sum2=0,ans=0;
        for(ll i=0;i<M;i++)
        {
            if(X[i]==0){
                sum1+=W[i];
            }else sum2+=W[i];
        }
        ans=max(sum1,sum2);
        if(N>2){
            int x[3][100005];
            for(int i=0;i<=1;i++)
            {
                for(ll j=0;j<N;j++)
                {
                    x[i][j]=0;
                }
            }
            for(int i=0;i<M;i++)
            {
                x[X[i]][Y[i]]=W[i];
            }
            ll sum2[100005];
            memset(sum2,0,sizeof(sum2));
            for(ll i=0;i<N;i++)
            {
                if(i-1>=0){
                    sum2[i]=sum2[i-1];
                }
                sum2[i]+=x[0][i];
            }
            ll idk=0;
            for(ll i=N-1;i>=1;i--)
            {
                idk+=x[1][i];
                ans=max(ans,idk+sum2[i-1]);
            }
        }
        return ans;
    }else if(check3(Y)){
       for(ll i=0;i<M;i++)
       {
        a[X[i]+1][Y[i]+1]=W[i];
    }
    for(ll j=0;j<=8;j++)
    {
        for(ll k=0;k<=8;k++)
        {
            dp[0][j][k]=-LINF;
        }
    }
    dp[0][0][0]=0;
    for(ll i=1;i<=N;i++)
    {
        for(ll j=1;j<=8;j++)
        {
            sum[i][j]=sum[i][j-1];
            sum[i][j]+=a[i][j];
        }
    }
    ll ans=0;
    for(ll i=1;i<=N;i++)
    {
        for(ll j=0;j<=8;j++) //j-ul meu
        {
            for(ll k=0;k<=8;k++) //j-ul precedent
            {
                for(ll mx=0;mx<=8;mx++){ //mx acoperit precedent
                    ll val=dp[i-1][k][mx];

                    if(k>j){
                        val+=sum[i][k];
                            val-=sum[i][j];
                    }
                    if(j>mx){
                        val+=sum[i-1][j];
                            val-=sum[i-1][mx];
                    }
                    dp[i][j][max(k,j)]=max(dp[i][j][max(k,j)],val);
                    ans=max(ans,dp[i][j][max(k,j)]);
                }
            }
        }
    }
    return ans;
}
}

Compilation message

fish.cpp: In function 'bool check1(std::vector<int>)':
fish.cpp:23:21: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |         for(ll i=0;i<x.size();i++)
      |                    ~^~~~~~~~~
fish.cpp: In function 'bool check2(std::vector<int>)':
fish.cpp:32:17: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |     for(ll i=0;i<x.size();i++)
      |                ~^~~~~~~~~
fish.cpp: In function 'bool check3(std::vector<int>)':
fish.cpp:41:13: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 | for(ll i=0;i<y.size();i++){
      |            ~^~~~~~~~~
fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:142:1: warning: control reaches end of non-void function [-Wreturn-type]
  142 | }
      | ^

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4436 KB Output is correct
2 Correct 23 ms 4952 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 68 ms 10348 KB Output is correct
6 Correct 69 ms 10352 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 38 ms 6712 KB Output is correct
3 Correct 47 ms 7644 KB Output is correct
4 Correct 19 ms 4464 KB Output is correct
5 Correct 23 ms 4948 KB Output is correct
6 Correct 1 ms 2260 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2260 KB Output is correct
10 Correct 1 ms 2132 KB Output is correct
11 Correct 1 ms 2260 KB Output is correct
12 Correct 19 ms 4476 KB Output is correct
13 Correct 23 ms 4952 KB Output is correct
14 Correct 19 ms 4464 KB Output is correct
15 Correct 21 ms 4720 KB Output is correct
16 Correct 20 ms 4500 KB Output is correct
17 Correct 21 ms 4724 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 140 ms 88244 KB Output is correct
3 Correct 140 ms 86640 KB Output is correct
4 Correct 180 ms 94668 KB Output is correct
5 Correct 168 ms 100480 KB Output is correct
6 Correct 167 ms 99888 KB Output is correct
7 Correct 166 ms 100468 KB Output is correct
8 Correct 180 ms 100404 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 1 ms 2132 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 1 ms 2400 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2260 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 1 ms 2132 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 1 ms 2400 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2260 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Incorrect 2 ms 2516 KB 1st lines differ - on the 1st token, expected: '299', found: '218'
16 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 1 ms 2260 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 2 ms 2260 KB Output is correct
7 Correct 1 ms 2132 KB Output is correct
8 Correct 1 ms 2260 KB Output is correct
9 Correct 1 ms 2388 KB Output is correct
10 Correct 2 ms 2516 KB Output is correct
11 Correct 1 ms 2400 KB Output is correct
12 Correct 2 ms 2516 KB Output is correct
13 Correct 2 ms 2260 KB Output is correct
14 Correct 2 ms 2516 KB Output is correct
15 Incorrect 2 ms 2516 KB 1st lines differ - on the 1st token, expected: '299', found: '218'
16 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2260 KB Output is correct
2 Correct 140 ms 88244 KB Output is correct
3 Correct 140 ms 86640 KB Output is correct
4 Correct 180 ms 94668 KB Output is correct
5 Correct 168 ms 100480 KB Output is correct
6 Correct 167 ms 99888 KB Output is correct
7 Correct 166 ms 100468 KB Output is correct
8 Correct 180 ms 100404 KB Output is correct
9 Runtime error 29 ms 11544 KB Execution killed with signal 11
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 4436 KB Output is correct
2 Correct 23 ms 4952 KB Output is correct
3 Correct 1 ms 2260 KB Output is correct
4 Correct 1 ms 2260 KB Output is correct
5 Correct 68 ms 10348 KB Output is correct
6 Correct 69 ms 10352 KB Output is correct
7 Correct 1 ms 2260 KB Output is correct
8 Correct 38 ms 6712 KB Output is correct
9 Correct 47 ms 7644 KB Output is correct
10 Correct 19 ms 4464 KB Output is correct
11 Correct 23 ms 4948 KB Output is correct
12 Correct 1 ms 2260 KB Output is correct
13 Correct 1 ms 2260 KB Output is correct
14 Correct 1 ms 2260 KB Output is correct
15 Correct 1 ms 2260 KB Output is correct
16 Correct 1 ms 2132 KB Output is correct
17 Correct 1 ms 2260 KB Output is correct
18 Correct 19 ms 4476 KB Output is correct
19 Correct 23 ms 4952 KB Output is correct
20 Correct 19 ms 4464 KB Output is correct
21 Correct 21 ms 4720 KB Output is correct
22 Correct 20 ms 4500 KB Output is correct
23 Correct 21 ms 4724 KB Output is correct
24 Correct 1 ms 2260 KB Output is correct
25 Correct 140 ms 88244 KB Output is correct
26 Correct 140 ms 86640 KB Output is correct
27 Correct 180 ms 94668 KB Output is correct
28 Correct 168 ms 100480 KB Output is correct
29 Correct 167 ms 99888 KB Output is correct
30 Correct 166 ms 100468 KB Output is correct
31 Correct 180 ms 100404 KB Output is correct
32 Correct 1 ms 2260 KB Output is correct
33 Correct 1 ms 2260 KB Output is correct
34 Correct 1 ms 2260 KB Output is correct
35 Correct 1 ms 2260 KB Output is correct
36 Correct 1 ms 2260 KB Output is correct
37 Correct 2 ms 2260 KB Output is correct
38 Correct 1 ms 2132 KB Output is correct
39 Correct 1 ms 2260 KB Output is correct
40 Correct 1 ms 2388 KB Output is correct
41 Correct 2 ms 2516 KB Output is correct
42 Correct 1 ms 2400 KB Output is correct
43 Correct 2 ms 2516 KB Output is correct
44 Correct 2 ms 2260 KB Output is correct
45 Correct 2 ms 2516 KB Output is correct
46 Incorrect 2 ms 2516 KB 1st lines differ - on the 1st token, expected: '299', found: '218'
47 Halted 0 ms 0 KB -