/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 532.0 KiB
#2 Accepted 2ms 576.0 KiB
#3 Accepted 1ms 540.0 KiB
#4 Accepted 2ms 540.0 KiB
#5 Accepted 2ms 540.0 KiB
#6 Accepted 2ms 544.0 KiB
#7 Accepted 1ms 584.0 KiB
#8 Accepted 2ms 500.0 KiB
#9 Accepted 2ms 428.0 KiB
#10 Accepted 2ms 492.0 KiB
#11 Accepted 2ms 492.0 KiB
#12 Accepted 2ms 396.0 KiB
#13 Accepted 2ms 488.0 KiB
#14 Accepted 2ms 328.0 KiB
#15 Accepted 34ms 2.387 MiB
#16 Accepted 30ms 2.457 MiB
#17 Accepted 33ms 2.316 MiB
#18 Accepted 32ms 2.75 MiB
#19 Accepted 32ms 2.324 MiB
#20 Accepted 35ms 2.305 MiB
#21 Accepted 34ms 2.438 MiB
#22 Accepted 30ms 2.816 MiB
#23 Accepted 31ms 2.836 MiB

Code

// Created on: 2025-02-26 12:16
// Author: Safwan_Ibrahim
    
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define endl '\n'

const int N = 1e5 + 8;
int A[N];

int J[N], Last[N];

int32_t main() {
    ios_base::sync_with_stdio(0);cin.tie(0);
    
    int n; cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> A[i];
    }
    
    for (int i = n; i >= 1; i--) {
        if (i + A[i] <= n) {
            J[i] = J[i + A[i]] + 1;
            Last[i] = Last[i + A[i]]; 
        }
        else {
            J[i] = 1;
            Last[i] = i;
        }
    }

    for (int i = 1; i <= n; i++) {
        cout << Last[i] << " " << J[i] << endl;
    }
    
    return 0;
} 

Information

Submit By
Type
Submission
Problem
P1171 Frogs and Lily Pads
Contest
Intra LU IEEE Beginner Programming Contest
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-26 06:25:23
Judged At
2025-02-26 06:25:23
Judged By
Score
100
Total Time
35ms
Peak Memory
2.836 MiB