oj.uz

Submission #884816

# Submission time Handle Problem Language Result Execution time Memory
884816 2023-12-08T13:33:58 Z banhcuon14 Exhibition (JOI19_ho_t2) C++14
100 / 100
 41 ms 1632 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
typedef pair<int,int > pii;
typedef long long ll;
const int mod = 1e9 + 7;
const int maxn = 5 + 1e5;
int n, m;
struct info{
	int s, v;
	info(int _s = 0, int _v = 0): s(_s), v(_v) {};
	bool operator < (const info& other) const {
		return v < other.v;
	}
};
vector<info > a;
vector<int > c;
namespace subtask1{
	bool used[maxn];
	int res;
	void Try(int pos, vector<pair<int,int>>& v, int sz, int prev) {
		if (pos >= sz) {
			res = max(res, sz);
			return;
		}
		for (int i = 0; i < (int) c.size(); ++i) {
			if (!used[i] && c[i] >= prev && c[i] >= v[pos].fi ) {
				used[i] = true;
				Try(pos + 1, v, sz, c[i]);
				used[i] = false;
			}
		}
	}
	bool cmpA(info& a, info& b) {
		if (a.v != b.v) return a.v < b.v;
		return a.s < b.s;
	}
	void solve() {
		cin >> n >> m;
		a.resize(n+2, info());
		c.resize(m+2);
		for (int i = 0; i < n; ++i) {
			cin >> a[i].s >> a[i].v;
		}
		for (int i = 0; i < m; ++i) {
			cin >> c[i];
		}
		sort(a.begin(), a.begin()+n, cmpA);
		for (int mask = 1; mask < (1<<n); ++mask) {
			vector <pair<int,int > > v;
			for (int i = 0; i < n; ++i) {
				if ((mask>>i)&1) {
					v.push_back(make_pair(a[i].s,a[i].v));
				}
			}
			memset(used, false, m + 2);
			Try(0, v, (int) v.size(), -1);
		}
		cout << res;
	}
}
namespace subtask2 {
	int dp[maxn];
	void solve() {
		cin >> n >> m;
		a.resize(n+2, info());
		c.resize(m+2);
		for (int i = 1; i <= n; ++i) {
			cin >> a[i].s >> a[i].v;
		}
		for (int i = 1; i <= m; ++i) {
			cin >> c[i];
		}
		sort(c.begin() + 1, c.begin() + m + 1);
		sort(a.begin() + 1, a.begin() + n + 1);
		for (int j = 1; j <= n; ++j) {
			int i = lower_bound(c.begin() + 1, c.begin() + m + 1, a[j].s) - c.begin();
			int mx = 0, tmp;
			for(int k = 1; k < i; ++k) mx = max(dp[k], mx);
			for (int k = i; k <= m; ++k) {
				tmp = dp[k];
				dp[k] = max(dp[k], mx + 1);
				mx = max(mx, tmp);
			}
		}
		cout << dp[m];
	}
}
namespace subtask3 {
	void solve() {
		cin >> n >> m;
		vector<pair<int,int > > a(n);
		vector<int > c(m);
		for (int i = 0; i < n; ++i) {
			cin >> a[i].first >> a[i].second;
		}
		for (int i = 0; i < m; ++i) {
			cin >> c[i];
		}
		sort(c.begin(),c.end());
		sort(a.begin(),a.end(),[] (const pii& a, const pii& b) {
			if (a.second != b.second) return a.second < b.second;
			return a.first < b.first;
		});
		int res = 0;
		for (int i = n-1; i >= 0 && res < m; --i) {
			if (c[m - res - 1] >= a[i].first) ++res;
		}
		cout << res;
	}
}


signed main()
{
	#define name "task"
	if (fopen(name".inp", "r")) {
		freopen(name".inp", "r", stdin);
		freopen(name".out", "w", stdout);
	}
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	subtask3::solve();
	cerr << "Time Elasped: " << fixed << setprecision(3) << 1.0*clock()/CLOCKS_PER_SEC << '\n';
	return 0;
}

Compilation message

joi2019_ho_t2.cpp: In function 'int main()':
joi2019_ho_t2.cpp:120:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |   freopen(name".inp", "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
joi2019_ho_t2.cpp:121:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  121 |   freopen(name".out", "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 500 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 35 ms 1628 KB Output is correct
39 Correct 39 ms 1624 KB Output is correct
40 Correct 35 ms 1628 KB Output is correct
41 Correct 36 ms 1628 KB Output is correct
42 Correct 35 ms 1624 KB Output is correct
43 Correct 35 ms 1624 KB Output is correct
44 Correct 35 ms 1624 KB Output is correct
45 Correct 35 ms 1628 KB Output is correct
46 Correct 33 ms 1624 KB Output is correct
47 Correct 37 ms 1368 KB Output is correct
48 Correct 34 ms 1512 KB Output is correct
49 Correct 28 ms 1368 KB Output is correct
50 Correct 28 ms 1368 KB Output is correct
51 Correct 35 ms 1628 KB Output is correct
52 Correct 37 ms 1624 KB Output is correct
53 Correct 36 ms 1632 KB Output is correct
54 Correct 30 ms 1628 KB Output is correct
55 Correct 37 ms 1628 KB Output is correct
56 Correct 22 ms 1116 KB Output is correct
57 Correct 13 ms 856 KB Output is correct
58 Correct 21 ms 1116 KB Output is correct
59 Correct 22 ms 1116 KB Output is correct
60 Correct 14 ms 860 KB Output is correct
61 Correct 22 ms 1116 KB Output is correct
62 Correct 41 ms 1628 KB Output is correct
63 Correct 35 ms 1624 KB Output is correct
64 Correct 35 ms 1628 KB Output is correct
65 Correct 35 ms 1628 KB Output is correct
66 Correct 41 ms 1632 KB Output is correct
67 Correct 35 ms 1632 KB Output is correct
68 Correct 41 ms 1628 KB Output is correct
69 Correct 35 ms 1628 KB Output is correct
70 Correct 36 ms 1628 KB Output is correct
71 Correct 35 ms 1628 KB Output is correct
72 Correct 36 ms 1628 KB Output is correct
73 Correct 36 ms 1624 KB Output is correct