oj.uz

Submission #199536

# Submission time Handle Problem Language Result Execution time Memory
199536 2020-02-02T02:02:41 Z arnold518 역사적 조사 (JOI14_historical) C++14
40 / 100
 4000 ms 6100 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAXN = 1e5;
const int SQ = 100;

int N, Q, A[MAXN+10], B[MAXN+10], S;
vector<int> comp;

struct Query
{
	int l, r, p;
	bool operator < (const Query &p)
	{
		if(l/SQ==p.l/SQ) return r<p.r;
		return l/SQ<p.l/SQ;
	}
};

Query query[MAXN+10];

ll tree[MAXN*4+10], ans[MAXN+10];
void update(int node, int tl, int tr, int pos, ll val)
{
	if(tl==tr) { tree[node]+=val; return; }
	int mid=tl+tr>>1;
	if(pos<=mid) update(node*2, tl, mid, pos, val);
	else update(node*2+1, mid+1, tr, pos, val);
	tree[node]=max(tree[node*2], tree[node*2+1]);
}
ll qquery() { return tree[1]; }

void push(int x) { update(1, 1, S, B[x], A[x]); }
void pop(int x) { update(1, 1, S, B[x], -A[x]); }

int main()
{
	int i, j;

	scanf("%d%d", &N, &Q);
	for(i=1; i<=N; i++) scanf("%d", &A[i]), comp.push_back(A[i]);
	sort(comp.begin(), comp.end());
	comp.erase(unique(comp.begin(), comp.end()), comp.end()); S=comp.size();
	for(i=1; i<=N; i++) B[i]=lower_bound(comp.begin(), comp.end(), A[i])-comp.begin()+1;
	for(i=1; i<=Q; i++) scanf("%d%d", &query[i].l, &query[i].r), query[i].p=i;
	sort(query+1, query+Q+1);

	int l=1, r=1; push(1);
	for(i=1; i<=Q; i++)
	{
		while(r<query[i].r) r++, push(r);
		while(l>query[i].l) l--, push(l);
		while(r>query[i].r) pop(r), r--;
		while(l<query[i].l) pop(l), l++;
		ans[query[i].p]=qquery();
	}
	for(i=1; i<=Q; i++) printf("%lld\n", ans[i]);
}

Compilation message

historic.cpp: In function 'void update(int, int, int, int, ll)':
historic.cpp:30:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  int mid=tl+tr>>1;
          ~~^~~
historic.cpp: In function 'int main()':
historic.cpp:42:9: warning: unused variable 'j' [-Wunused-variable]
  int i, j;
         ^
historic.cpp:44:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &N, &Q);
  ~~~~~^~~~~~~~~~~~~~~~
historic.cpp:45:40: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=N; i++) scanf("%d", &A[i]), comp.push_back(A[i]);
                      ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
historic.cpp:49:61: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for(i=1; i<=Q; i++) scanf("%d%d", &query[i].l, &query[i].r), query[i].p=i;
                      ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 5 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 6 ms 376 KB Output is correct
3 Correct 8 ms 376 KB Output is correct
4 Correct 11 ms 380 KB Output is correct
5 Correct 21 ms 504 KB Output is correct
6 Correct 34 ms 504 KB Output is correct
7 Correct 38 ms 504 KB Output is correct
8 Correct 45 ms 504 KB Output is correct
9 Correct 26 ms 504 KB Output is correct
10 Correct 50 ms 632 KB Output is correct
11 Correct 49 ms 632 KB Output is correct
12 Correct 49 ms 632 KB Output is correct
13 Correct 48 ms 632 KB Output is correct
14 Correct 46 ms 632 KB Output is correct
15 Correct 47 ms 632 KB Output is correct
16 Correct 29 ms 632 KB Output is correct
17 Correct 15 ms 632 KB Output is correct
18 Correct 50 ms 632 KB Output is correct
19 Correct 51 ms 632 KB Output is correct
20 Correct 52 ms 632 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 380 KB Output is correct
5 Correct 6 ms 376 KB Output is correct
6 Correct 6 ms 376 KB Output is correct
7 Correct 8 ms 504 KB Output is correct
8 Correct 12 ms 632 KB Output is correct
9 Correct 25 ms 888 KB Output is correct
10 Correct 14 ms 1140 KB Output is correct
11 Correct 79 ms 3952 KB Output is correct
12 Correct 50 ms 1648 KB Output is correct
13 Correct 79 ms 2288 KB Output is correct
14 Correct 112 ms 4208 KB Output is correct
15 Correct 143 ms 5616 KB Output is correct
16 Correct 96 ms 5232 KB Output is correct
17 Correct 45 ms 2416 KB Output is correct
18 Correct 72 ms 3824 KB Output is correct
19 Correct 82 ms 6100 KB Output is correct
20 Correct 55 ms 4336 KB Output is correct

Subtask #4
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 760 KB Output is correct
2 Correct 458 ms 1300 KB Output is correct
3 Correct 1315 ms 1784 KB Output is correct
4 Correct 2498 ms 2296 KB Output is correct
5 Correct 3871 ms 2732 KB Output is correct
6 Execution timed out 4073 ms 2548 KB Time limit exceeded
7 Halted 0 ms 0 KB -