Submission #1111503

#	Time	Username	Problem	Language	Result	Execution time	Memory
1111503		zhehan	Trains (BOI24_trains)	C++14	0 / 100	2036 ms	592 KiB

Main

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n,d,x,ways=1;
    cin>>n;
    pair<int,int> stops[n+1];
    for(int i=0;i<n;++i){
        cin>>d>>x;
        stops[i+1].first=d;
        stops[i+1].second=x;
    }
    for(int i=1;i<=n;++i){
        bool reachable=false;
        for(int j=1;j<i;++j){
            if(stops[j].first==0){
                continue;
            }
            if((i-j)%stops[j].first==0){
                reachable=true;
            }
        }
        if(i==1){
            reachable=true;
        }
        if(reachable){
            int moves=0;
            if(stops[i].first!=0){
                moves=min(stops[i].second,(n-i)/stops[i].first);
            }
            ways+=moves;
        }
    }
    cout<<ways<<'\n';
    return 0;
}

• Subtask 1: 0 / 8
• Subtask 2: 0 / 13
• Subtask 3: 0 / 16
• Subtask 4: 0 / 34
• Subtask 5: 0 / 29