oj.uz

Submission #596139

# Submission time Handle Problem Language Result Execution time Memory
596139 2022-07-14T12:11:09 Z jjang36524 Sushi (JOI16_sushi) C++14
100 / 100
 11587 ms 7224 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
vector<int>pos;
int arr[400100];
struct pq
{
	int* q;
	int r;
	void init(vector<int>v)
	{
		q = (int*)calloc(v.size()+2, sizeof(int));
		int i;
		for (i = 0; i < v.size(); i++)
			q[i + 1] = v[i];
		r = v.size();
	}
	inline int up(int n)
	{
		if (q[1] <= n)
		{
			return n;
		}
		int rv = q[1];

		int i = 1;
	T:
		if (i * 2 > r)
		{
			q[i] = n;
			return rv;
		}
		if (q[i * 2] <= q[i * 2 + 1])
		{
			if (q[i * 2 + 1] <= n)
			{
				q[i] = n;
				return rv;
			}
			q[i] = q[i * 2 + 1];
			i = i * 2 + 1;
		}
		else
		{
			if (q[i * 2] <= n)
			{
				q[i] = n;
				return rv;
			}
			q[i] = q[i * 2];
			i = i * 2;
		}
		goto T;
	}
};
pq poss[50100];
int q[25100][3];
int main()
{
	int N, M;
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cin >> N >> M;
	int i;
	for (i = 0; i < N; i++)
	{
		cin >> arr[i];
	}
	for (i = 0; i < M; i++)
	{
		int a, b, c;
		cin >> a >> b >> c;
		a--;
		b--;
		q[i][0] = a;
		q[i][1] = b;
		q[i][2] = c;
		pos.push_back(a);
		pos.push_back(b + 1);
	}
	pos.push_back(0);
	pos.push_back(N);
	sort(pos.begin(), pos.end());
	pos.erase(unique(pos.begin(), pos.end()), pos.end());
	for (i = 0; i < pos.size() - 1; i++)
	{
		vector<int>x;
		int j;
		for (j = pos[i]; j < pos[i + 1]; j++)
		{
			x.push_back(arr[j]);
		}
		sort(x.begin(), x.end());
		reverse(x.begin(), x.end());
		poss[i].init(x);
	}
	int lm = pos.size() - 1;
	for (i = 0; i < M; i++)
	{
		int a = lower_bound(pos.begin(), pos.end(), q[i][0]) - pos.begin();
		int b = lower_bound(pos.begin(), pos.end(), q[i][1] + 1) - pos.begin();
		int j;
		int c = q[i][2];
		if (q[i][0] > q[i][1])
		{

			for (j = a; j < lm; j++)
			{
				c = poss[j].up(c);
			}
			for (j = 0; j < b; j++)
			{
				c = poss[j].up(c);
			}

		}
		else
		{
			for (j = a; j < b; j++)
			{
				c = poss[j].up(c);
			}
		}
		cout << c << '\n';
	}
}

Compilation message

sushi.cpp: In member function 'void pq::init(std::vector<int>)':
sushi.cpp:15:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |   for (i = 0; i < v.size(); i++)
      |               ~~^~~~~~~~~~
sushi.cpp: In function 'int main()':
sushi.cpp:86:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |  for (i = 0; i < pos.size() - 1; i++)
      |              ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 492 KB Output is correct
