/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 328.0 KiB
#2 Accepted 1ms 540.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 1ms 332.0 KiB
#5 Accepted 1ms 540.0 KiB
#6 Accepted 1ms 540.0 KiB
#7 Accepted 1ms 328.0 KiB
#8 Accepted 1ms 540.0 KiB
#9 Accepted 1ms 540.0 KiB
#10 Accepted 1ms 540.0 KiB
#11 Accepted 1ms 372.0 KiB
#12 Accepted 1ms 540.0 KiB
#13 Accepted 1ms 556.0 KiB
#14 Accepted 1ms 540.0 KiB
#15 Accepted 42ms 2.414 MiB
#16 Accepted 36ms 2.324 MiB
#17 Accepted 41ms 2.418 MiB
#18 Accepted 30ms 2.77 MiB
#19 Accepted 41ms 2.27 MiB
#20 Accepted 42ms 2.312 MiB
#21 Accepted 41ms 2.273 MiB
#22 Accepted 29ms 2.672 MiB
#23 Accepted 29ms 2.77 MiB

Code

/*
 *   Copyright (c) 2025 Emon Thakur
 *   All rights reserved.
 */
#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n; cin >> n;
    int a[n+1],cnt[n+1],last[n+1];
    for(int i=1;i<=n;i++) cin >> a[i];
    
    last[n] = n;
    cnt[n] = 1;
    for(int i=n-1;i>=1;i--)
    {
        if(i+a[i] > n) last[i]=i;
        else last[i] = last[i+a[i]];

        if(i+a[i] > n) cnt[i] = 1;
        else cnt[i] = cnt[i+a[i]]+1;
    }

    for(int i=1;i<=n;i++) cout<<last[i]<<' '<<cnt[i]<<'\n';
}

Information

Submit By
Type
Submission
Problem
P1171 Frogs and Lily Pads
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-23 16:54:32
Judged At
2025-02-23 16:54:32
Judged By
Score
100
Total Time
42ms
Peak Memory
2.77 MiB