oj.uz

답안 #626600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626600 2022-08-11T14:55:00 Z whynotshadow 메기 농장 (IOI22_fish) C++17
3 / 100
 87 ms 7288 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll N=3e5+9;
const ll INF=1e9;
ll used[N];
ll dp[N][3];
long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W) {
  ll ans=0,cnt=0,cntt=0,cnt2=0,sum1=0,sum2=0;
  for(auto to:W){
    ans+=to;
  }
  for(auto to:X){
    if(to&1) cnt++;
    if(to<=1) cntt++;
  }
  for(auto to:Y){
    if(to==0) cnt2++;
  }
  if(cnt==0) return ans;
  else if(cnt2==M){
    for(ll i=0; i<N; i++){
        used[i]=0;
        dp[i][0]=dp[i][1]=0;
    }
    for(ll i=0;i<M;i++){
        used[X[i]]=W[i];
    }
    dp[-1][0]=dp[-1][1]=0;
    /// 0 - used, 1 - free
    for(ll i=0;i<N;i++){
        if(i==0){
            dp[i][0]=used[i+1],dp[i][1]=0;
            continue;
        }
        else{
            dp[i][0]=max({dp[i-1][0]-used[i],dp[i-2][0]+used[i-1],dp[i-2][1]})+used[i+1];
            dp[i][1]=max(dp[i-1][1],dp[i-1][0]);
        }
    }
    return max(dp[N-1][1],dp[N-1][0]);
  }
  else if(cntt==M){
    for(ll i=0; i<M; i++){
        if(X[i]==0) sum1+=W[i];
        else sum2+=W[i];
    }
    return max(sum1,sum2);
  }
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^
fish.cpp:30:20: warning: array subscript -1 is below array bounds of 'long long int [300009][3]' [-Warray-bounds]
   30 |     dp[-1][0]=dp[-1][1]=0;
      |               ~~~~~^
fish.cpp:8:4: note: while referencing 'dp'
    8 | ll dp[N][3];
      |    ^~
fish.cpp:30:10: warning: array subscript -1 is below array bounds of 'long long int [300009][3]' [-Warray-bounds]
   30 |     dp[-1][0]=dp[-1][1]=0;
      |     ~~~~~^
fish.cpp:8:4: note: while referencing 'dp'
    8 | ll dp[N][3];
      |    ^~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2132 KB Output is correct
2 Correct 35 ms 2644 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 87 ms 7244 KB Output is correct
6 Correct 85 ms 7288 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Incorrect 16 ms 4408 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '32717839057000'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 3412 KB Output is correct
3 Incorrect 16 ms 4408 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '32717839057000'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2132 KB Output is correct
2 Correct 35 ms 2644 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 87 ms 7244 KB Output is correct
6 Correct 85 ms 7288 KB Output is correct
7 Incorrect 0 ms 212 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -