oj.uz

답안 #302130

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
302130 2020-09-18T13:17:09 Z edenooo 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 63112 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define INF 1234567890
#define ll long long

const int SQ = 316;
struct Node {
	int l, r, i;
	bool operator<(Node &n)
	{
		if (l/SQ != n.l/SQ) return l/SQ < n.l/SQ;
		return r < n.r;
	}
};

int N, Q;
int A[100101], B[100101], cnt[100101];
ll res[100101];
vector<Node> q;
priority_queue<ll> pq, del;
vector<int> com;

int main()
{
	scanf("%d %d", &N, &Q);
	for(int i=1; i<=N; i++)
	{
		scanf("%d", &A[i]);
		com.push_back(A[i]);
	}
	// 좌표 압축
	sort(com.begin(), com.end());
	com.erase(unique(com.begin(), com.end()), com.end());
	for(int i=1; i<=N; i++)
		B[i] = lower_bound(com.begin(), com.end(), A[i]) - com.begin();

	// 오프라인 쿼리
	for(int i=1; i<=Q; i++)
	{
		int l, r;
		scanf("%d %d", &l, &r);
		q.push_back({l, r, i});
	}
	sort(q.begin(), q.end());

	// MO's
	int l = 1, r = 0; // [l, r]
	for(int i=0; i<q.size(); i++)
	{
		int nl = q[i].l, nr = q[i].r, idx = q[i].i;
		while(r < nr)
		{
			r++;
			if (cnt[B[r]]) del.push((ll)A[r]*cnt[B[r]]);
			cnt[B[r]]++;
			pq.push((ll)A[r]*cnt[B[r]]);
		}
		while(l < nl)
		{
			del.push((ll)A[l]*cnt[B[l]]);
			cnt[B[l]]--;
			if (cnt[B[l]]) pq.push((ll)A[l]*cnt[B[l]]);
			l++;
		}
		while(nl < l)
		{
			l--;
			if (cnt[B[l]]) del.push((ll)A[l]*cnt[B[l]]);
			cnt[B[l]]++;
			pq.push((ll)A[l]*cnt[B[l]]);
		}
		while(nr < r)
		{
			del.push((ll)A[r]*cnt[B[r]]);
			cnt[B[r]]--;
			if (cnt[B[r]]) pq.push((ll)A[r]*cnt[B[r]]);
			r--;
		}

		while(!pq.empty() && !del.empty() && pq.top() == del.top())
			pq.pop(), del.pop();
		// 구간이 비는 경우는 없다.
		res[idx] = pq.top();
	}

	for(int i=1; i<=Q; i++)
		printf("%lld\n", res[i]);
	return 0;
}

Compilation message

historic.cpp: In function 'int main()':
historic.cpp:49:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<Node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   49 |  for(int i=0; i<q.size(); i++)
      |               ~^~~~~~~~~
historic.cpp:26:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |  scanf("%d %d", &N, &Q);
      |  ~~~~~^~~~~~~~~~~~~~~~~
historic.cpp:29:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   29 |   scanf("%d", &A[i]);
      |   ~~~~~^~~~~~~~~~~~~
historic.cpp:42:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   42 |   scanf("%d %d", &l, &r);
      |   ~~~~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 16 ms 1232 KB Output is correct
19 Correct 43 ms 1404 KB Output is correct
20 Correct 104 ms 2360 KB Output is correct
21 Correct 165 ms 2292 KB Output is correct
22 Correct 159 ms 2292 KB Output is correct
23 Correct 163 ms 2028 KB Output is correct
24 Correct 161 ms 2292 KB Output is correct
25 Correct 102 ms 3812 KB Output is correct
26 Correct 120 ms 4188 KB Output is correct
27 Correct 127 ms 3808 KB Output is correct
28 Correct 110 ms 4192 KB Output is correct
29 Correct 132 ms 3920 KB Output is correct
30 Correct 147 ms 3808 KB Output is correct
31 Correct 167 ms 2292 KB Output is correct
32 Correct 146 ms 1652 KB Output is correct
33 Correct 132 ms 3812 KB Output is correct
34 Correct 119 ms 4176 KB Output is correct
35 Correct 82 ms 4560 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 512 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 512 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 4 ms 640 KB Output is correct
8 Correct 6 ms 896 KB Output is correct
9 Correct 13 ms 1280 KB Output is correct
10 Correct 29 ms 1148 KB Output is correct
11 Correct 114 ms 4972 KB Output is correct
12 Correct 72 ms 3644 KB Output is correct
13 Correct 79 ms 3900 KB Output is correct
14 Correct 102 ms 4460 KB Output is correct
15 Correct 105 ms 5096 KB Output is correct
16 Correct 70 ms 5096 KB Output is correct
17 Correct 42 ms 4668 KB Output is correct
18 Correct 72 ms 8144 KB Output is correct
19 Correct 69 ms 6624 KB Output is correct
20 Correct 39 ms 3692 KB Output is correct

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 1 ms 416 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 7 ms 640 KB Output is correct
18 Correct 16 ms 1232 KB Output is correct
19 Correct 43 ms 1404 KB Output is correct
20 Correct 104 ms 2360 KB Output is correct
21 Correct 165 ms 2292 KB Output is correct
22 Correct 159 ms 2292 KB Output is correct
23 Correct 163 ms 2028 KB Output is correct
24 Correct 161 ms 2292 KB Output is correct
25 Correct 102 ms 3812 KB Output is correct
26 Correct 120 ms 4188 KB Output is correct
27 Correct 127 ms 3808 KB Output is correct
28 Correct 110 ms 4192 KB Output is correct
29 Correct 132 ms 3920 KB Output is correct
30 Correct 147 ms 3808 KB Output is correct
31 Correct 167 ms 2292 KB Output is correct
32 Correct 146 ms 1652 KB Output is correct
33 Correct 132 ms 3812 KB Output is correct
34 Correct 119 ms 4176 KB Output is correct
35 Correct 82 ms 4560 KB Output is correct
36 Correct 1 ms 512 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 512 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 4 ms 640 KB Output is correct
43 Correct 6 ms 896 KB Output is correct
44 Correct 13 ms 1280 KB Output is correct
45 Correct 29 ms 1148 KB Output is correct
46 Correct 114 ms 4972 KB Output is correct
47 Correct 72 ms 3644 KB Output is correct
48 Correct 79 ms 3900 KB Output is correct
49 Correct 102 ms 4460 KB Output is correct
50 Correct 105 ms 5096 KB Output is correct
51 Correct 70 ms 5096 KB Output is correct
52 Correct 42 ms 4668 KB Output is correct
53 Correct 72 ms 8144 KB Output is correct
54 Correct 69 ms 6624 KB Output is correct
55 Correct 39 ms 3692 KB Output is correct
56 Correct 399 ms 2372 KB Output is correct
57 Correct 1057 ms 7632 KB Output is correct
58 Correct 1629 ms 26268 KB Output is correct
59 Correct 2810 ms 51916 KB Output is correct
60 Correct 3309 ms 63112 KB Output is correct
61 Execution timed out 4030 ms 30700 KB Time limit exceeded
62 Halted 0 ms 0 KB -