oj.uz

Submission #595844

# Submission time Handle Problem Language Result Execution time Memory
595844 2022-07-14T07:36:43 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 13676 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int>pos;
int arr[400100];
struct pq
{
	vector<int>q;
	void init(vector<int>v)
	{
		q.push_back(0);
		int i;
		for (i = 0; i < v.size(); i++)
			q.push_back(v[i]);
		q.resize(q.size() * 2 + 5);
	}
	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:12:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   12 |   for (i = 0; i < v.size(); i++)
      |               ~~^~~~~~~~~~
sushi.cpp: In function 'int main()':
sushi.cpp:78:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |  for (i = 0; i < pos.size()-1; i++)
      |              ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1620 KB Output is correct
2 Correct 5 ms 1620 KB Output is correct
3 Correct 6 ms 1652 KB Output is correct
4 Correct 5 ms 1620 KB Output is correct
5 Correct 4 ms 1620 KB Output is correct
6 Correct 4 ms 1664 KB Output is correct
7 Correct 4 ms 1636 KB Output is correct
8 Correct 6 ms 1620 KB Output is correct
9 Correct 7 ms 1620 KB Output is correct
10 Correct 5 ms 1620 KB Output is correct
11 Correct 8 ms 1620 KB Output is correct
12 Correct 7 ms 1620 KB Output is correct
13 Correct 9 ms 1652 KB Output is correct
14 Correct 5 ms 1620 KB Output is correct
15 Correct 6 ms 1668 KB Output is correct
16 Correct 3 ms 1620 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 11468 KB Output is correct
2 Correct 89 ms 12940 KB Output is correct
3 Correct 57 ms 12448 KB Output is correct
4 Correct 98 ms 12972 KB Output is correct
5 Correct 75 ms 13008 KB Output is correct
6 Correct 90 ms 13052 KB Output is correct
7 Correct 74 ms 12940 KB Output is correct
8 Correct 66 ms 12972 KB Output is correct
9 Correct 42 ms 12468 KB Output is correct
10 Correct 58 ms 12944 KB Output is correct
11 Correct 37 ms 12452 KB Output is correct
12 Correct 55 ms 13076 KB Output is correct
13 Correct 88 ms 12936 KB Output is correct
14 Correct 80 ms 12980 KB Output is correct
15 Correct 52 ms 12524 KB Output is correct
16 Correct 97 ms 13056 KB Output is correct
17 Correct 64 ms 12996 KB Output is correct
18 Correct 74 ms 13048 KB Output is correct
19 Correct 85 ms 12936 KB Output is correct
20 Correct 73 ms 13116 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 1620 KB Output is correct
2 Correct 5 ms 1620 KB Output is correct
3 Correct 6 ms 1652 KB Output is correct
4 Correct 5 ms 1620 KB Output is correct
5 Correct 4 ms 1620 KB Output is correct
6 Correct 4 ms 1664 KB Output is correct
7 Correct 4 ms 1636 KB Output is correct
8 Correct 6 ms 1620 KB Output is correct
9 Correct 7 ms 1620 KB Output is correct
10 Correct 5 ms 1620 KB Output is correct
11 Correct 8 ms 1620 KB Output is correct
12 Correct 7 ms 1620 KB Output is correct
13 Correct 9 ms 1652 KB Output is correct
14 Correct 5 ms 1620 KB Output is correct
15 Correct 6 ms 1668 KB Output is correct
16 Correct 3 ms 1620 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 KB Output is correct
20 Correct 1 ms 1492 KB Output is correct
21 Correct 1 ms 1492 KB Output is correct
22 Correct 1 ms 1492 KB Output is correct
23 Correct 98 ms 11468 KB Output is correct
24 Correct 89 ms 12940 KB Output is correct
25 Correct 57 ms 12448 KB Output is correct
26 Correct 98 ms 12972 KB Output is correct
27 Correct 75 ms 13008 KB Output is correct
28 Correct 90 ms 13052 KB Output is correct
29 Correct 74 ms 12940 KB Output is correct
30 Correct 66 ms 12972 KB Output is correct
31 Correct 42 ms 12468 KB Output is correct
32 Correct 58 ms 12944 KB Output is correct
33 Correct 37 ms 12452 KB Output is correct
34 Correct 55 ms 13076 KB Output is correct
35 Correct 88 ms 12936 KB Output is correct
36 Correct 80 ms 12980 KB Output is correct
37 Correct 52 ms 12524 KB Output is correct
38 Correct 97 ms 13056 KB Output is correct
39 Correct 64 ms 12996 KB Output is correct
40 Correct 74 ms 13048 KB Output is correct
41 Correct 85 ms 12936 KB Output is correct
42 Correct 73 ms 13116 KB Output is correct
43 Correct 1998 ms 10568 KB Output is correct
44 Correct 1954 ms 13408 KB Output is correct
45 Correct 1661 ms 10024 KB Output is correct
46 Correct 1836 ms 13676 KB Output is correct
47 Correct 1794 ms 13560 KB Output is correct
48 Correct 8776 ms 13424 KB Output is correct
49 Correct 8589 ms 13424 KB Output is correct
50 Correct 8914 ms 13636 KB Output is correct
51 Correct 9270 ms 13548 KB Output is correct
52 Correct 1660 ms 12352 KB Output is correct
53 Correct 3468 ms 13296 KB Output is correct
54 Execution timed out 12078 ms 13508 KB Time limit exceeded
55 Halted 0 ms 0 KB -