oj.uz

답안 #971439

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
971439 2024-04-28T13:53:16 Z mychecksedad Feast (NOI19_feast) C++17
10 / 100
 114 ms 18020 KB 
/* Author : Mychecksdead  */
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define pb push_back
#define all(x) x.begin(), x.end()
#define en cout << '\n'
const int N = 1e6+100, M = 1e5+10, K = 52, MX = 30;
const double eps = 0.00001;

int n, k;
ll a[N];
pair<double, int> dp[N][2];
pair<double, int> f(double lambda){
  dp[1][0] = {0, 0};
  dp[1][1] = {a[1] - lambda, 1};
  for(int i = 2; i <= n; ++i){
    dp[i][0] = max(dp[i - 1][0], dp[i - 1][1]);
    dp[i][1] = max(pair<double,int>{dp[i - 1][0].first + a[i] - lambda, dp[i - 1][0].second + 1}, pair<double,int>{dp[i - 1][1].first + a[i], dp[i - 1][1].second});
  }
  // cout << dp[1][1].first << ' ';
  return max(dp[n][0], dp[n][1]);
}
void solve(){
  cin >> n >> k;
  for(int i = 1; i <= n; ++i) cin >> a[i];
  double l = 0, r = 1e10, lambda = 0;
  while(l + eps < r){
    double m = (l+r)/2;
    if(f(m).second <= k){
      lambda = m;
      r = m;
    }else{
      l = m;
    }
  }

  // cout << f(lambda).second << ' ';

  cout << (ll)(f(lambda).first + lambda * k);
}


int main(){
  cin.tie(0); ios::sync_with_stdio(0);
  int tt = 1, aa;
  // freopen("in.txt", "r", stdin);
  // freopen("out.txt", "w", stdout);
  while(tt--){
    solve();
    en;
  }
  cerr<<"time taken : "<<(float)clock()/CLOCKS_PER_SEC<<" seconds\n";
  return 0;
}

Compilation message

feast.cpp: In function 'int main()':
feast.cpp:48:15: warning: unused variable 'aa' [-Wunused-variable]
   48 |   int tt = 1, aa;
      |               ^~

Subtask #1
0 / 4.0

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

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 68 ms 16108 KB Output is correct
2 Correct 71 ms 15956 KB Output is correct
3 Correct 70 ms 15956 KB Output is correct
4 Incorrect 72 ms 15952 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

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

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2516 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct

Subtask #5
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2516 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 1 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2516 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2392 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2648 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Incorrect 1 ms 2396 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #7
0 / 29.0

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