Submission #1229539

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229539		papaulo	걷기 (NOI12_walking)	C++20	25 / 25	1 ms	328 KiB

walking

#include <bits/stdc++.h>
using namespace std;

#define MAXN 550

pair<int, pair<int, int>> arr[MAXN];
int breadth[MAXN];

int main() {
    int l, n;
    cin >> l >> n;
    for(int i=0;i<n;i++) {
        int t, v;
        cin >> t >> v;
        arr[i]={t, {t+l/v, l%v}};
    }
    sort(arr, arr+n);
    int ans=0;
    for(int i=0;i<n;i++) {
        breadth[i]=1;
        for(int j=0;j<i;j++) {
            if(arr[i].second<arr[j].second) breadth[i]=max(breadth[i], breadth[j]+1);
        }
        ans=max(ans, breadth[i]);
    }
    cout << ans << endl;
    return 0;
}

• Subtask 1: 3 / 3
• Subtask 2: 3 / 3
• Subtask 3: 5 / 5
• Subtask 4: 7 / 7
• Subtask 5: 7 / 7