oj.uz

답안 #715764

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
715764 2023-03-27T19:34:48 Z epicci23 Let's Win the Election (JOI22_ho_t3) C++17
16 / 100
 1047 ms 8280 KB 
#include "bits/stdc++.h"
#pragma optimize ("Bismillahirrahmanirrahim")
using namespace std;
#define pb push_back
#define ff first
#define ss second
#define endl "\n" 
#define int long long
#define double long double
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define what_is(x) cerr << #x << " is " << x << endl;
//#define m (l+r)/2
constexpr int N=200005;
constexpr int MOD=1000000007;
constexpr int  INF2 = LLONG_MAX;
constexpr double INF=(double)1e14;
constexpr int LOG=30;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tp;
typedef priority_queue<pii,vector<pii>,greater<pii>> min_pq;
typedef priority_queue<pii> max_pq;
typedef long long ll;
//to think//
/*
 * graph approach
 * dp
 * dividing the problem to smaller statements
 * finding the real constraint
 * sqrt decomposition
 * greedy approach
 * pigeonhole principle
 * rewriting the problem/equality 
 * bitwise approaches
 * binary search if monotonic
 * divide and conquer
 * combinatorics
 * inclusion - exclusion
 * think like bfs
*/



inline int in()
{
  int x;cin >> x;
  return x;
}

inline string in2()
{
  string x;cin >> x;
  return x;
}


void solve()
{
  int n=in(),k=in();
  vector<array<double,2>> v(n);
  for(int i=0;i<n;i++)
  {
    v[i][1]=in(),v[i][0]=in();
    if(v[i][0]==-1) v[i][0]=INF;
  }
  sort(all(v));

  double suf[n+2][n+1];
  
  double ans=INF;
  multiset<double> cur;

  for(int i=n-1;i>=0;i--)
  {
    double pre=0;
    cur.insert(v[i][1]);
    int p=0;
    suf[i][0]=pre;
    for(int j:cur)
    {
      pre+=j;
      suf[i][++p]=pre;
    }
    for(int j=p+1;j<=n;j++) suf[i][j]=INF;
  }

  for(int i=0;i<=n;i++) suf[n+1][i]=0.0;
  
  ans=min(ans,(double)suf[0][k]); 
  for(int goal=1;goal<=k;goal++)
  {
    double dp[n+2][goal+2];

    for(int j=0;j<=n;j++)
      for(int i=0;i<=goal;i++)
       dp[j][i]=INF;

    dp[0][0]=0.0;
    double bol=goal;
    for(int i=1;i<=n;i++)
    {
      for(int j=0;j<=goal;j++)
      {
        dp[i][j]=min(dp[i-1][j]+v[i-1][1]/(bol+1.0),dp[i][j]);
        if(j>0) dp[i][j]=min(dp[i][j],dp[i-1][j-1]+v[i-1][0]/(j*1.0));
      }
    }
    for(int i=1;i<=k;i++) ans=min(ans,dp[i][goal]+suf[i+1][k-i]/(bol+1.0));
  }

  cout << ans << endl;
}

int32_t main(){
   

     cin.tie(0); ios::sync_with_stdio(0);
     cout << fixed <<  setprecision(15);
   
   int t=1;//cin>> t;
 
 for(int i=1;i<=t;i++)
 {
  //  cout << "Case #" << i << ": ";
    solve();
 }
 
 return 0;
}

Compilation message

Main.cpp:2: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    2 | #pragma optimize ("Bismillahirrahmanirrahim")
      |

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 18 ms 4676 KB Output is correct
6 Correct 79 ms 5276 KB Output is correct
7 Correct 263 ms 6244 KB Output is correct
8 Correct 587 ms 7232 KB Output is correct
9 Correct 1002 ms 8228 KB Output is correct
10 Correct 504 ms 7128 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 18 ms 4676 KB Output is correct
6 Correct 79 ms 5276 KB Output is correct
7 Correct 263 ms 6244 KB Output is correct
8 Correct 587 ms 7232 KB Output is correct
9 Correct 1002 ms 8228 KB Output is correct
10 Correct 504 ms 7128 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 111 ms 5428 KB Output is correct
13 Correct 99 ms 5344 KB Output is correct
14 Correct 94 ms 5452 KB Output is correct
15 Correct 506 ms 7108 KB Output is correct
16 Correct 487 ms 7032 KB Output is correct
17 Correct 518 ms 7012 KB Output is correct
18 Incorrect 1047 ms 8220 KB Output isn't correct
19 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 260 KB Output is correct
25 Incorrect 1 ms 212 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 336 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 256 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 260 KB Output is correct
25 Incorrect 1 ms 212 KB Output isn't correct
26 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 18 ms 4676 KB Output is correct
6 Correct 79 ms 5276 KB Output is correct
7 Correct 263 ms 6244 KB Output is correct
8 Correct 587 ms 7232 KB Output is correct
9 Correct 1002 ms 8228 KB Output is correct
10 Correct 504 ms 7128 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 111 ms 5428 KB Output is correct
13 Correct 99 ms 5344 KB Output is correct
14 Correct 94 ms 5452 KB Output is correct
15 Correct 506 ms 7108 KB Output is correct
16 Correct 487 ms 7032 KB Output is correct
17 Correct 518 ms 7012 KB Output is correct
18 Incorrect 1047 ms 8220 KB Output isn't correct
19 Halted 0 ms 0 KB -