2 Correct 4 ms 468 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 5 ms 488 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 7 ms 468 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 7 ms 468 KB Output is correct
12 Correct 7 ms 488 KB Output is correct
13 Correct 11 ms 488 KB Output is correct
14 Correct 6 ms 472 KB Output is correct
15 Correct 10 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 7112 KB Output is correct
2 Correct 76 ms 7100 KB Output is correct
3 Correct 62 ms 7196 KB Output is correct
4 Correct 82 ms 7192 KB Output is correct
5 Correct 68 ms 7164 KB Output is correct
6 Correct 83 ms 7184 KB Output is correct
7 Correct 87 ms 7188 KB Output is correct
8 Correct 81 ms 7160 KB Output is correct
9 Correct 45 ms 7084 KB Output is correct
10 Correct 68 ms 7164 KB Output is correct
11 Correct 38 ms 7112 KB Output is correct
12 Correct 50 ms 7212 KB Output is correct
13 Correct 93 ms 7152 KB Output is correct
14 Correct 86 ms 7096 KB Output is correct
15 Correct 54 ms 7152 KB Output is correct
16 Correct 90 ms 7152 KB Output is correct
17 Correct 56 ms 7116 KB Output is correct
18 Correct 79 ms 7120 KB Output is correct
19 Correct 78 ms 7132 KB Output is correct
20 Correct 64 ms 7200 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 492 KB Output is correct
2 Correct 4 ms 468 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 5 ms 488 KB Output is correct
6 Correct 4 ms 468 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 4 ms 468 KB Output is correct
9 Correct 7 ms 468 KB Output is correct
10 Correct 7 ms 468 KB Output is correct
11 Correct 7 ms 468 KB Output is correct
12 Correct 7 ms 488 KB Output is correct
13 Correct 11 ms 488 KB Output is correct
14 Correct 6 ms 472 KB Output is correct
15 Correct 10 ms 468 KB Output is correct
16 Correct 3 ms 468 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 86 ms 7112 KB Output is correct
24 Correct 76 ms 7100 KB Output is correct
25 Correct 62 ms 7196 KB Output is correct
26 Correct 82 ms 7192 KB Output is correct
27 Correct 68 ms 7164 KB Output is correct
28 Correct 83 ms 7184 KB Output is correct
29 Correct 87 ms 7188 KB Output is correct
30 Correct 81 ms 7160 KB Output is correct
31 Correct 45 ms 7084 KB Output is correct
32 Correct 68 ms 7164 KB Output is correct
33 Correct 38 ms 7112 KB Output is correct
34 Correct 50 ms 7212 KB Output is correct
35 Correct 93 ms 7152 KB Output is correct
36 Correct 86 ms 7096 KB Output is correct
37 Correct 54 ms 7152 KB Output is correct
38 Correct 90 ms 7152 KB Output is correct
39 Correct 56 ms 7116 KB Output is correct
40 Correct 79 ms 7120 KB Output is correct
41 Correct 78 ms 7132 KB Output is correct
42 Correct 64 ms 7200 KB Output is correct
43 Correct 823 ms 5972 KB Output is correct
44 Correct 906 ms 5952 KB Output is correct
45 Correct 838 ms 5876 KB Output is correct
46 Correct 875 ms 5976 KB Output is correct
47 Correct 874 ms 5896 KB Output is correct
48 Correct 7722 ms 6048 KB Output is correct
49 Correct 7870 ms 6028 KB Output is correct
50 Correct 7895 ms 6036 KB Output is correct
51 Correct 7909 ms 6168 KB Output is correct
52 Correct 1136 ms 5276 KB Output is correct
53 Correct 1621 ms 6280 KB Output is correct
54 Correct 11197 ms 6348 KB Output is correct
55 Correct 11587 ms 6240 KB Output is correct
56 Correct 11158 ms 6188 KB Output is correct
57 Correct 11210 ms 6068 KB Output is correct
58 Correct 7087 ms 5160 KB Output is correct
59 Correct 7125 ms 5144 KB Output is correct
60 Correct 74 ms 7112 KB Output is correct
61 Correct 84 ms 7176 KB Output is correct
62 Correct 81 ms 7196 KB Output is correct
63 Correct 79 ms 7112 KB Output is correct
64 Correct 769 ms 5968 KB Output is correct
65 Correct 62 ms 7224 KB Output is correct
66 Correct 65 ms 7108 KB Output is correct
67 Correct 3487 ms 6260 KB Output is correct
68 Correct 9315 ms 6152 KB Output is correct
69 Correct 9194 ms 6320 KB Output is correct
70 Correct 9126 ms 6428 KB Output is correct