oj.uz

Submission #416557

# Submission time Handle Problem Language Result Execution time Memory
416557 2021-06-02T15:30:56 Z LouayFarah Holiday (IOI14_holiday) C++14
0 / 100
 5000 ms 6820 KB 
#include "bits/stdc++.h"
#include "holiday.h"
using namespace std;
 
#define ll long long int

ll solve(ll i, int day, int n, int attraction[])
{
    if(day<=0)
        return 0;
    if(i==n)
        return 0;
    return max(solve(i+1, day-1, n, attraction), solve(i+1, day-2, n, attraction) + attraction[i]);
}

long long int findMaxAttraction(int n, int start, int d, int attraction[])
{
    return solve(0, d, n, attraction);
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 588 KB Output is correct
2 Correct 6 ms 588 KB Output is correct
3 Correct 5 ms 588 KB Output is correct
4 Correct 5 ms 588 KB Output is correct
5 Incorrect 1 ms 588 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
0 / 23.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5051 ms 6820 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5034 ms 844 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Execution timed out 5060 ms 6816 KB Time limit exceeded
2 Halted 0 ms 0 KB -