oj.uz

Submission #94583

# Submission time Handle Problem Language Result Execution time Memory
94583 2019-01-21T11:03:12 Z FutymyClone Walking (NOI12_walking) C++14
25 / 25
 2 ms 504 KB 
#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

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.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct

Subtask #2
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct

Subtask #4
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct

Subtask #5
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct