oj.uz

Submission #358551

# Submission time Handle Problem Language Result Execution time Memory
358551 2021-01-25T19:13:50 Z shahriarkhan Exhibition (JOI19_ho_t2) C++14
50 / 100
 10 ms 4352 KB 
#include<bits/stdc++.h>
using namespace std ;

int main()
{
    int n , m ;
    scanf("%d%d",&n,&m) ;
    vector<pair<int,int> > paints ;
    int frames[m+1] , dp[m+1][n+1] , pref[n+1] = {0} ;
    paints.push_back({0,0}) ;
    for(int i = 1 ; i <= n ; ++i)
    {
        int x , y ;
        scanf("%d%d",&x,&y) ;
        paints.push_back({y,x}) ;
    }
    sort(paints.begin()+1,paints.end()) ;
    for(int i = 1 ; i <= m ; ++i)
    {
        scanf("%d",&frames[i]) ;
    }
    sort(frames+1,frames+m+1) ;
    for(int i = 0 ; i <= m ; ++i)
    {
        for(int j = 0 ; j <= n ; ++j)
        {
            dp[i][j] = 0 ;
        }
    }
    for(int i = 1 ; i <= m ; ++i)
    {
        for(int j = 1 ; j <= n ; ++j)
        {
            if(frames[i]<paints[j].second) continue ;
            dp[i][j] = pref[j-1] + 1 ;
        }
        for(int j = 1 ; j <= n ; ++j)
        {
            pref[j] = max(pref[j-1],dp[i][j]) ;
        }
    }
    printf("%d\n",pref[n]) ;
    return 0 ;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:7:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    7 |     scanf("%d%d",&n,&m) ;
      |     ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:14:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   14 |         scanf("%d%d",&x,&y) ;
      |         ~~~~~^~~~~~~~~~~~~~
joi2019_ho_t2.cpp:20:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   20 |         scanf("%d",&frames[i]) ;
      |         ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 8 ms 4332 KB Output is correct
21 Correct 9 ms 4332 KB Output is correct
22 Correct 8 ms 4332 KB Output is correct
23 Correct 8 ms 4352 KB Output is correct
24 Correct 9 ms 4332 KB Output is correct
25 Correct 9 ms 4204 KB Output is correct
26 Correct 9 ms 4332 KB Output is correct
27 Correct 8 ms 4332 KB Output is correct
28 Correct 9 ms 4332 KB Output is correct
29 Correct 9 ms 4332 KB Output is correct
30 Correct 8 ms 4332 KB Output is correct
31 Correct 9 ms 4332 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 4 ms 1516 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 10 ms 4332 KB Output is correct
37 Correct 10 ms 4332 KB Output is correct

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 0 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 8 ms 4332 KB Output is correct
21 Correct 9 ms 4332 KB Output is correct
22 Correct 8 ms 4332 KB Output is correct
23 Correct 8 ms 4352 KB Output is correct
24 Correct 9 ms 4332 KB Output is correct
25 Correct 9 ms 4204 KB Output is correct
26 Correct 9 ms 4332 KB Output is correct
27 Correct 8 ms 4332 KB Output is correct
28 Correct 9 ms 4332 KB Output is correct
29 Correct 9 ms 4332 KB Output is correct
30 Correct 8 ms 4332 KB Output is correct
31 Correct 9 ms 4332 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 4 ms 1516 KB Output is correct
35 Correct 1 ms 492 KB Output is correct
36 Correct 10 ms 4332 KB Output is correct
37 Correct 10 ms 4332 KB Output is correct
38 Runtime error 1 ms 492 KB Execution killed with signal 11
39 Halted 0 ms 0 KB -