oj.uz

답안 #595896

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595896 2022-07-14T07:56:50 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 15108 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() <= 5)
			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

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2004 KB Output is correct
2 Correct 6 ms 2048 KB Output is correct
3 Correct 5 ms 1964 KB Output is correct
4 Correct 6 ms 1960 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct
6 Correct 5 ms 2048 KB Output is correct
7 Correct 4 ms 2004 KB Output is correct
8 Correct 5 ms 2040 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct
10 Correct 5 ms 2004 KB Output is correct
11 Correct 8 ms 2004 KB Output is correct
12 Correct 9 ms 2084 KB Output is correct
13 Correct 10 ms 2044 KB Output is correct
14 Correct 8 ms 2004 KB Output is correct
15 Correct 9 ms 2048 KB Output is correct
16 Correct 4 ms 2044 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 2 ms 1876 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 1 ms 1900 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

# 결과 실행 시간 메모리 Grader output
1 Correct 94 ms 14356 KB Output is correct
2 Correct 87 ms 14376 KB Output is correct
3 Correct 60 ms 12844 KB Output is correct
4 Correct 94 ms 15108 KB Output is correct
5 Correct 72 ms 15052 KB Output is correct
6 Correct 70 ms 14984 KB Output is correct
7 Correct 79 ms 15016 KB Output is correct
8 Correct 77 ms 14992 KB Output is correct
9 Correct 45 ms 12844 KB Output is correct
10 Correct 64 ms 14292 KB Output is correct
11 Correct 41 ms 12944 KB Output is correct
12 Correct 65 ms 14380 KB Output is correct
13 Correct 95 ms 15064 KB Output is correct
14 Correct 83 ms 14296 KB Output is correct
15 Correct 44 ms 12844 KB Output is correct
16 Correct 90 ms 15052 KB Output is correct
17 Correct 71 ms 15024 KB Output is correct
18 Correct 75 ms 15088 KB Output is correct
19 Correct 68 ms 15052 KB Output is correct
20 Correct 70 ms 15016 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 2004 KB Output is correct
2 Correct 6 ms 2048 KB Output is correct
3 Correct 5 ms 1964 KB Output is correct
4 Correct 6 ms 1960 KB Output is correct
5 Correct 5 ms 2004 KB Output is correct
6 Correct 5 ms 2048 KB Output is correct
7 Correct 4 ms 2004 KB Output is correct
8 Correct 5 ms 2040 KB Output is correct
9 Correct 5 ms 2004 KB Output is correct
10 Correct 5 ms 2004 KB Output is correct
11 Correct 8 ms 2004 KB Output is correct
12 Correct 9 ms 2084 KB Output is correct
13 Correct 10 ms 2044 KB Output is correct
14 Correct 8 ms 2004 KB Output is correct
15 Correct 9 ms 2048 KB Output is correct
16 Correct 4 ms 2044 KB Output is correct
17 Correct 2 ms 1876 KB Output is correct
18 Correct 2 ms 1876 KB Output is correct
19 Correct 2 ms 1876 KB Output is correct
20 Correct 1 ms 1900 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 14356 KB Output is correct
24 Correct 87 ms 14376 KB Output is correct
25 Correct 60 ms 12844 KB Output is correct
26 Correct 94 ms 15108 KB Output is correct
27 Correct 72 ms 15052 KB Output is correct
28 Correct 70 ms 14984 KB Output is correct
29 Correct 79 ms 15016 KB Output is correct
30 Correct 77 ms 14992 KB Output is correct
31 Correct 45 ms 12844 KB Output is correct
32 Correct 64 ms 14292 KB Output is correct
33 Correct 41 ms 12944 KB Output is correct
34 Correct 65 ms 14380 KB Output is correct
35 Correct 95 ms 15064 KB Output is correct
36 Correct 83 ms 14296 KB Output is correct
37 Correct 44 ms 12844 KB Output is correct
38 Correct 90 ms 15052 KB Output is correct
39 Correct 71 ms 15024 KB Output is correct
40 Correct 75 ms 15088 KB Output is correct
41 Correct 68 ms 15052 KB Output is correct
42 Correct 70 ms 15016 KB Output is correct
43 Correct 1756 ms 11096 KB Output is correct
44 Correct 1823 ms 10256 KB Output is correct
45 Correct 1609 ms 9308 KB Output is correct
46 Correct 1647 ms 10412 KB Output is correct
47 Correct 1453 ms 10340 KB Output is correct
48 Correct 8973 ms 9960 KB Output is correct
49 Correct 9004 ms 8576 KB Output is correct
50 Correct 9247 ms 8252 KB Output is correct
51 Correct 8887 ms 8252 KB Output is correct
52 Correct 1378 ms 7924 KB Output is correct
53 Correct 2994 ms 8284 KB Output is correct
54 Execution timed out 12067 ms 8128 KB Time limit exceeded
55 Halted 0 ms 0 KB -