oj.uz

Submission #682875

# Submission time Handle Problem Language Result Execution time Memory
682875 2023-01-17T06:54:29 Z irmuun Catfish Farm (IOI22_fish) C++17
9 / 100
 102 ms 7272 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[1][0][0]=0;
		dp[1][1][0]=0;
		dp[1][0][1]=0;
		dp[1][1][1]=0;
		for(int i=2;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 25 ms 2636 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 90 ms 7264 KB Output is correct
6 Correct 102 ms 7272 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 44 ms 4684 KB Output is correct
3 Correct 57 ms 5724 KB Output is correct
4 Correct 21 ms 2156 KB Output is correct
5 Correct 27 ms 2628 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 23 ms 2808 KB Output is correct
13 Correct 29 ms 3412 KB Output is correct
14 Correct 32 ms 2796 KB Output is correct
15 Correct 29 ms 3148 KB Output is correct
16 Correct 22 ms 2796 KB Output is correct
17 Correct 25 ms 3160 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Incorrect 18 ms 5524 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21261432585312'
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 0 ms 212 KB Output is correct
2 Correct 2 ms 3796 KB Output is correct
3 Incorrect 18 ms 5524 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21261432585312'
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 25 ms 2636 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 90 ms 7264 KB Output is correct
6 Correct 102 ms 7272 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 44 ms 4684 KB Output is correct
9 Correct 57 ms 5724 KB Output is correct
10 Correct 21 ms 2156 KB Output is correct
11 Correct 27 ms 2628 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 23 ms 2808 KB Output is correct
19 Correct 29 ms 3412 KB Output is correct
20 Correct 32 ms 2796 KB Output is correct
21 Correct 29 ms 3148 KB Output is correct
22 Correct 22 ms 2796 KB Output is correct
23 Correct 25 ms 3160 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 2 ms 3796 KB Output is correct
26 Incorrect 18 ms 5524 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21261432585312'
27 Halted 0 ms 0 KB -