oj.uz

Submission #221371

# Submission time Handle Problem Language Result Execution time Memory
221371 2020-04-09T23:51:40 Z FieryPhoenix Holiday (IOI14_holiday) C++11
23 / 100
 48 ms 6368 KB 
#include <bits/stdc++.h>
using namespace std;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
typedef long double ld;
#define INF 2001001001
#define MOD 1000000007

ll ans;

ll findMaxAttraction(int N, int S, int D, int arr[]){
  {
    multiset<ll>mst;
    ll sum=0;
    for (int i=S;i<N;i++){
      mst.insert(arr[i]);
      sum+=arr[i];
      while ((int)mst.size()>D-(i-S)){
	sum-=*mst.begin();
	mst.erase(mst.find(*mst.begin()));
      }
      ans=max(ans,sum);
    }
  }
  {
    multiset<ll>mst;
    ll sum=0;
    for (int i=S;i>=0;i--){
      mst.insert(arr[i]);
      sum+=arr[i];
      while ((int)mst.size()>D-(S-i)){
	sum-=*mst.begin();
	mst.erase(mst.find(*mst.begin()));
      }
      ans=max(ans,sum);
    }
  }
  if (S==0){
    return ans;
    return 0;
  }
  return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 5624 KB Output is correct
2 Correct 35 ms 5752 KB Output is correct
3 Correct 33 ms 5624 KB Output is correct
4 Correct 35 ms 5504 KB Output is correct
5 Correct 48 ms 3960 KB Output is correct
6 Correct 15 ms 1792 KB Output is correct
7 Correct 24 ms 2560 KB Output is correct
8 Correct 28 ms 2688 KB Output is correct
9 Correct 11 ms 1408 KB Output is correct

Subtask #3
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 512 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 53.0

# Verdict Execution time Memory Grader output
1 Incorrect 48 ms 6368 KB Output isn't correct
2 Halted 0 ms 0 KB -