oj.uz

답안 #973705

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
973705 2024-05-02T09:47:35 Z berr Let's Win the Election (JOI22_ho_t3) C++17
61 / 100
 2500 ms 2648 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 505;
 
double dp[N][N];
 
signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n, k; cin >> n >> k;

    vector<array<int, 2>> a(n);
    int c=0;
    for(auto &[i, l]: a) cin >> i >> l, c+=(l!=-1);
    
    sort(a.begin(), a.end(), [&](auto x, auto y){
        if(x[1]==y[1]) return x[0] < y[0];
        else if(y[1]==-1) return true;
        else if(x[1]==-1) return false;
         return x[1]<y[1]; 
    }); 

    vector<double> val(n+1);
    vector<int> vis(n+1, 0);

        auto calc=[&](int e){
            if(vis[e]) return val[e];
            vis[e]=1;
            for(int i=0; i<=n+1; i++){
                for(int l=0; l<=n+1; l++){
                    dp[i][l]=1e9;
                }
            }
         
            dp[0][0]=0;
            for(int i=0; i<n; i++){
                for(int l=e; l>=0; l--){
                    for(int x=n; x>=0; x--){
                      //  cout<<(double)a[i][1]/(double)(l+1)<<"\n";
                        if(a[i][1]!=-1)
                            dp[l+1][x] =min<double>(dp[l+1][x], dp[l][x]+(double)a[i][1]/(double)(l+1));
                        dp[l][x+1]=min<double>(dp[l][x+1], dp[l][x]+((double)a[i][0]/(double)(e+1)));
                    }
                }
            }

            return val[e]=dp[e][k-e];

        };
        double ans=1e9;
        int s=0;

        for(int i=9; i>=0; i--){
            int tmp = s+(1<<i);
            if(tmp<=k&&tmp<=c && calc(tmp)<calc(tmp-1)){
                s=tmp;
                ans=min(ans, calc(tmp));
            }
        }
        
        for(int i=max(0,s-10); i<=min(k, s+10); i++){
            ans=min(ans, calc(i));
        }

        cout<<setprecision(9)<<ans<<"\n";
    

}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 12 ms 2396 KB Output is correct
6 Correct 13 ms 2396 KB Output is correct
7 Correct 23 ms 2396 KB Output is correct
8 Correct 13 ms 2396 KB Output is correct
9 Correct 13 ms 2452 KB Output is correct
10 Correct 13 ms 2452 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 12 ms 2396 KB Output is correct
6 Correct 13 ms 2396 KB Output is correct
7 Correct 23 ms 2396 KB Output is correct
8 Correct 13 ms 2396 KB Output is correct
9 Correct 13 ms 2452 KB Output is correct
10 Correct 13 ms 2452 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 784 ms 2448 KB Output is correct
13 Correct 799 ms 2424 KB Output is correct
14 Correct 255 ms 2396 KB Output is correct
15 Correct 2317 ms 2648 KB Output is correct
16 Correct 1847 ms 2592 KB Output is correct
17 Correct 447 ms 2392 KB Output is correct
18 Execution timed out 2532 ms 2396 KB Time limit exceeded
19 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 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 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 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 432 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 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 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 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 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 432 KB Output is correct
41 Correct 2 ms 1112 KB Output is correct
42 Correct 3 ms 856 KB Output is correct
43 Correct 4 ms 860 KB Output is correct
44 Correct 7 ms 860 KB Output is correct
45 Correct 14 ms 856 KB Output is correct
46 Correct 7 ms 860 KB Output is correct
47 Correct 11 ms 860 KB Output is correct
48 Correct 17 ms 860 KB Output is correct
49 Correct 22 ms 860 KB Output is correct
50 Correct 15 ms 860 KB Output is correct
51 Correct 20 ms 860 KB Output is correct
52 Correct 23 ms 860 KB Output is correct
53 Correct 8 ms 860 KB Output is correct
54 Correct 13 ms 856 KB Output is correct
55 Correct 20 ms 856 KB Output is correct
56 Correct 9 ms 860 KB Output is correct
57 Correct 16 ms 860 KB Output is correct
58 Correct 21 ms 860 KB Output is correct
59 Correct 21 ms 604 KB Output is correct
60 Correct 16 ms 860 KB Output is correct

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 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 12 ms 2396 KB Output is correct
6 Correct 13 ms 2396 KB Output is correct
7 Correct 23 ms 2396 KB Output is correct
8 Correct 13 ms 2396 KB Output is correct
9 Correct 13 ms 2452 KB Output is correct
10 Correct 13 ms 2452 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 784 ms 2448 KB Output is correct
13 Correct 799 ms 2424 KB Output is correct
14 Correct 255 ms 2396 KB Output is correct
15 Correct 2317 ms 2648 KB Output is correct
16 Correct 1847 ms 2592 KB Output is correct
17 Correct 447 ms 2392 KB Output is correct
18 Execution timed out 2532 ms 2396 KB Time limit exceeded
19 Halted 0 ms 0 KB -