oj.uz

Submission #834098

# Submission time Handle Problem Language Result Execution time Memory
834098 2023-08-22T10:45:24 Z Trumling Catfish Farm (IOI22_fish) C++17
9 / 100
 24 ms 6568 KB 
#include "fish.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999

long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W) 
{
  vector<vector<ll>>dp(2,vector<ll>(N,0));
  vector<int>w(N,0);
  for(int i=0;i<M;i++)
    w[X[i]]=W[i];
  
  
  dp[1][0]=0;
  for(int i=1;i<N;i++)
  {

      dp[1][i]=dp[0][i-1]+w[i];
      dp[0][i]=max(dp[0][i-1],dp[1][i-1]);

      dp[0][i]=max(dp[0][i],((i>1)?max(dp[1][i-2],dp[0][i-2]):0)+w[i-1]);
  }
  ll ans=0;
  for(int i=0;i<N;i++)
    ans=max(ans,max(dp[0][i],dp[1][i]));

    return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:30:3: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   30 |   for(int i=0;i<N;i++)
      |   ^~~
fish.cpp:33:5: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   33 |     return ans;
      |     ^~~~~~

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# Verdict Execution time Memory 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
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 13 ms 3668 KB Output is correct
4 Correct 10 ms 4052 KB Output is correct
5 Correct 23 ms 6476 KB Output is correct
6 Correct 20 ms 5972 KB Output is correct
7 Correct 23 ms 6472 KB Output is correct
8 Correct 24 ms 6568 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 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

# Verdict Execution time Memory Grader output
1 Incorrect 0 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

# Verdict Execution time Memory Grader output
1 Incorrect 0 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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 13 ms 3668 KB Output is correct
4 Correct 10 ms 4052 KB Output is correct
5 Correct 23 ms 6476 KB Output is correct
6 Correct 20 ms 5972 KB Output is correct
7 Correct 23 ms 6472 KB Output is correct
8 Correct 24 ms 6568 KB Output is correct
9 Incorrect 22 ms 6348 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

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