oj.uz

답안 #596133

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
596133 2022-07-14T12:06:24 Z jjang36524 Sushi (JOI16_sushi) C++14
20 / 100
 12000 ms 11876 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 (max(q[i * 2 + 1],q[i*2]) <= n)
		{
			q[i] = n;
			return rv;
		}
		if (q[i * 2] <= q[i * 2 + 1])
		{
			q[i] = q[i * 2 + 1];
			i = i * 2 + 1;
		}
		else
		{
			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:75:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   75 |  for (i = 0; i < pos.size() - 1; i++)
      |              ~~^~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 4 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 504 KB Output is correct
6 Correct 4 ms 392 KB Output is correct
7 Correct 5 ms 472 KB Output is correct
8 Correct 3 ms 432 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 8 ms 524 KB Output is correct
12 Correct 7 ms 464 KB Output is correct
13 Correct 11 ms 468 KB Output is correct
14 Correct 5 ms 524 KB Output is correct
15 Correct 7 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 276 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 340 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 11448 KB Output is correct
2 Correct 76 ms 10172 KB Output is correct
3 Correct 37 ms 8208 KB Output is correct
4 Correct 82 ms 11528 KB Output is correct
5 Correct 58 ms 11520 KB Output is correct
6 Correct 66 ms 11500 KB Output is correct
7 Correct 72 ms 11544 KB Output is correct
8 Correct 59 ms 11584 KB Output is correct
9 Correct 38 ms 8172 KB Output is correct
10 Correct 49 ms 10104 KB Output is correct
11 Correct 32 ms 8200 KB Output is correct
12 Correct 50 ms 10124 KB Output is correct
13 Correct 84 ms 11504 KB Output is correct
14 Correct 79 ms 10220 KB Output is correct
15 Correct 37 ms 8152 KB Output is correct
16 Correct 88 ms 11524 KB Output is correct
17 Correct 58 ms 11464 KB Output is correct
18 Correct 62 ms 11584 KB Output is correct
19 Correct 64 ms 11468 KB Output is correct
20 Correct 68 ms 11456 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 468 KB Output is correct
2 Correct 4 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 504 KB Output is correct
6 Correct 4 ms 392 KB Output is correct
7 Correct 5 ms 472 KB Output is correct
8 Correct 3 ms 432 KB Output is correct
9 Correct 4 ms 468 KB Output is correct
10 Correct 5 ms 596 KB Output is correct
11 Correct 8 ms 524 KB Output is correct
12 Correct 7 ms 464 KB Output is correct
13 Correct 11 ms 468 KB Output is correct
14 Correct 5 ms 524 KB Output is correct
15 Correct 7 ms 468 KB Output is correct
16 Correct 2 ms 468 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 276 KB Output is correct
21 Correct 1 ms 324 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 87 ms 11448 KB Output is correct
24 Correct 76 ms 10172 KB Output is correct
25 Correct 37 ms 8208 KB Output is correct
26 Correct 82 ms 11528 KB Output is correct
27 Correct 58 ms 11520 KB Output is correct
28 Correct 66 ms 11500 KB Output is correct
29 Correct 72 ms 11544 KB Output is correct
30 Correct 59 ms 11584 KB Output is correct
31 Correct 38 ms 8172 KB Output is correct
32 Correct 49 ms 10104 KB Output is correct
33 Correct 32 ms 8200 KB Output is correct
34 Correct 50 ms 10124 KB Output is correct
35 Correct 84 ms 11504 KB Output is correct
36 Correct 79 ms 10220 KB Output is correct
37 Correct 37 ms 8152 KB Output is correct
38 Correct 88 ms 11524 KB Output is correct
39 Correct 58 ms 11464 KB Output is correct
40 Correct 62 ms 11584 KB Output is correct
41 Correct 64 ms 11468 KB Output is correct
42 Correct 68 ms 11456 KB Output is correct
43 Correct 1178 ms 11876 KB Output is correct
44 Correct 1163 ms 11036 KB Output is correct
45 Correct 951 ms 8484 KB Output is correct
46 Correct 1139 ms 11088 KB Output is correct
47 Correct 1164 ms 10912 KB Output is correct
48 Correct 7778 ms 10972 KB Output is correct
49 Correct 7707 ms 10556 KB Output is correct
50 Correct 7663 ms 10396 KB Output is correct
51 Correct 7758 ms 10488 KB Output is correct
52 Correct 1275 ms 9560 KB Output is correct
53 Correct 2182 ms 10240 KB Output is correct
54 Correct 11810 ms 10412 KB Output is correct
55 Correct 11962 ms 8708 KB Output is correct
56 Execution timed out 12061 ms 11820 KB Time limit exceeded
57 Halted 0 ms 0 KB -