oj.uz

Submission #699620

# Submission time Handle Problem Language Result Execution time Memory
699620 2023-02-17T14:09:20 Z anonimy RMQ (NOI17_rmq) C++14
100 / 100
 58 ms 12620 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

struct seg
{
	vector<ll> a;
	ll sz;
	
	seg(ll n)
	{
		for (sz = 1; sz < n; sz <<= 1);
		a.resize(sz * 2, 0);
	}

	void update(ll l, ll r, ll x)
	{
		l += sz, r += sz;

		while (l<=r)
		{
			if (l % 2 == 1) a[l] = max(a[l], x), l++;
			if (r % 2 == 0) a[r] = max(a[r], x), r--;
			l >>= 1;
			r >>= 1;
		}
	}

	ll q(ll ind)
	{
		ind += sz;
		ll ans = a[ind];
		for (ind >>= 1; ind; ind >>= 1)
			ans = max(ans, a[ind]);
		return ans;
	}
};

int main()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);

	ll n, q;
	cin >> n >> q;

	vector<pll> range(n, {0, n - 1});
	seg s(n);
	while (q--)
	{
		ll l, r, a;
		cin >> l >> r >> a;

		s.update(l, r, a);
		range[a].first = max(range[a].first, l);
		range[a].second = min(range[a].second, r);
	}

	vector<vector<ll>> indexs(n);
	for (ll i = 0; i < n; i++)
	{
		ll maxx = s.q(i);
		indexs[maxx].push_back(i);
	}

	set<ll> op;
	vector<ll> ans(n);
	for (ll i = 0; i < n; i++)
	{
		for (ll j = 0; j < indexs[i].size(); j++)
			op.insert(indexs[i][j]);
		
		auto it = op.lower_bound(range[i].first);
		if (it == op.end() || (*it) > range[i].second)
		{
			for (ll k = 0; k < n; k++)
				cout << -1 << " ";
			return 0;
		}

		ans[(*it)] = i;
		op.erase(it);
	}

	for (ll i = 0; i < n; i++)
		cout << ans[i] << " ";

	return 0;
}

Compilation message

rmq.cpp: In function 'int main()':
rmq.cpp:75:20: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |   for (ll j = 0; j < indexs[i].size(); j++)
      |                  ~~^~~~~~~~~~~~~~~~~~

Subtask #1
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct

Subtask #2
44.0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 324 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 324 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 320 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 324 KB Output is correct
27 Correct 58 ms 11064 KB Output is correct
28 Correct 50 ms 11988 KB Output is correct
29 Correct 41 ms 11596 KB Output is correct
30 Correct 52 ms 12616 KB Output is correct
31 Correct 41 ms 9112 KB Output is correct
32 Correct 46 ms 8784 KB Output is correct
33 Correct 26 ms 11120 KB Output is correct
34 Correct 16 ms 7368 KB Output is correct
35 Correct 33 ms 12620 KB Output is correct
36 Correct 31 ms 8716 KB Output is correct
37 Correct 43 ms 8888 KB Output is correct
38 Correct 8 ms 6272 KB Output is correct
39 Correct 33 ms 8404 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct