oj.uz

답안 #39535

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
39535 2018-01-16T09:52:37 Z 14kg 역사적 조사 (JOI14_historical) C++11
0 / 100
 4000 ms 5832 KB 
#include <stdio.h>
#include <algorithm>
#include <set>
#include <map>
#define N 100001
#define NN 262144
#define SQ 300
#define max2(x,y) (x>y?x:y)

using namespace std;
typedef pair<pair<int, int>, int> ppi;
int n, q_len, M_len, nn, in[N];
long long tree[NN], out[N];
ppi Q[N];
set<int> S;
map<int, int> M;

bool cmp(ppi x, ppi y) {
	pair<int,int> tx = { x.first.first / SQ,x.first.second / SQ };
	pair<int,int> ty = { y.first.first / SQ,y.first.second / SQ };
	return x < y;
}
void Update(int lev) {
	tree[lev] = max2(tree[lev * 2], tree[lev * 2 + 1]);
	if (lev > 1) Update(lev / 2);
}
void Push(int x, long long num) {
	tree[nn + x - 1] += num;
	Update((nn + x - 1) / 2);
}
int main() {
	scanf("%d %d", &n, &q_len);
	for (int i = 1; i <= n; i++) scanf("%d", &in[i]), S.insert(in[i]);
	for (auto i : S) M[i] = ++M_len;

	for (nn = 1; nn < M_len; nn *= 2);
	for (int i = 1; i <= q_len; i++) {
		scanf("%d %d", &Q[i].first.first, &Q[i].first.second);
		Q[i].second = i;
	}
	sort(Q + 1, Q + q_len + 1, cmp);
	
	int l = 1, r = 0;
	for (int i = 1; i <= q_len; i++) {
		int x = Q[i].first.first, y = Q[i].first.second;
		while (r < y) Push(M[in[r + 1]], in[r + 1]), r++;
		while (l > x) Push(M[in[l - 1]], in[l - 1]), l--;
		while (r > y) Push(M[in[r]], -in[r]), r--;
		while (l < x) Push(M[in[l]], -in[l]), l++;
		out[Q[i].second] = tree[1];
	}
	for (int i = 1; i <= q_len; i++) printf("%d\n", out[i]);
}

Compilation message

historic.cpp: In function 'bool cmp(ppi, ppi)':
historic.cpp:19:16: warning: variable 'tx' set but not used [-Wunused-but-set-variable]
  pair<int,int> tx = { x.first.first / SQ,x.first.second / SQ };
                ^
historic.cpp:20:16: warning: variable 'ty' set but not used [-Wunused-but-set-variable]
  pair<int,int> ty = { y.first.first / SQ,y.first.second / SQ };
                ^
historic.cpp: In function 'int main()':
historic.cpp:52:56: warning: format '%d' expects argument of type 'int', but argument 2 has type 'long long int' [-Wformat=]
  for (int i = 1; i <= q_len; i++) printf("%d\n", out[i]);
                                                        ^
historic.cpp:32:28: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &n, &q_len);
                            ^
historic.cpp:33:67: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= n; i++) scanf("%d", &in[i]), S.insert(in[i]);
                                                                   ^
historic.cpp:38:56: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d", &Q[i].first.first, &Q[i].first.second);
                                                        ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5568 KB Output is correct
2 Incorrect 0 ms 5568 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5568 KB Output is correct
2 Correct 0 ms 5568 KB Output is correct
3 Correct 6 ms 5568 KB Output is correct
4 Incorrect 39 ms 5568 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 5568 KB Output is correct
2 Correct 0 ms 5568 KB Output is correct
3 Correct 0 ms 5568 KB Output is correct
4 Correct 0 ms 5568 KB Output is correct
5 Correct 0 ms 5700 KB Output is correct
6 Correct 0 ms 5568 KB Output is correct
7 Correct 3 ms 5700 KB Output is correct
8 Incorrect 9 ms 5832 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1203 ms 5568 KB Output is correct
2 Execution timed out 4000 ms 5700 KB Execution timed out
3 Halted 0 ms 0 KB -