Time Exceeded
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