oj.uz

Submission #595865

# Submission time Handle Problem Language Result Execution time Memory
595865 2022-07-14T07:46:59 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 11588 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);
	}
	inline int up(int 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++)
			{
				if(poss[j].q[1]>c)
					c = poss[j].up(c);
			}
			for (j = 0; j < b; j++)
			{
				if (poss[j].q[1] > c)
					c = poss[j].up(c);
			}

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1620 KB Output is correct
2 Correct 4 ms 1620 KB Output is correct
3 Correct 4 ms 1620 KB Output is correct
4 Correct 4 ms 1620 KB Output is correct
5 Correct 4 ms 1620 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1620 KB Output is correct
8 Correct 3 ms 1492 KB Output is correct
9 Correct 4 ms 1620 KB Output is correct
10 Correct 4 ms 1620 KB Output is correct
11 Correct 7 ms 1636 KB Output is correct
12 Correct 8 ms 1620 KB Output is correct
13 Correct 9 ms 1616 KB Output is correct
14 Correct 4 ms 1620 KB Output is correct
15 Correct 5 ms 1620 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 95 ms 11400 KB Output is correct
2 Correct 86 ms 11396 KB Output is correct
3 Correct 50 ms 11588 KB Output is correct
4 Correct 86 ms 11492 KB Output is correct
5 Correct 60 ms 11444 KB Output is correct
6 Correct 64 ms 11448 KB Output is correct
7 Correct 104 ms 11412 KB Output is correct
8 Correct 74 ms 11452 KB Output is correct
9 Correct 36 ms 11452 KB Output is correct
10 Correct 50 ms 11440 KB Output is correct
11 Correct 35 ms 11432 KB Output is correct
12 Correct 53 ms 11428 KB Output is correct
13 Correct 100 ms 11464 KB Output is correct
14 Correct 79 ms 11396 KB Output is correct
15 Correct 38 ms 11468 KB Output is correct
16 Correct 82 ms 11396 KB Output is correct
17 Correct 59 ms 11456 KB Output is correct
18 Correct 67 ms 11496 KB Output is correct
19 Correct 62 ms 11484 KB Output is correct
20 Correct 76 ms 11476 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1620 KB Output is correct
2 Correct 4 ms 1620 KB Output is correct
3 Correct 4 ms 1620 KB Output is correct
4 Correct 4 ms 1620 KB Output is correct
5 Correct 4 ms 1620 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1620 KB Output is correct
8 Correct 3 ms 1492 KB Output is correct
9 Correct 4 ms 1620 KB Output is correct
10 Correct 4 ms 1620 KB Output is correct
11 Correct 7 ms 1636 KB Output is correct
12 Correct 8 ms 1620 KB Output is correct
13 Correct 9 ms 1616 KB Output is correct
14 Correct 4 ms 1620 KB Output is correct
15 Correct 5 ms 1620 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 95 ms 11400 KB Output is correct
24 Correct 86 ms 11396 KB Output is correct
25 Correct 50 ms 11588 KB Output is correct
26 Correct 86 ms 11492 KB Output is correct
27 Correct 60 ms 11444 KB Output is correct
28 Correct 64 ms 11448 KB Output is correct
29 Correct 104 ms 11412 KB Output is correct
30 Correct 74 ms 11452 KB Output is correct
31 Correct 36 ms 11452 KB Output is correct
32 Correct 50 ms 11440 KB Output is correct
33 Correct 35 ms 11432 KB Output is correct
34 Correct 53 ms 11428 KB Output is correct
35 Correct 100 ms 11464 KB Output is correct
36 Correct 79 ms 11396 KB Output is correct
37 Correct 38 ms 11468 KB Output is correct
38 Correct 82 ms 11396 KB Output is correct
39 Correct 59 ms 11456 KB Output is correct
40 Correct 67 ms 11496 KB Output is correct
41 Correct 62 ms 11484 KB Output is correct
42 Correct 76 ms 11476 KB Output is correct
43 Correct 1220 ms 7820 KB Output is correct
44 Correct 1341 ms 7860 KB Output is correct
45 Correct 1329 ms 7648 KB Output is correct
46 Correct 1229 ms 7840 KB Output is correct
47 Correct 1105 ms 7788 KB Output is correct
48 Correct 10171 ms 7832 KB Output is correct
49 Correct 8402 ms 7768 KB Output is correct
50 Correct 8669 ms 7820 KB Output is correct
51 Correct 9176 ms 7864 KB Output is correct
52 Correct 1428 ms 7412 KB Output is correct
53 Correct 2188 ms 7960 KB Output is correct
54 Execution timed out 12079 ms 7756 KB Time limit exceeded
55 Halted 0 ms 0 KB -