oj.uz

Submission #103608

# Submission time Handle Problem Language Result Execution time Memory
103608 2019-04-01T06:44:16 Z Alliance Exhibition (JOI19_ho_t2) C++14
50 / 100
 393 ms 11476 KB 
// In the name of Allah. Ya ali!
#include<bits/stdc++.h>
#define double long double
typedef long long ll;
const ll MAX_N = 1000+10;
const ll MOD = 1e9+7;
using namespace std;

int dp[MAX_N][MAX_N];
pair<int,int> lr[MAX_N];
int a[MAX_N];
int n,m;

int main()
{
    cin >> n >> m;
    for(int i = 1;i<=n;++i)
        scanf("%d%d",&lr[i].second,&lr[i].first);
    for(int i = 1;i<=m;++i)
        scanf("%d",&a[i]);
    sort(a+1,a+m+1);
    sort(lr+1,lr+n+1);
    for(int i = 1;i<=n;++i)
    {
        for(int j = 1;j<=m;++j)
        {
            dp[i][j] = max(dp[i-1][j],dp[i][j-1]);
            if (lr[i].second<=a[j])
                dp[i][j] = max(dp[i][j],dp[i-1][j-1]+1);
        }
    }
    cout << dp[n][m];
    return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d",&lr[i].second,&lr[i].first);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&a[i]);
         ~~~~~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 356 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 356 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 10 ms 4300 KB Output is correct
21 Correct 9 ms 4344 KB Output is correct
22 Correct 8 ms 4352 KB Output is correct
23 Correct 10 ms 4352 KB Output is correct
24 Correct 9 ms 4352 KB Output is correct
25 Correct 9 ms 4344 KB Output is correct
26 Correct 11 ms 4352 KB Output is correct
27 Correct 8 ms 4352 KB Output is correct
28 Correct 9 ms 4352 KB Output is correct
29 Correct 9 ms 4352 KB Output is correct
30 Correct 10 ms 4344 KB Output is correct
31 Correct 10 ms 4324 KB Output is correct
32 Correct 7 ms 4352 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 7 ms 4352 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 10 ms 4352 KB Output is correct
37 Correct 9 ms 4356 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 2 ms 512 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 2 ms 356 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 10 ms 4300 KB Output is correct
21 Correct 9 ms 4344 KB Output is correct
22 Correct 8 ms 4352 KB Output is correct
23 Correct 10 ms 4352 KB Output is correct
24 Correct 9 ms 4352 KB Output is correct
25 Correct 9 ms 4344 KB Output is correct
26 Correct 11 ms 4352 KB Output is correct
27 Correct 8 ms 4352 KB Output is correct
28 Correct 9 ms 4352 KB Output is correct
29 Correct 9 ms 4352 KB Output is correct
30 Correct 10 ms 4344 KB Output is correct
31 Correct 10 ms 4324 KB Output is correct
32 Correct 7 ms 4352 KB Output is correct
33 Correct 2 ms 384 KB Output is correct
34 Correct 7 ms 4352 KB Output is correct
35 Correct 3 ms 384 KB Output is correct
36 Correct 10 ms 4352 KB Output is correct
37 Correct 9 ms 4356 KB Output is correct
38 Runtime error 393 ms 11476 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Halted 0 ms 0 KB -