Submission #302147

#	Time	Username	Problem	Language	Result	Execution time	Memory
302147		edenooo	역사적 조사 (JOI14_historical)	C++17	40 / 100	4029 ms	63148 KiB

historic

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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];
ll res[100101], cost[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 (cost[B[r]]) del.push(cost[B[r]]);
			cost[B[r]] += A[r];
			pq.push(cost[B[r]]);
		}
		while(l < nl)
		{
			del.push(cost[B[l]]);
			cost[B[l]] -= A[l];
			if (cost[B[l]]) pq.push(cost[B[l]]);
			l++;
		}
		while(nl < l)
		{
			l--;
			if (cost[B[l]]) del.push(cost[B[l]]);
			cost[B[l]] += A[l];
			pq.push(cost[B[l]]);
		}
		while(nr < r)
		{
			del.push(cost[B[r]]);
			cost[B[r]] -= A[r];
			if (cost[B[r]]) pq.push(cost[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 (stderr)

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

• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 0 / 60