/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 768.0 KiB
#2 Accepted 1ms 532.0 KiB
#3 Accepted 1ms 532.0 KiB
#4 Accepted 1ms 488.0 KiB
#5 Accepted 1ms 504.0 KiB
#6 Accepted 1ms 532.0 KiB
#7 Accepted 1ms 532.0 KiB
#8 Accepted 1ms 484.0 KiB
#9 Accepted 1ms 536.0 KiB
#10 Accepted 1ms 532.0 KiB
#11 Accepted 2ms 532.0 KiB
#12 Accepted 2ms 376.0 KiB
#13 Accepted 2ms 532.0 KiB
#14 Accepted 2ms 532.0 KiB
#15 Accepted 42ms 2.27 MiB
#16 Accepted 36ms 2.27 MiB
#17 Accepted 45ms 2.312 MiB
#18 Time Exceeded ≥1100ms ≥1.746 MiB
#19 Accepted 42ms 2.27 MiB
#20 Accepted 43ms 2.27 MiB
#21 Accepted 43ms 2.426 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];
    
    for(int i=1;i<=n;i++)
    {
        int j = i;
        int cn = 1;
        while(j+a[j] <= n)
        {
            ++cn;
            j += a[j];
        }
        last[i] = j;
        cnt[i] = cn;
    }

    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 15:56:36
Judged At
2025-02-23 15:56:36
Judged By
Score
95
Total Time
≥1100ms
Peak Memory
≥2.426 MiB