oj.uz

답안 #626740

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626740 2022-08-11T17:59:18 Z Icebear16 메기 농장 (IOI22_fish) C++17
0 / 100
 22 ms 3556 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1e18//change to const int INF=1e18 if causing problem
const ll MOD=998244353;
const ll alt=1e10;
const ll inf=1e9+7;//Precalc is not a bad idea
#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define mod(a) (a+inf)%inf
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(a) a.size()

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y, std::vector<int> W){
	int n=N;
	ll dp[n+1][2];
	for(int i=0;i<=n;i++){
		dp[i][0]=0,dp[i][1]=0;
	}
	for(int i=0;i<M;i++){
		dp[X[i]+1][0]=W[i];
		dp[X[i]+1][1]=W[i];
	}
	dp[2][0]=max(dp[1][0],dp[2][0]);
	dp[2][1]=max(dp[1][1],dp[2][1]);
	for(int i=3;i<=n;i++){
		dp[i][0]+=max(dp[i-2][0],max(dp[i-2][1],dp[i-3][0]));
		dp[i][1]+=dp[i-1][0];
	}
	return max(dp[n][0],max(dp[n-1][0],dp[n-1][1]));
}

Subtask #1
0 / 3.0

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

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 1 ms 1748 KB Output is correct
2 Correct 1 ms 1748 KB Output is correct
3 Incorrect 15 ms 2892 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21049836049923'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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

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

Subtask #8
0 / 16.0

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