/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 3ms 532.0 KiB
#2 Accepted 3ms 532.0 KiB
#3 Accepted 4ms 532.0 KiB
#4 Accepted 4ms 532.0 KiB
#5 Accepted 4ms 320.0 KiB
#6 Accepted 4ms 532.0 KiB
#7 Accepted 4ms 532.0 KiB
#8 Accepted 4ms 532.0 KiB
#9 Accepted 4ms 764.0 KiB
#10 Accepted 4ms 532.0 KiB
#11 Accepted 5ms 532.0 KiB
#12 Accepted 6ms 340.0 KiB
#13 Accepted 5ms 532.0 KiB
#14 Accepted 5ms 532.0 KiB
#15 Accepted 33ms 2.02 MiB
#16 Accepted 22ms 2.043 MiB
#17 Accepted 21ms 2.066 MiB
#18 Time Exceeded ≥1097ms ≥1.359 MiB
#19 Accepted 24ms 2.066 MiB
#20 Accepted 46ms 2.062 MiB
#21 Accepted 25ms 2.066 MiB
#22 Time Exceeded ≥1100ms ≥1.449 MiB

Code

#include<bits/stdc++.h>

#define ll long long
#define endl "\n"
#define pb push_back
#define printv for(auto e:v) cout << e << " ";  cout << endl;
#define printmp for(auto [x,y]:mp) cout << x << " " << y << endl; cout << endl;

using namespace std;

void solve(){
    ll n;  cin >> n;
    vector<ll>lp(n);
    for(ll i=0;i<n;i++)   cin >> lp[i];
    for(ll i=0;i<n;i++){
        ll pos = 0, ct = 0, j = i, ans = i;
        while(j < n && pos < n){
            pos += lp[j];
            ans = j;
            ct++;
            if(j + lp[j] >= n)  break;
            j += lp[j];
        }
        cout << ans+1 <<  " " << ct << endl;
        //cout << endl;
    }
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    int t = 1;  //cin >> t;
    while(t--){
        solve();
    }
    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 07:21:10
Judged At
2025-02-26 07:21:10
Judged By
Score
92
Total Time
≥1100ms
Peak Memory
≥2.066 MiB