oj.uz

Submission #595859

# Submission time Handle Problem Language Result Execution time Memory
595859 2022-07-14T07:44:03 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 12164 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:
		i <<= 1;
		i += q[i] <= q[i+ 1];
		if (q[i] <= n)
		{
			q[i >> 1] = n;
			return rv;
		}
		q[i >> 1] = q[i];
		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:66:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  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 1652 KB Output is correct
3 Correct 14 ms 1704 KB Output is correct
4 Correct 6 ms 1652 KB Output is correct
5 Correct 5 ms 1648 KB Output is correct
6 Correct 7 ms 1652 KB Output is correct
7 Correct 4 ms 1620 KB Output is correct
8 Correct 4 ms 1624 KB Output is correct
9 Correct 5 ms 1620 KB Output is correct
10 Correct 4 ms 1648 KB Output is correct
11 Correct 11 ms 1648 KB Output is correct
12 Correct 10 ms 1620 KB Output is correct
13 Correct 11 ms 1620 KB Output is correct
14 Correct 6 ms 1648 KB Output is correct
15 Correct 8 ms 1652 KB Output is correct
16 Correct 4 ms 1700 KB Output is correct
17 Correct 2 ms 1540 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 2 ms 1512 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 94 ms 12164 KB Output is correct
2 Correct 81 ms 11912 KB Output is correct
3 Correct 43 ms 11756 KB Output is correct
4 Correct 95 ms 11912 KB Output is correct
5 Correct 66 ms 11916 KB Output is correct
6 Correct 67 ms 11920 KB Output is correct
7 Correct 67 ms 11980 KB Output is correct
8 Correct 87 ms 11908 KB Output is correct
9 Correct 41 ms 11448 KB Output is correct
10 Correct 53 ms 11916 KB Output is correct
11 Correct 44 ms 11708 KB Output is correct
12 Correct 59 ms 11916 KB Output is correct
13 Correct 98 ms 11912 KB Output is correct
14 Correct 78 ms 12004 KB Output is correct
15 Correct 44 ms 11648 KB Output is correct
16 Correct 98 ms 11916 KB Output is correct
17 Correct 70 ms 11944 KB Output is correct
18 Correct 73 ms 11980 KB Output is correct
19 Correct 68 ms 11912 KB Output is correct
20 Correct 77 ms 11952 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 1652 KB Output is correct
3 Correct 14 ms 1704 KB Output is correct
4 Correct 6 ms 1652 KB Output is correct
5 Correct 5 ms 1648 KB Output is correct
6 Correct 7 ms 1652 KB Output is correct
7 Correct 4 ms 1620 KB Output is correct
8 Correct 4 ms 1624 KB Output is correct
9 Correct 5 ms 1620 KB Output is correct
10 Correct 4 ms 1648 KB Output is correct
11 Correct 11 ms 1648 KB Output is correct
12 Correct 10 ms 1620 KB Output is correct
13 Correct 11 ms 1620 KB Output is correct
14 Correct 6 ms 1648 KB Output is correct
15 Correct 8 ms 1652 KB Output is correct
16 Correct 4 ms 1700 KB Output is correct
17 Correct 2 ms 1540 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 2 ms 1512 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 94 ms 12164 KB Output is correct
24 Correct 81 ms 11912 KB Output is correct
25 Correct 43 ms 11756 KB Output is correct
26 Correct 95 ms 11912 KB Output is correct
27 Correct 66 ms 11916 KB Output is correct
28 Correct 67 ms 11920 KB Output is correct
29 Correct 67 ms 11980 KB Output is correct
30 Correct 87 ms 11908 KB Output is correct
31 Correct 41 ms 11448 KB Output is correct
32 Correct 53 ms 11916 KB Output is correct
33 Correct 44 ms 11708 KB Output is correct
34 Correct 59 ms 11916 KB Output is correct
35 Correct 98 ms 11912 KB Output is correct
36 Correct 78 ms 12004 KB Output is correct
37 Correct 44 ms 11648 KB Output is correct
38 Correct 98 ms 11916 KB Output is correct
39 Correct 70 ms 11944 KB Output is correct
40 Correct 73 ms 11980 KB Output is correct
41 Correct 68 ms 11912 KB Output is correct
42 Correct 77 ms 11952 KB Output is correct
43 Correct 1861 ms 9360 KB Output is correct
44 Correct 1715 ms 9160 KB Output is correct
45 Correct 1944 ms 8984 KB Output is correct
46 Correct 2015 ms 9196 KB Output is correct
47 Correct 2512 ms 9272 KB Output is correct
48 Correct 10807 ms 9152 KB Output is correct
49 Correct 9922 ms 9276 KB Output is correct
50 Correct 9447 ms 9096 KB Output is correct
51 Correct 9832 ms 9144 KB Output is correct
52 Correct 1681 ms 8200 KB Output is correct
53 Correct 3695 ms 9064 KB Output is correct
54 Execution timed out 12092 ms 9120 KB Time limit exceeded
55 Halted 0 ms 0 KB -