oj.uz

Submission #302146

# Submission time Handle Problem Language Result Execution time Memory
302146 2020-09-18T13:34:37 Z edenooo 역사적 조사 (JOI14_historical) C++17
40 / 100
 4000 ms 63060 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];
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

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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 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 512 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 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 512 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 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 17 ms 1232 KB Output is correct
19 Correct 36 ms 1404 KB Output is correct
20 Correct 91 ms 2232 KB Output is correct
21 Correct 160 ms 2292 KB Output is correct
22 Correct 147 ms 2292 KB Output is correct
23 Correct 157 ms 1900 KB Output is correct
24 Correct 159 ms 2292 KB Output is correct
25 Correct 97 ms 3808 KB Output is correct
26 Correct 114 ms 3972 KB Output is correct
27 Correct 121 ms 3940 KB Output is correct
28 Correct 105 ms 4048 KB Output is correct
29 Correct 128 ms 4096 KB Output is correct
30 Correct 134 ms 3808 KB Output is correct
31 Correct 164 ms 2292 KB Output is correct
32 Correct 150 ms 1772 KB Output is correct
33 Correct 128 ms 3812 KB Output is correct
34 Correct 115 ms 4276 KB Output is correct
35 Correct 80 ms 4692 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 288 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 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 640 KB Output is correct
8 Correct 6 ms 896 KB Output is correct
9 Correct 12 ms 1280 KB Output is correct
10 Correct 28 ms 1148 KB Output is correct
11 Correct 109 ms 5096 KB Output is correct
12 Correct 68 ms 3644 KB Output is correct
13 Correct 78 ms 3908 KB Output is correct
14 Correct 95 ms 4588 KB Output is correct
15 Correct 101 ms 5352 KB Output is correct
16 Correct 69 ms 5480 KB Output is correct
17 Correct 41 ms 4668 KB Output is correct
18 Correct 68 ms 8036 KB Output is correct
19 Correct 68 ms 7016 KB Output is correct
20 Correct 39 ms 4200 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 512 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 512 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 2 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 17 ms 1232 KB Output is correct
19 Correct 36 ms 1404 KB Output is correct
20 Correct 91 ms 2232 KB Output is correct
21 Correct 160 ms 2292 KB Output is correct
22 Correct 147 ms 2292 KB Output is correct
23 Correct 157 ms 1900 KB Output is correct
24 Correct 159 ms 2292 KB Output is correct
25 Correct 97 ms 3808 KB Output is correct
26 Correct 114 ms 3972 KB Output is correct
27 Correct 121 ms 3940 KB Output is correct
28 Correct 105 ms 4048 KB Output is correct
29 Correct 128 ms 4096 KB Output is correct
30 Correct 134 ms 3808 KB Output is correct
31 Correct 164 ms 2292 KB Output is correct
32 Correct 150 ms 1772 KB Output is correct
33 Correct 128 ms 3812 KB Output is correct
34 Correct 115 ms 4276 KB Output is correct
35 Correct 80 ms 4692 KB Output is correct
36 Correct 1 ms 288 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 384 KB Output is correct
40 Correct 2 ms 384 KB Output is correct
41 Correct 2 ms 384 KB Output is correct
42 Correct 3 ms 640 KB Output is correct
43 Correct 6 ms 896 KB Output is correct
44 Correct 12 ms 1280 KB Output is correct
45 Correct 28 ms 1148 KB Output is correct
46 Correct 109 ms 5096 KB Output is correct
47 Correct 68 ms 3644 KB Output is correct
48 Correct 78 ms 3908 KB Output is correct
49 Correct 95 ms 4588 KB Output is correct
50 Correct 101 ms 5352 KB Output is correct
51 Correct 69 ms 5480 KB Output is correct
52 Correct 41 ms 4668 KB Output is correct
53 Correct 68 ms 8036 KB Output is correct
54 Correct 68 ms 7016 KB Output is correct
55 Correct 39 ms 4200 KB Output is correct
56 Correct 377 ms 2372 KB Output is correct
57 Correct 1020 ms 7520 KB Output is correct
58 Correct 1600 ms 26312 KB Output is correct
59 Correct 2707 ms 52264 KB Output is correct
60 Correct 3213 ms 63060 KB Output is correct
61 Execution timed out 4022 ms 32124 KB Time limit exceeded
62 Halted 0 ms 0 KB -