Accepted
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 15:53:23
- Judged At
- 2025-02-23 15:53:23
- Judged By
- Score
- 100
- Total Time
- 48ms
- Peak Memory
- 2.668 MiB