oj.uz

답안 #385533

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
385533 2021-04-04T14:32:23 Z The_Bitch Jelly Flavours (IOI20_jelly) C++14
0 / 100
 1823 ms 579812 KB 
//#define int long long
#include "jelly.h"
#include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
using namespace std;
const int N=1e6,M=1e4;
int mem[203][600][600];
long long minn=1e18,mux=-1e18;
int n,x,y;
int a[N],b[N];

int dp(int i,int x,int y){
    if(i==n)return 0;
    if(mem[i][x][y]!=-1)return mem[i][x][y];
    if(x>=a[i]&&y>=b[i])return mem[i][x][y]=max({dp(i+1,x-a[i],y)+1,dp(i+1,x,y-b[i])+1,dp(i+1,x,y)});
    else if(x>=a[i]&&y<b[i])return mem[i][x][y]=max(dp(i+1,x-a[i],y)+1,dp(i+1,x,y));
    else if(x<a[i]&&y>=b[i])return mem[i][x][y]=max(dp(i+1,x,y-b[i])+1,dp(i+1,x,y));
    else return mem[i][x][y]=dp(i+1,x,y);
}

int find_maximum_unique(int x, int y, std::vector<int> a, std::vector<int> b) {

	n = a.size();

    for(int i=0;i<n+2;i++)
        for(int j=0;j<x+2;j++)
            for(int k=0;k<y+2;k++)
                mem[i][j][k]=-1;

    return dp(0,x,y);
}

Subtask #1
0 / 11.0

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

Subtask #2
0 / 24.0

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

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 511 ms 579812 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1823 ms 579232 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1534 ms 579288 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

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