oj.uz

답안 #15838

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
15838 2015-07-30T15:21:23 Z myungwoo 휴가 (IOI14_holiday) C++14
23 / 100
 22 ms 3152 KB 
#include <bits/stdc++.h>
using namespace std;

#define MAXN 100005
typedef long long lld;

static int N, S, T;
static int A[MAXN];

lld findMaxAttraction(int n, int start, int d, int arr[])
{
	if (start) return 0;
	N = n; S = start; T = d;
	for (int i=1;i<=N;i++) A[i] = arr[i-1];
	priority_queue <int> que;
	int left = T;
	lld ret = 0, sum = 0;
	for (int i=1;i<=N;i++){
		if (!left){
			if (que.empty()) break;
			int q = que.top(); que.pop();
			sum += q;
			left++;
		}
		sum += A[i];
		que.push(-A[i]);
		left--;
		ret = max(ret, sum);
		if (!left){
			if (que.empty()) break;
			int q = que.top(); que.pop();
			sum += q;
			left++;
		}
		left--;
	}
	return ret;
}

Subtask #1
0.0 / 7.0

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

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 3152 KB Output is correct
2 Correct 10 ms 3148 KB Output is correct
3 Correct 7 ms 3148 KB Output is correct
4 Correct 14 ms 3148 KB Output is correct
5 Correct 22 ms 2764 KB Output is correct
6 Correct 0 ms 2508 KB Output is correct
7 Correct 8 ms 2764 KB Output is correct
8 Correct 15 ms 2768 KB Output is correct
9 Correct 0 ms 2508 KB Output is correct

Subtask #3
0.0 / 17.0

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

Subtask #4
0.0 / 53.0

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