oj.uz

답안 #868926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868926 2023-11-02T12:44:13 Z mgl_diamond Matryoshka (JOI16_matryoshka) C++17
100 / 100
 326 ms 26540 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<int, int>;
template<class T> using vec = vector<T>;
 
#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define file "input"
 
void setIO(string name="") {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  if (fopen(file".in", "r")) {
    freopen(file".in", "r", stdin);
    freopen(file".out", "w", stdout);
  }
}

const int N = 2e5+5;
int n, m, ft[N], dp[N], fst[N*4], ret[N];
vector<int> comp;
ii a[N];

void modify(int i, int v) {
	for(i=n-i+1; i<=n; i+=i&-i) ft[i] = max(ft[i], v);
}

int query(int i) {
	int ans = 0;
	for(i=n-i+1; i>=1; i-=i&-i) ans = max(ans, ft[i]);
	return ans;
}

int main() {
	setIO();
	cin >> n >> m;
	foru(i, 1, n) {
		cin >> a[i].fi >> a[i].se;
		comp.push_back(a[i].fi);
		comp.push_back(a[i].se);
	}

	vector<pair<ii, int>> querys;
	foru(i, 1, m) {
		int d, h;
		cin >> d >> h;
		querys.push_back({{h, d}, i});
		comp.push_back(d);
		comp.push_back(h);
	}

	sort(all(comp));
	comp.resize(unique(all(comp)) - comp.begin());

	foru(i, 1, n) {
		a[i].fi = upper_bound(all(comp), a[i].fi) - comp.begin();
		a[i].se = upper_bound(all(comp), a[i].se) - comp.begin();
	}

	fore(x, querys) {
		x.fi.fi = upper_bound(all(comp), x.fi.fi) - comp.begin();
		x.fi.se = upper_bound(all(comp), x.fi.se) - comp.begin();
	}

	sort(a+1, a+n+1, [&](ii a, ii b){
		return a.fi < b.fi || (a.fi == b.fi && a.se > b.se);
	});

	vector<int> lis;
	vector<ii> updates;

	ford(i, n, 1) {
		int it = upper_bound(all(lis), a[i].se) - lis.begin();
		if (it == sz(lis)) lis.push_back(a[i].se);
		else lis[it] = a[i].se;
		fst[a[i].fi] = i;
		dp[i] = it+1;
		updates.emplace_back(a[i].se, i);
	}

	fst[sz(comp)+1] = n+1;
	ford(i, sz(comp), 1) if (fst[i] == 0) fst[i] = fst[i+1];
	
	sort(all(querys));
	sort(all(updates));

	int j = 0, k = 0;
	foru(i, 1, sz(comp)) {
		while (j < sz(updates) && updates[j].fi <= i) {
			int p = updates[j].se;
			modify(p, dp[p]);
			++j;
		}

		while (k < sz(querys) && querys[k].fi.fi <= i) {
			int p = fst[querys[k].fi.se];
			ret[querys[k].se] = query(p);
			++k;
		}
	}

	foru(i, 1, m) {
		cout << ret[i] << "\n";
	}
}

Compilation message

matryoshka.cpp: In function 'void setIO(std::string)':
matryoshka.cpp:20:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |     freopen(file".in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
matryoshka.cpp:21:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     freopen(file".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6644 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6644 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6644 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 3 ms 6748 KB Output is correct
25 Correct 3 ms 6820 KB Output is correct
26 Correct 3 ms 6624 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 3 ms 6748 KB Output is correct
29 Correct 3 ms 6748 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 4 ms 6744 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 3 ms 6708 KB Output is correct
34 Correct 3 ms 6748 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6488 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 1 ms 6644 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 1 ms 6492 KB Output is correct
6 Correct 1 ms 6488 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6608 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 1 ms 6492 KB Output is correct
13 Correct 1 ms 6492 KB Output is correct
14 Correct 1 ms 6488 KB Output is correct
15 Correct 1 ms 6492 KB Output is correct
16 Correct 1 ms 6492 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 1 ms 6492 KB Output is correct
20 Correct 1 ms 6492 KB Output is correct
21 Correct 1 ms 6492 KB Output is correct
22 Correct 2 ms 6492 KB Output is correct
23 Correct 3 ms 6748 KB Output is correct
24 Correct 3 ms 6748 KB Output is correct
25 Correct 3 ms 6820 KB Output is correct
26 Correct 3 ms 6624 KB Output is correct
27 Correct 3 ms 6748 KB Output is correct
28 Correct 3 ms 6748 KB Output is correct
29 Correct 3 ms 6748 KB Output is correct
30 Correct 3 ms 6748 KB Output is correct
31 Correct 4 ms 6744 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 3 ms 6708 KB Output is correct
34 Correct 3 ms 6748 KB Output is correct
35 Correct 4 ms 6748 KB Output is correct
36 Correct 300 ms 22496 KB Output is correct
37 Correct 245 ms 22720 KB Output is correct
38 Correct 100 ms 13128 KB Output is correct
39 Correct 187 ms 20228 KB Output is correct
40 Correct 192 ms 20736 KB Output is correct
41 Correct 256 ms 22464 KB Output is correct
42 Correct 134 ms 19388 KB Output is correct
43 Correct 81 ms 20668 KB Output is correct
44 Correct 322 ms 26540 KB Output is correct
45 Correct 326 ms 24956 KB Output is correct
46 Correct 318 ms 24972 KB Output is correct
47 Correct 314 ms 24616 KB Output is correct
48 Correct 316 ms 25112 KB Output is correct
49 Correct 306 ms 25276 KB Output is correct
50 Correct 309 ms 25140 KB Output is correct