oj.uz

답안 #595930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595930 2022-07-14T08:10:27 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 11828 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
vector<int>pos;
int arr[400100];
struct pq
{
	int* q;
	void init(vector<int>v)
	{
		q = (int*)calloc(v.size() * 2 + 3, sizeof(int));
		int i;
		for (i = 0; i < v.size(); i++)
			q[i + 1] = v[i];
	}
	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:15:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |   for (i = 0; i < v.size(); i++)
      |               ~~^~~~~~~~~~
sushi.cpp: In function 'int main()':
sushi.cpp:80:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |  for (i = 0; i < pos.size() - 1; i++)
      |              ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Correct 6 ms 468 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 7 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 36 ms 468 KB Output is correct
11 Correct 8 ms 468 KB Output is correct
12 Correct 8 ms 480 KB Output is correct
13 Correct 9 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 4 ms 212 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 99 ms 7148 KB Output is correct
2 Correct 76 ms 7152 KB Output is correct
3 Correct 38 ms 7152 KB Output is correct
4 Correct 99 ms 7148 KB Output is correct
5 Correct 75 ms 7152 KB Output is correct
6 Correct 65 ms 7180 KB Output is correct
7 Correct 58 ms 7104 KB Output is correct
8 Correct 59 ms 7132 KB Output is correct
9 Correct 38 ms 7164 KB Output is correct
10 Correct 53 ms 7148 KB Output is correct
11 Correct 37 ms 7148 KB Output is correct
12 Correct 56 ms 7152 KB Output is correct
13 Correct 104 ms 7156 KB Output is correct
14 Correct 83 ms 7092 KB Output is correct
15 Correct 37 ms 7148 KB Output is correct
16 Correct 81 ms 7152 KB Output is correct
17 Correct 61 ms 7148 KB Output is correct
18 Correct 58 ms 7244 KB Output is correct
19 Correct 63 ms 7104 KB Output is correct
20 Correct 60 ms 7156 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 468 KB Output is correct
2 Correct 6 ms 468 KB Output is correct
3 Correct 6 ms 468 KB Output is correct
4 Correct 5 ms 468 KB Output is correct
5 Correct 4 ms 468 KB Output is correct
6 Correct 5 ms 468 KB Output is correct
7 Correct 7 ms 468 KB Output is correct
8 Correct 3 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 36 ms 468 KB Output is correct
11 Correct 8 ms 468 KB Output is correct
12 Correct 8 ms 480 KB Output is correct
13 Correct 9 ms 468 KB Output is correct
14 Correct 5 ms 468 KB Output is correct
15 Correct 6 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 4 ms 212 KB Output is correct
21 Correct 4 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 99 ms 7148 KB Output is correct
24 Correct 76 ms 7152 KB Output is correct
25 Correct 38 ms 7152 KB Output is correct
26 Correct 99 ms 7148 KB Output is correct
27 Correct 75 ms 7152 KB Output is correct
28 Correct 65 ms 7180 KB Output is correct
29 Correct 58 ms 7104 KB Output is correct
30 Correct 59 ms 7132 KB Output is correct
31 Correct 38 ms 7164 KB Output is correct
32 Correct 53 ms 7148 KB Output is correct
33 Correct 37 ms 7148 KB Output is correct
34 Correct 56 ms 7152 KB Output is correct
35 Correct 104 ms 7156 KB Output is correct
36 Correct 83 ms 7092 KB Output is correct
37 Correct 37 ms 7148 KB Output is correct
38 Correct 81 ms 7152 KB Output is correct
39 Correct 61 ms 7148 KB Output is correct
40 Correct 58 ms 7244 KB Output is correct
41 Correct 63 ms 7104 KB Output is correct
42 Correct 60 ms 7156 KB Output is correct
43 Correct 1124 ms 7360 KB Output is correct
44 Correct 1184 ms 7520 KB Output is correct
45 Correct 1223 ms 7192 KB Output is correct
46 Correct 1490 ms 7332 KB Output is correct
47 Correct 1352 ms 7472 KB Output is correct
48 Correct 8358 ms 7400 KB Output is correct
49 Correct 8426 ms 7384 KB Output is correct
50 Correct 7864 ms 7408 KB Output is correct
51 Correct 8817 ms 7292 KB Output is correct
52 Correct 1543 ms 6576 KB Output is correct
53 Correct 2470 ms 7312 KB Output is correct
54 Correct 11825 ms 7308 KB Output is correct
55 Execution timed out 12066 ms 11828 KB Time limit exceeded
56 Halted 0 ms 0 KB -