oj.uz

Submission #125747

# Submission time Handle Problem Language Result Execution time Memory
125747 2019-07-06T09:55:52 Z EntityIT Exhibition (JOI19_ho_t2) C++14
50 / 100
 49 ms 4344 KB 
/*
    check N = 1e5 / 1e3;
*/
#include<bits/stdc++.h>

using namespace std;

const int N = (int)1e3 + 5, M = N;
int n, m, c[M], f[M][N];

struct Picture {
    int s, v;
    Picture (int _s = 0, int _v = 0) : s(_s), v(_v) {}
    bool operator< (const Picture &_) const { return make_pair(v, s) < make_pair(_.v, _.s); }
} picture[N];

int main () {
    scanf("%d %d", &n, &m);
    for (int i = 1; i <= n; ++i) {
        int s, v; scanf("%d %d", &s, &v);
        picture[i] = Picture(s, v);
    }
    sort(picture + 1, picture + n + 1);
    for (int i = 1; i <= m; ++i) scanf("%d", c + i);
    sort(c + 1, c + m + 1);

    for (int i = 1; i <= m; ++i) {
        for (int j = 1; j <= n; ++j) {
            f[i][j] = max(f[i - 1][j], f[i][j - 1]);
            if (c[i] >= picture[j].s) f[i][j] = max(f[i][j], f[i - 1][j - 1] + 1);
        }
    }

    printf("%d", f[m][n]);

    return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d", &n, &m);
     ~~~~~^~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:20:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         int s, v; scanf("%d %d", &s, &v);
                   ~~~~~^~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:24:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for (int i = 1; i <= m; ++i) scanf("%d", c + i);
                                  ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.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
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 404 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct

Subtask #2
40.0 / 40.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
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 404 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 9 ms 4220 KB Output is correct
21 Correct 9 ms 4344 KB Output is correct
22 Correct 9 ms 4344 KB Output is correct
23 Correct 9 ms 4344 KB Output is correct
24 Correct 10 ms 4344 KB Output is correct
25 Correct 9 ms 4216 KB Output is correct
26 Correct 10 ms 4344 KB Output is correct
27 Correct 10 ms 4344 KB Output is correct
28 Correct 10 ms 4344 KB Output is correct
29 Correct 9 ms 4344 KB Output is correct
30 Correct 9 ms 4344 KB Output is correct
31 Correct 9 ms 4344 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 7 ms 4344 KB Output is correct
34 Correct 4 ms 1528 KB Output is correct
35 Correct 7 ms 4344 KB Output is correct
36 Correct 9 ms 4344 KB Output is correct
37 Correct 9 ms 4344 KB Output is correct

Subtask #3
0 / 50.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
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 404 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 504 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 9 ms 4220 KB Output is correct
21 Correct 9 ms 4344 KB Output is correct
22 Correct 9 ms 4344 KB Output is correct
23 Correct 9 ms 4344 KB Output is correct
24 Correct 10 ms 4344 KB Output is correct
25 Correct 9 ms 4216 KB Output is correct
26 Correct 10 ms 4344 KB Output is correct
27 Correct 10 ms 4344 KB Output is correct
28 Correct 10 ms 4344 KB Output is correct
29 Correct 9 ms 4344 KB Output is correct
30 Correct 9 ms 4344 KB Output is correct
31 Correct 9 ms 4344 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 7 ms 4344 KB Output is correct
34 Correct 4 ms 1528 KB Output is correct
35 Correct 7 ms 4344 KB Output is correct
36 Correct 9 ms 4344 KB Output is correct
37 Correct 9 ms 4344 KB Output is correct
38 Execution timed out 49 ms 3336 KB Time limit exceeded (wall clock)
39 Halted 0 ms 0 KB -