oj.uz

Submission #493177

# Submission time Handle Problem Language Result Execution time Memory
493177 2021-12-10T10:09:46 Z Karabasan Exhibition (JOI19_ho_t2) C++17
0 / 100
 1 ms 1100 KB 
#include <bits/stdc++.h>
#define ll long long
#define fast1 ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define endl "\n"
#define int long long
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC target("fma,sse,sse2,sse3,avx")
#pragma GCC optimize("unroll-loops")

int n,q,m,a,b;
int dizi[100005];
pair<int,int> p[100005];
int dp[100005];
int dps(int x)
{

}
void solve()
{
    cin>>n>>m;
    for(int i=0;i<n;i++)
        cin>>p[i].second>>p[i].first;
    for(int i=0;i<m;i++)
        cin>>dizi[i];
    sort(dizi,dizi+n);
    reverse(dizi,dizi+n);
    sort(p,p+n);
    reverse(p,p+n);
    int j=0;
    for(int i=0;i<n;i++)
    {
        if(j<=m&&dizi[j]>=p[i].second)
            j++;
    }
    cout<<j;
}
signed main()
{
    memset(dp,-1,sizeof dp);
    fast1
    //freopen ("lca.gir","r",stdin);
    //freopen ("lca.cik","w",stdout);
    int t=1;
    //cin>>t;
    while(t--)
    {
        solve();
    }
    return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'long long int dps(long long int)':
joi2019_ho_t2.cpp:18:1: warning: no return statement in function returning non-void [-Wreturn-type]
   18 | }
      | ^

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1056 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Incorrect 1 ms 1100 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1056 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Incorrect 1 ms 1100 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1024 KB Output is correct
9 Correct 1 ms 1100 KB Output is correct
10 Correct 1 ms 1100 KB Output is correct
11 Correct 1 ms 1100 KB Output is correct
12 Correct 1 ms 1100 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 1 ms 1100 KB Output is correct
15 Correct 1 ms 1056 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Incorrect 1 ms 1100 KB Output isn't correct
18 Halted 0 ms 0 KB -