Submission #94583

#	Time	Username	Problem	Language	Result	Execution time	Memory
94583		FutymyClone	Walking (NOI12_walking)	C++14	25 / 25	2 ms	504 KiB

walking

#include <bits/stdc++.h>

using namespace std;

const int N = 505;

int l, n, dp[N];
pair <int, int> a[N];

int main(){
    scanf("%d %d", &l, &n);
    for (int i = 1; i <= n; i++) scanf("%d %d", &a[i].first, &a[i].second);
    sort(a + 1, a + n + 1);

    for (int i = n; i >= 1; i--) {
        dp[i] = 1;
        for (int j = i + 1; j <= n; j++) {
            if (l * a[j].second + a[i].first * a[i].second * a[j].second > l * a[i].second + a[j].first * a[i].second * a[j].second) dp[i] = max(dp[i], dp[j] + 1);
        }
    }

    printf("%d", *max_element(dp + 1, dp + n + 1));
    return 0;
}

Compilation message (stderr)

walking.cpp: In function 'int main()':
walking.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &l, &n);
     ~~~~~^~~~~~~~~~~~~~~~~
walking.cpp:12:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= n; i++) scanf("%d %d", &a[i].first, &a[i].second);
                                  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

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