oj.uz

Submission #595893

# Submission time Handle Problem Language Result Execution time Memory
595893 2022-07-14T07:55:48 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 12156 KB 
#include <bits/stdc++.h>
using namespace std;
vector<int>pos;
int arr[400100];
struct pq
{
	vector<int>q;
	int ca = 0;
	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);
		if (v.size() <= 4)
			ca = 1;
	}
	inline int up(int n)
	{
		if (q[1] <= n)
		{
			return n;
		}
		int rv = q[1];
		if (ca)
		{
			int i = 1;
			while (q[i+1]>n)
			{
				q[i] = q[i+1];
				i++;
			}
			q[i] = n;
			return rv;
		}
		

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2004 KB Output is correct
2 Correct 5 ms 2004 KB Output is correct
3 Correct 4 ms 2004 KB Output is correct
4 Correct 5 ms 2004 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct
6 Correct 5 ms 2004 KB Output is correct
7 Correct 4 ms 2004 KB Output is correct
8 Correct 4 ms 2008 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 10 ms 2024 KB Output is correct
11 Correct 10 ms 2004 KB Output is correct
12 Correct 10 ms 2008 KB Output is correct
13 Correct 11 ms 2024 KB Output is correct
14 Correct 6 ms 2012 KB Output is correct
15 Correct 8 ms 2004 KB Output is correct
16 Correct 6 ms 2004 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 1 ms 1876 KB Output is correct
22 Correct 1 ms 1876 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 11944 KB Output is correct
2 Correct 98 ms 11936 KB Output is correct
3 Correct 45 ms 11804 KB Output is correct
4 Correct 85 ms 11860 KB Output is correct
5 Correct 62 ms 12108 KB Output is correct
6 Correct 65 ms 12076 KB Output is correct
7 Correct 93 ms 12156 KB Output is correct
8 Correct 84 ms 12124 KB Output is correct
9 Correct 39 ms 12032 KB Output is correct
10 Correct 54 ms 12100 KB Output is correct
11 Correct 40 ms 11988 KB Output is correct
12 Correct 55 ms 12128 KB Output is correct
13 Correct 103 ms 12044 KB Output is correct
14 Correct 82 ms 12072 KB Output is correct
15 Correct 48 ms 11992 KB Output is correct
16 Correct 104 ms 12100 KB Output is correct
17 Correct 76 ms 12132 KB Output is correct
18 Correct 80 ms 12048 KB Output is correct
19 Correct 69 ms 12048 KB Output is correct
20 Correct 65 ms 12152 KB Output is correct

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 2004 KB Output is correct
2 Correct 5 ms 2004 KB Output is correct
3 Correct 4 ms 2004 KB Output is correct
4 Correct 5 ms 2004 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct
6 Correct 5 ms 2004 KB Output is correct
7 Correct 4 ms 2004 KB Output is correct
8 Correct 4 ms 2008 KB Output is correct
9 Correct 10 ms 2004 KB Output is correct
10 Correct 10 ms 2024 KB Output is correct
11 Correct 10 ms 2004 KB Output is correct
12 Correct 10 ms 2008 KB Output is correct
13 Correct 11 ms 2024 KB Output is correct
14 Correct 6 ms 2012 KB Output is correct
15 Correct 8 ms 2004 KB Output is correct
16 Correct 6 ms 2004 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 1 ms 1876 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 2 ms 1876 KB Output is correct
21 Correct 1 ms 1876 KB Output is correct
22 Correct 1 ms 1876 KB Output is correct
23 Correct 94 ms 11944 KB Output is correct
24 Correct 98 ms 11936 KB Output is correct
25 Correct 45 ms 11804 KB Output is correct
26 Correct 85 ms 11860 KB Output is correct
27 Correct 62 ms 12108 KB Output is correct
28 Correct 65 ms 12076 KB Output is correct
29 Correct 93 ms 12156 KB Output is correct
30 Correct 84 ms 12124 KB Output is correct
31 Correct 39 ms 12032 KB Output is correct
32 Correct 54 ms 12100 KB Output is correct
33 Correct 40 ms 11988 KB Output is correct
34 Correct 55 ms 12128 KB Output is correct
35 Correct 103 ms 12044 KB Output is correct
36 Correct 82 ms 12072 KB Output is correct
37 Correct 48 ms 11992 KB Output is correct
38 Correct 104 ms 12100 KB Output is correct
39 Correct 76 ms 12132 KB Output is correct
40 Correct 80 ms 12048 KB Output is correct
41 Correct 69 ms 12048 KB Output is correct
42 Correct 65 ms 12152 KB Output is correct
43 Correct 1784 ms 10172 KB Output is correct
44 Correct 1644 ms 9088 KB Output is correct
45 Correct 1685 ms 8928 KB Output is correct
46 Correct 1736 ms 9180 KB Output is correct
47 Correct 1475 ms 9212 KB Output is correct
48 Correct 9651 ms 9108 KB Output is correct
49 Correct 9928 ms 9712 KB Output is correct
50 Correct 9069 ms 10336 KB Output is correct
51 Correct 8805 ms 10448 KB Output is correct
52 Correct 1528 ms 9940 KB Output is correct
53 Correct 2983 ms 10300 KB Output is correct
54 Execution timed out 12017 ms 10252 KB Time limit exceeded
55 Halted 0 ms 0 KB -