oj.uz

Submission #334265

# Submission time Handle Problem Language Result Execution time Memory
334265 2020-12-08T21:58:18 Z HoneyBadger Exhibition (JOI19_ho_t2) C++17
50 / 100
 276 ms 25016 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <bitset>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <utility>
#include <algorithm>
#include <random>
#include <cmath>
#include <cassert>
#include <climits>
#include <ctime>
#include <chrono>


/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,avx2,tune=native")
*/


#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << x << endl;
#else
    #define dbg(x)
#endif

#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto& x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()

using namespace std;

template<typename T1, typename T2>inline void mine(T1 &x, const T2 &y) { if (y < x) x = y; }
template<typename T1, typename T2>inline void maxe(T1 &x, const T2 &y) { if (x < y) x = y; }

ostream& operator << (ostream &out, const vector<int> &b) {
    for (auto k : b) out << k << ' ';
    return out;
}

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;



const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 1010;
const double EPS = 1e-9;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int dp[MX][MX];

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n, m;
    cin >> n >> m;
    vpii a(n);
    fx(x, a) {
    	cin >> x.second >> x.first;
    }
    sort(all(a));
    vi c(m);
    fx(x, c) cin >> x;
    sort(all(c));
    fi(0, n) {
    	fj(0, m) {
    		int w = (i && j ? dp[i - 1][j - 1] : 0);
    		dp[i][j] = w + (c[j] >= a[i].second);
    		if (i) maxe(dp[i][j], dp[i - 1][j]);
    		if (j) maxe(dp[i][j], dp[i][j - 1]);
    	}
    }
    cout << dp[n - 1][m - 1] << '\n';

}

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 1 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 372 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 1 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 372 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 7 ms 8300 KB Output is correct
21 Correct 7 ms 8300 KB Output is correct
22 Correct 7 ms 8300 KB Output is correct
23 Correct 8 ms 8300 KB Output is correct
24 Correct 11 ms 8320 KB Output is correct
25 Correct 7 ms 8300 KB Output is correct
26 Correct 7 ms 8428 KB Output is correct
27 Correct 7 ms 8300 KB Output is correct
28 Correct 7 ms 8300 KB Output is correct
29 Correct 7 ms 8300 KB Output is correct
30 Correct 7 ms 8300 KB Output is correct
31 Correct 8 ms 8300 KB Output is correct
32 Correct 3 ms 4332 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 5 ms 6636 KB Output is correct
35 Correct 1 ms 620 KB Output is correct
36 Correct 8 ms 8300 KB Output is correct
37 Correct 8 ms 8300 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 1 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 372 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 7 ms 8300 KB Output is correct
21 Correct 7 ms 8300 KB Output is correct
22 Correct 7 ms 8300 KB Output is correct
23 Correct 8 ms 8300 KB Output is correct
24 Correct 11 ms 8320 KB Output is correct
25 Correct 7 ms 8300 KB Output is correct
26 Correct 7 ms 8428 KB Output is correct
27 Correct 7 ms 8300 KB Output is correct
28 Correct 7 ms 8300 KB Output is correct
29 Correct 7 ms 8300 KB Output is correct
30 Correct 7 ms 8300 KB Output is correct
31 Correct 8 ms 8300 KB Output is correct
32 Correct 3 ms 4332 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 5 ms 6636 KB Output is correct
35 Correct 1 ms 620 KB Output is correct
36 Correct 8 ms 8300 KB Output is correct
37 Correct 8 ms 8300 KB Output is correct
38 Runtime error 276 ms 25016 KB Execution killed with signal 11 (could be triggered by violating memory limits)
39 Halted 0 ms 0 KB -