oj.uz

답안 #782180

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
782180 2023-07-13T16:06:53 Z I_Love_EliskaM_ 휴가 (IOI14_holiday) C++14
47 / 100
 5000 ms 2388 KB 
#include "holiday.h"
#include <bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(x) x.begin(),x.end()
#define pi pair<int,int>
#define f first
#define s second
using ll = long long;
const int inf=1e9;

ll findMaxAttraction(int n, int s, int d, int b[]) {
  vector<int> a(n); forn(i,n) a[i]=b[i];
  ll ans=0;
  int D=d;
  for (int l=s; l>=0; --l) {
    if (!d) break;
    ll sum=0;
    priority_queue<int> q;
    for (int j=l; j<min(l+d,n); ++j) {
      sum+=a[j];
      q.push(-a[j]);
      while (q.size()+j-l > d) {
        sum+=q.top();
        q.pop();
      }
      ans=max(ans,sum);
    }
    --d;
  }
  if (s==0) return ans;
  reverse(all(a)); s=n-1-s;
  d=D;
  for (int l=s; l>=0; --l) {
    if (!d) break;
    ll sum=0;
    priority_queue<int> q;
    for (int j=l; j<min(l+d,n); ++j) {
      sum+=a[j];
      q.push(-a[j]);
      while (q.size()+j-l > d) {
        sum+=q.top();
        q.pop();
      }
      ans=max(ans,sum);
    }
    --d;
  }
  return ans;
}

Compilation message

holiday.cpp: In function 'll findMaxAttraction(int, int, int, int*)':
holiday.cpp:24:27: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   24 |       while (q.size()+j-l > d) {
      |              ~~~~~~~~~~~~~^~~
holiday.cpp:42:27: warning: comparison of integer expressions of different signedness: 'std::priority_queue<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |       while (q.size()+j-l > d) {
      |              ~~~~~~~~~~~~~^~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 692 KB Output is correct
3 Correct 1 ms 688 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 692 KB Output is correct
6 Correct 1 ms 724 KB Output is correct
7 Correct 1 ms 596 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 1872 KB Output is correct
2 Correct 8 ms 1872 KB Output is correct
3 Correct 8 ms 1872 KB Output is correct
4 Correct 7 ms 1812 KB Output is correct
5 Correct 12 ms 1700 KB Output is correct
6 Correct 3 ms 1092 KB Output is correct
7 Correct 8 ms 1340 KB Output is correct
8 Correct 9 ms 1504 KB Output is correct
9 Correct 2 ms 980 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 108 ms 740 KB Output is correct
2 Correct 22 ms 744 KB Output is correct
3 Correct 37 ms 724 KB Output is correct
4 Correct 278 ms 724 KB Output is correct
5 Correct 216 ms 724 KB Output is correct
6 Correct 15 ms 596 KB Output is correct
7 Correct 12 ms 596 KB Output is correct
8 Correct 15 ms 688 KB Output is correct
9 Correct 21 ms 692 KB Output is correct

Subtask #4
0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 5068 ms 2388 KB Time limit exceeded
2 Halted 0 ms 0 KB -