oj.uz

답안 #595862

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595862 2022-07-14T07:45:28 Z 장태환(#8443) Sushi (JOI16_sushi) C++17
20 / 100
 12000 ms 11580 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)
	{
		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++)
			{
				if(poss[j].q[1]>c)
					c = poss[j].up(c);
			}
			for (j = 0; j <b; j++)
			{
				if (poss[j].q[1] > c)
				c = poss[j].up(c);
			}
			
		}
		else
		{
			for (j = a; j < b; j++)
			{
				if (poss[j].q[1] > c)
				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:62:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |  for (i = 0; i < pos.size()-1; i++)
      |              ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1620 KB Output is correct
2 Correct 5 ms 1668 KB Output is correct
3 Correct 5 ms 1620 KB Output is correct
4 Correct 5 ms 1620 KB Output is correct
5 Correct 5 ms 1620 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1620 KB Output is correct
8 Correct 4 ms 1620 KB Output is correct
9 Correct 5 ms 1652 KB Output is correct
10 Correct 5 ms 1620 KB Output is correct
11 Correct 9 ms 1620 KB Output is correct
12 Correct 9 ms 1664 KB Output is correct
13 Correct 11 ms 1620 KB Output is correct
14 Correct 5 ms 1620 KB Output is correct
15 Correct 7 ms 1620 KB Output is correct
16 Correct 3 ms 1620 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 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

# 결과 실행 시간 메모리 Grader output
1 Correct 88 ms 11436 KB Output is correct
2 Correct 83 ms 11440 KB Output is correct
3 Correct 42 ms 11404 KB Output is correct
4 Correct 88 ms 11400 KB Output is correct
5 Correct 59 ms 11424 KB Output is correct
6 Correct 72 ms 11412 KB Output is correct
7 Correct 68 ms 11580 KB Output is correct
8 Correct 65 ms 11476 KB Output is correct
9 Correct 39 ms 11404 KB Output is correct
10 Correct 54 ms 11456 KB Output is correct
11 Correct 40 ms 11516 KB Output is correct
12 Correct 56 ms 11456 KB Output is correct
13 Correct 92 ms 11436 KB Output is correct
14 Correct 80 ms 11400 KB Output is correct
15 Correct 43 ms 11460 KB Output is correct
16 Correct 82 ms 11488 KB Output is correct
17 Correct 60 ms 11420 KB Output is correct
18 Correct 71 ms 11452 KB Output is correct
19 Correct 91 ms 11460 KB Output is correct
20 Correct 61 ms 11488 KB Output is correct

Subtask #3
0 / 80.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 1620 KB Output is correct
2 Correct 5 ms 1668 KB Output is correct
3 Correct 5 ms 1620 KB Output is correct
4 Correct 5 ms 1620 KB Output is correct
5 Correct 5 ms 1620 KB Output is correct
6 Correct 4 ms 1620 KB Output is correct
7 Correct 3 ms 1620 KB Output is correct
8 Correct 4 ms 1620 KB Output is correct
9 Correct 5 ms 1652 KB Output is correct
10 Correct 5 ms 1620 KB Output is correct
11 Correct 9 ms 1620 KB Output is correct
12 Correct 9 ms 1664 KB Output is correct
13 Correct 11 ms 1620 KB Output is correct
14 Correct 5 ms 1620 KB Output is correct
15 Correct 7 ms 1620 KB Output is correct
16 Correct 3 ms 1620 KB Output is correct
17 Correct 1 ms 1492 KB Output is correct
18 Correct 1 ms 1492 KB Output is correct
19 Correct 1 ms 1492 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 88 ms 11436 KB Output is correct
24 Correct 83 ms 11440 KB Output is correct
25 Correct 42 ms 11404 KB Output is correct
26 Correct 88 ms 11400 KB Output is correct
27 Correct 59 ms 11424 KB Output is correct
28 Correct 72 ms 11412 KB Output is correct
29 Correct 68 ms 11580 KB Output is correct
30 Correct 65 ms 11476 KB Output is correct
31 Correct 39 ms 11404 KB Output is correct
32 Correct 54 ms 11456 KB Output is correct
33 Correct 40 ms 11516 KB Output is correct
34 Correct 56 ms 11456 KB Output is correct
35 Correct 92 ms 11436 KB Output is correct
36 Correct 80 ms 11400 KB Output is correct
37 Correct 43 ms 11460 KB Output is correct
38 Correct 82 ms 11488 KB Output is correct
39 Correct 60 ms 11420 KB Output is correct
40 Correct 71 ms 11452 KB Output is correct
41 Correct 91 ms 11460 KB Output is correct
42 Correct 61 ms 11488 KB Output is correct
43 Correct 1367 ms 9016 KB Output is correct
44 Correct 1546 ms 9000 KB Output is correct
45 Correct 1526 ms 8704 KB Output is correct
46 Correct 1427 ms 9008 KB Output is correct
47 Correct 1215 ms 9044 KB Output is correct
48 Correct 9241 ms 9084 KB Output is correct
49 Correct 9129 ms 9044 KB Output is correct
50 Correct 9327 ms 8944 KB Output is correct
51 Correct 8907 ms 8844 KB Output is correct
52 Correct 1240 ms 7972 KB Output is correct
53 Correct 3062 ms 8916 KB Output is correct
54 Execution timed out 12081 ms 8888 KB Time limit exceeded
55 Halted 0 ms 0 KB -