oj.uz

Submission #595936

# Submission time Handle Problem Language Result Execution time Memory
595936 2022-07-14T08:12:02 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 7564 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 7 ms 468 KB Output is correct
3 Correct 6 ms 468 KB Output is correct
4 Correct 7 ms 468 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 5 ms 396 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 8 ms 468 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 9 ms 488 KB Output is correct
12 Correct 9 ms 484 KB Output is correct
13 Correct 9 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 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 99 ms 7092 KB Output is correct
2 Correct 109 ms 7152 KB Output is correct
3 Correct 67 ms 7112 KB Output is correct
4 Correct 84 ms 7104 KB Output is correct
5 Correct 75 ms 7128 KB Output is correct
6 Correct 69 ms 7156 KB Output is correct
7 Correct 66 ms 7104 KB Output is correct
8 Correct 85 ms 7124 KB Output is correct
9 Correct 37 ms 7172 KB Output is correct
10 Correct 53 ms 7192 KB Output is correct
11 Correct 36 ms 7100 KB Output is correct
12 Correct 50 ms 7104 KB Output is correct
13 Correct 89 ms 7156 KB Output is correct
14 Correct 105 ms 7104 KB Output is correct
15 Correct 69 ms 7136 KB Output is correct
16 Correct 88 ms 7196 KB Output is correct
17 Correct 94 ms 7168 KB Output is correct
18 Correct 91 ms 7148 KB Output is correct
19 Correct 64 ms 7120 KB Output is correct
20 Correct 79 ms 7152 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 7 ms 468 KB Output is correct
3 Correct 6 ms 468 KB Output is correct
4 Correct 7 ms 468 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 5 ms 396 KB Output is correct
7 Correct 4 ms 468 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 8 ms 468 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 9 ms 488 KB Output is correct
12 Correct 9 ms 484 KB Output is correct
13 Correct 9 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 99 ms 7092 KB Output is correct
24 Correct 109 ms 7152 KB Output is correct
25 Correct 67 ms 7112 KB Output is correct
26 Correct 84 ms 7104 KB Output is correct
27 Correct 75 ms 7128 KB Output is correct
28 Correct 69 ms 7156 KB Output is correct
29 Correct 66 ms 7104 KB Output is correct
30 Correct 85 ms 7124 KB Output is correct
31 Correct 37 ms 7172 KB Output is correct
32 Correct 53 ms 7192 KB Output is correct
33 Correct 36 ms 7100 KB Output is correct
34 Correct 50 ms 7104 KB Output is correct
35 Correct 89 ms 7156 KB Output is correct
36 Correct 105 ms 7104 KB Output is correct
37 Correct 69 ms 7136 KB Output is correct
38 Correct 88 ms 7196 KB Output is correct
39 Correct 94 ms 7168 KB Output is correct
40 Correct 91 ms 7148 KB Output is correct
41 Correct 64 ms 7120 KB Output is correct
42 Correct 79 ms 7152 KB Output is correct
43 Correct 1227 ms 7444 KB Output is correct
44 Correct 1466 ms 7380 KB Output is correct
45 Correct 1456 ms 7296 KB Output is correct
46 Correct 1504 ms 7404 KB Output is correct
47 Correct 1425 ms 7332 KB Output is correct
48 Correct 8236 ms 7332 KB Output is correct
49 Correct 8247 ms 7324 KB Output is correct
50 Correct 8195 ms 7412 KB Output is correct
51 Correct 8351 ms 7380 KB Output is correct
52 Correct 1545 ms 6628 KB Output is correct
53 Correct 2442 ms 7304 KB Output is correct
54 Execution timed out 12095 ms 7564 KB Time limit exceeded
55 Halted 0 ms 0 KB -