oj.uz

Submission #595937

# Submission time Handle Problem Language Result Execution time Memory
595937 2022-07-14T08:13:31 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
100 / 100
 11792 ms 11912 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
vector<int>pos;
int arr[400100];
struct pq
{
	int* q;
	void init(vector<int>v)
	{
		q = (int*)calloc(v.size() * 2 + 3, sizeof(int));
		int i;
		for (i = 0; i < v.size(); i++)
			q[i + 1] = v[i];
	}
	inline int up(int n)
	{
		if (q[1] <= n)
		{
			return n;
		}
		int rv = q[1];

		int i = 1;
	T:
		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:80:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for (i = 0; i < pos.size() - 1; i++)
      |              ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 7 ms 468 KB Output is correct
5 Correct 6 ms 468 KB Output is correct
6 Correct 5 ms 472 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 11 ms 476 KB Output is correct
13 Correct 10 ms 480 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 5 ms 468 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 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 107 ms 7152 KB Output is correct
2 Correct 87 ms 7152 KB Output is correct
3 Correct 51 ms 7160 KB Output is correct
4 Correct 85 ms 7104 KB Output is correct
5 Correct 63 ms 7164 KB Output is correct
6 Correct 62 ms 7184 KB Output is correct
7 Correct 79 ms 7104 KB Output is correct
8 Correct 59 ms 7104 KB Output is correct
9 Correct 35 ms 7092 KB Output is correct
10 Correct 86 ms 7148 KB Output is correct
11 Correct 43 ms 7140 KB Output is correct
12 Correct 69 ms 7152 KB Output is correct
13 Correct 89 ms 7100 KB Output is correct
14 Correct 95 ms 7152 KB Output is correct
15 Correct 37 ms 7100 KB Output is correct
16 Correct 90 ms 7152 KB Output is correct
17 Correct 58 ms 7120 KB Output is correct
18 Correct 77 ms 7100 KB Output is correct
19 Correct 60 ms 7104 KB Output is correct
20 Correct 64 ms 7088 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 5 ms 468 KB Output is correct
3 Correct 4 ms 468 KB Output is correct
4 Correct 7 ms 468 KB Output is correct
5 Correct 6 ms 468 KB Output is correct
6 Correct 5 ms 472 KB Output is correct
7 Correct 4 ms 340 KB Output is correct
8 Correct 5 ms 340 KB Output is correct
9 Correct 6 ms 468 KB Output is correct
10 Correct 4 ms 468 KB Output is correct
11 Correct 8 ms 464 KB Output is correct
12 Correct 11 ms 476 KB Output is correct
13 Correct 10 ms 480 KB Output is correct
14 Correct 8 ms 468 KB Output is correct
15 Correct 5 ms 468 KB Output is correct
16 Correct 4 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 5 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 107 ms 7152 KB Output is correct
24 Correct 87 ms 7152 KB Output is correct
25 Correct 51 ms 7160 KB Output is correct
26 Correct 85 ms 7104 KB Output is correct
27 Correct 63 ms 7164 KB Output is correct
28 Correct 62 ms 7184 KB Output is correct
29 Correct 79 ms 7104 KB Output is correct
30 Correct 59 ms 7104 KB Output is correct
31 Correct 35 ms 7092 KB Output is correct
32 Correct 86 ms 7148 KB Output is correct
33 Correct 43 ms 7140 KB Output is correct
34 Correct 69 ms 7152 KB Output is correct
35 Correct 89 ms 7100 KB Output is correct
36 Correct 95 ms 7152 KB Output is correct
37 Correct 37 ms 7100 KB Output is correct
38 Correct 90 ms 7152 KB Output is correct
39 Correct 58 ms 7120 KB Output is correct
40 Correct 77 ms 7100 KB Output is correct
41 Correct 60 ms 7104 KB Output is correct
42 Correct 64 ms 7088 KB Output is correct
43 Correct 1191 ms 7396 KB Output is correct
44 Correct 1344 ms 7472 KB Output is correct
45 Correct 1225 ms 7204 KB Output is correct
46 Correct 1183 ms 7408 KB Output is correct
47 Correct 1255 ms 7388 KB Output is correct
48 Correct 8465 ms 7340 KB Output is correct
49 Correct 8710 ms 7408 KB Output is correct
50 Correct 9138 ms 7324 KB Output is correct
51 Correct 8050 ms 7324 KB Output is correct
52 Correct 1373 ms 6708 KB Output is correct
53 Correct 2001 ms 7384 KB Output is correct
54 Correct 11433 ms 7364 KB Output is correct
55 Correct 11279 ms 7636 KB Output is correct
56 Correct 11278 ms 11912 KB Output is correct
57 Correct 11792 ms 11860 KB Output is correct
58 Correct 7393 ms 10900 KB Output is correct
59 Correct 7580 ms 11112 KB Output is correct
60 Correct 152 ms 11548 KB Output is correct
61 Correct 117 ms 11576 KB Output is correct
62 Correct 91 ms 11628 KB Output is correct
63 Correct 92 ms 11592 KB Output is correct
64 Correct 1028 ms 8488 KB Output is correct
65 Correct 69 ms 10180 KB Output is correct
66 Correct 75 ms 10220 KB Output is correct
67 Correct 4636 ms 11692 KB Output is correct
68 Correct 9727 ms 11800 KB Output is correct
69 Correct 9714 ms 11712 KB Output is correct
70 Correct 9544 ms 11800 KB Output is correct