oj.uz

Submission #682877

# Submission time Handle Problem Language Result Execution time Memory
682877 2023-01-17T06:56:39 Z irmuun Catfish Farm (IOI22_fish) C++17
9 / 100
 95 ms 7268 KB 
#include<bits/stdc++.h>
#include "fish.h"
using namespace std;
#define ll long long
long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
	int count=0,X=-1,Y=-1;
	for(int i=0;i<m;i++){
		if(x[i]%2==0){
			count++;
		}
		X=max(X,x[i]);
		Y=max(Y,y[i]);
	}
	if(count==m){//subtask1
		ll ans=0;
		for(int i=0;i<m;i++){
			ans+=w[i];
		}
		return ans;
	}
	if(X<=1){//subtask2
		ll res=0;
		int dp[n+5][2];
		for(int i=0;i<=n;i++){
			dp[i][0]=0;
			dp[i][1]=0;
		}
		ll ans;
		for(int i=0;i<m;i++){
			if(x[i]==1){
				res+=w[i];
			}
			dp[y[i]+1][x[i]]=w[i];
		}
		if(n==2){
			return max(dp[1][0]+dp[2][0],dp[1][1]+dp[2][1]);
		}
		ans=res;
		for(int i=1;i<=n;i++){
			res+=dp[i][0]-dp[i][1];
			ans=max(ans,res);
		}
		return ans;
	}
	if(Y==0){
		int arr[n+5];
		fill(arr,arr+n+3,0);
		for(int i=0;i<m;i++){
			arr[x[i]+1]=w[i];
		}
		ll dp[n+5][2][2];//current pos, current state,current-1 state
		dp[2][0][0]=0;
		dp[2][1][0]=arr[1];
		dp[2][0][1]=arr[2];
		dp[2][1][1]=0;
		for(int i=3;i<=n;i++){
			dp[i][1][1]=max(dp[i-1][1][0],dp[i-1][1][1]);
			dp[i][1][0]=max(dp[i-1][0][1],dp[i-1][0][0]+arr[i]);
			dp[i][0][1]=max(dp[i-1][1][0],dp[i-1][1][1])+arr[i];
			dp[i][0][0]=max(dp[i-1][0][1],dp[i-1][0][0]);
		}
		return max({dp[n][0][0],dp[n][0][1],dp[n][1][0],dp[n][1][1]});
	}
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:64:1: warning: control reaches end of non-void function [-Wreturn-type]
   64 | }
      | ^

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2132 KB Output is correct
2 Correct 26 ms 2640 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 86 ms 7264 KB Output is correct
6 Correct 95 ms 7268 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 44 ms 4772 KB Output is correct
3 Correct 56 ms 5728 KB Output is correct
4 Correct 22 ms 2148 KB Output is correct
5 Correct 31 ms 2632 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 22 ms 2936 KB Output is correct
13 Correct 27 ms 3400 KB Output is correct
14 Correct 22 ms 2900 KB Output is correct
15 Correct 28 ms 3168 KB Output is correct
16 Correct 22 ms 2800 KB Output is correct
17 Correct 26 ms 3152 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 3 ms 3812 KB Output is correct
3 Incorrect 19 ms 4656 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21261347173731'
4 Halted 0 ms 0 KB -

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 1 ms 212 KB Output is correct
2 Correct 3 ms 3812 KB Output is correct
3 Incorrect 19 ms 4656 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21261347173731'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 2132 KB Output is correct
2 Correct 26 ms 2640 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 86 ms 7264 KB Output is correct
6 Correct 95 ms 7268 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 44 ms 4772 KB Output is correct
9 Correct 56 ms 5728 KB Output is correct
10 Correct 22 ms 2148 KB Output is correct
11 Correct 31 ms 2632 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 22 ms 2936 KB Output is correct
19 Correct 27 ms 3400 KB Output is correct
20 Correct 22 ms 2900 KB Output is correct
21 Correct 28 ms 3168 KB Output is correct
22 Correct 22 ms 2800 KB Output is correct
23 Correct 26 ms 3152 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 3812 KB Output is correct
26 Incorrect 19 ms 4656 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21261347173731'
27 Halted 0 ms 0 KB -