oj.uz

답안 #937342

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937342 2024-03-03T23:46:26 Z Marco_Escandon Let's Win the Election (JOI22_ho_t3) C++11
56 / 100
 2500 ms 6668 KB 
#include<bits/stdc++.h>
#define optimizar_io ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);cout.setf(ios::fixed);cout.precision(15);
#pragma GCC optimize("Ofast")
using namespace std;
typedef long long ll;
#define x first
#define y second
pair<double,double> cad[501];
double sol(ll l,ll n,ll m)
{
    vector<vector<vector<double>>> dp(2,vector<vector<double>>(m+3,vector<double>(m+3,1e9)));
    dp[0][1][1]=0;
    double bs=1e9;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m+1; j++)
        {
            for(int k=1; k<=m+1; k++)
            {
                double temp=1e9;
                temp=min(temp,dp[0][j][k]);
                temp=min(temp,dp[0][j][k-1]+cad[i].y/l);
                if(cad[i].first!=-1&&j!=1)
                    temp=min(temp,dp[0][j-1][k-1]+cad[i].x/(j-1));
                dp[1][j][k]=temp;
                if(k==m+1&&j==l) bs=min(bs,dp[1][j][k]);
            }
            //cout<<"\n";
        }
        swap(dp[0],dp[1]);
        //cout<<"\n\n";
    }
    return bs;
}
int main()
{
    optimizar_io
    ll n,m;
    cin>>n>>m;
    cad[0]={-1,-1};
    for(int i=1; i<=n; i++)
        cin>>cad[i].second>>cad[i].first;
    sort(cad,cad+n+1);

    double bs=1e9;
    double lo = 0, hi = m+1;
    for (int i = 0; i < 50; ++i) {
      double delta = (hi-lo)/3.0;
      double m1 = lo+delta;
      double m2 = hi-delta;
      double f1=sol(m1,n,m);
      double f2=sol(m2,n,m);
      bs=min(bs,f1);
      bs=min(bs,f2);
      (f1 > f2) ? lo = m1 : hi = m2;
    }
    cout<<bs;
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 555 ms 508 KB Output is correct
6 Execution timed out 2550 ms 1096 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 555 ms 508 KB Output is correct
6 Execution timed out 2550 ms 1096 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 428 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 4 ms 464 KB Output is correct
28 Correct 4 ms 464 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 4 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 4 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Correct 4 ms 348 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 4 ms 344 KB Output is correct
40 Correct 3 ms 348 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 428 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 3 ms 348 KB Output is correct
20 Correct 3 ms 348 KB Output is correct
21 Correct 3 ms 348 KB Output is correct
22 Correct 4 ms 348 KB Output is correct
23 Correct 4 ms 348 KB Output is correct
24 Correct 4 ms 344 KB Output is correct
25 Correct 7 ms 348 KB Output is correct
26 Correct 6 ms 344 KB Output is correct
27 Correct 4 ms 464 KB Output is correct
28 Correct 4 ms 464 KB Output is correct
29 Correct 3 ms 348 KB Output is correct
30 Correct 4 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 4 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 3 ms 348 KB Output is correct
35 Correct 4 ms 348 KB Output is correct
36 Correct 3 ms 348 KB Output is correct
37 Correct 4 ms 348 KB Output is correct
38 Correct 3 ms 348 KB Output is correct
39 Correct 4 ms 344 KB Output is correct
40 Correct 3 ms 348 KB Output is correct
41 Correct 24 ms 344 KB Output is correct
42 Correct 17 ms 344 KB Output is correct
43 Correct 63 ms 344 KB Output is correct
44 Correct 59 ms 460 KB Output is correct
45 Correct 168 ms 504 KB Output is correct
46 Correct 158 ms 600 KB Output is correct
47 Correct 283 ms 548 KB Output is correct
48 Correct 267 ms 344 KB Output is correct
49 Correct 415 ms 604 KB Output is correct
50 Correct 398 ms 604 KB Output is correct
51 Correct 671 ms 944 KB Output is correct
52 Correct 627 ms 944 KB Output is correct
53 Correct 282 ms 348 KB Output is correct
54 Correct 279 ms 548 KB Output is correct
55 Correct 283 ms 348 KB Output is correct
56 Correct 276 ms 348 KB Output is correct
57 Correct 285 ms 548 KB Output is correct
58 Correct 277 ms 348 KB Output is correct
59 Correct 338 ms 548 KB Output is correct
60 Correct 280 ms 548 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 555 ms 508 KB Output is correct
6 Execution timed out 2550 ms 1096 KB Time limit exceeded
7 Halted 0 ms 0 KB -