oj.uz

Submission #1091309

# Submission time Handle Problem Language Result Execution time Memory
1091309 2024-09-20T13:07:36 Z kasdo Bouquet (EGOI24_bouquet) C++14
8 / 100
 22 ms 12888 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
#define speed cin.tie (0) -> sync_with_stdio (0);ios_base::sync_with_stdio(false);cin.tie(0);
const int maxn = 200005;
int n;
int l[maxn], r[maxn];
int dp[maxn];
int rec(int i)
{
    if (i <= 0) return 0;
    if (dp[i] != -1) return dp[i];
    
    int ret = max(rec(i - 1), rec(i - l[i] - 1) + 1);
    return dp[i] = ret;
}
void s1()
{
    for(int i=1; i<=maxn-5; i++) dp[i] = -1;
    cout<<rec(n)<<endl;
}
void s2()
{
    cout<<(n - 1) / (l[1] + 1) + 1<<endl;
}
void solve()
{
    bool ok = 1;
    cin>>n;
    
    for(int i=1; i<=n; i++) cin>>l[i];
    for(int i=1; i<=n; i++)
    {
        cin>>r[i];
        ok &= (l[i] == r[i]); ok &= (l[i] == l[1]);
    }
    
    if (ok) s2();
    else s1();
}
signed main ()
{
    speed
    // freopen("feast.in", "r", stdin);
    // freopen("feast.out", "w", stdout);
    
    int _ = 1;
    // cin>>_;

    while(_--) solve();

    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 14 ms 3420 KB Output is correct
3 Correct 16 ms 3416 KB Output is correct
4 Correct 13 ms 3424 KB Output is correct
5 Correct 15 ms 3500 KB Output is correct
6 Correct 16 ms 3568 KB Output is correct
7 Correct 18 ms 3420 KB Output is correct
8 Correct 21 ms 3416 KB Output is correct
9 Correct 21 ms 3420 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
0.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3560 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 1884 KB Output is correct
4 Incorrect 22 ms 12888 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0.0 / 28.0

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

Subtask #4
0.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 3420 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 22 ms 12872 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 14 ms 3420 KB Output is correct
3 Correct 16 ms 3416 KB Output is correct
4 Correct 13 ms 3424 KB Output is correct
5 Correct 15 ms 3500 KB Output is correct
6 Correct 16 ms 3568 KB Output is correct
7 Correct 18 ms 3420 KB Output is correct
8 Correct 21 ms 3416 KB Output is correct
9 Correct 21 ms 3420 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 13 ms 3560 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 1884 KB Output is correct
19 Incorrect 22 ms 12888 KB Output isn't correct
20 Halted 0 ms 0 KB -