oj.uz

답안 #1072330

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1072330 2024-08-23T17:07:02 Z _rain_ Let's Win the Election (JOI22_ho_t3) C++14
100 / 100
 155 ms 4440 KB 
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define fixbug false
//#define double long double

void SETIO(string name = ""){
    if (name=="") return;
    freopen((name+".inp").c_str(),"r",stdin);
    freopen((name+".out").c_str(),"w+",stdout);
    return;
}

const int maxn = 502;
const int maxk = 502;
const int INF = 1e9 + 7;
int n , k ;
pair<double,double> a[maxn+2];
#define fi first
#define se second

bool cmp(pair<int,int> a , pair<int,int> b){
    if (a.second != b.second) return a.second < b.second;
    return a.first < b.first;
}
double dp[maxn+2][maxk+2];
double sum[maxn+2][maxn+2];

void reset(){
    for (int j = 0; j <= k + 1; ++j)
        for (int z = 0; z <= k + 1; ++z) {
                dp[j][z] = INF;
        }
    return;
}


int main(){
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    SETIO("");

    cin >> n >> k;
    cout << setprecision(9) << fixed;
    reset();
    for (int i = 1; i <= n; ++i) {
        cin >> a[i].fi >> a[i].se;
        if (a[i].se==-1) a[i].se = INF;
    }
    sort(a+1,a+n+1,cmp);

    //... BUILDING FOR THE RIGHT
        for (int i = 0; i <= n + 1; ++i) for (int j = 0; j <= k + 1; ++j) sum[i][j] = INF;
        for (int i = 0; i <= n + 1; ++i) sum[i][0] = 0;
        for (int i = n; i >= 1; --i){
            sum[i][1] = a[i].first;
            for (int num = 1; num <= k; ++num){
                sum[i][num] = min(sum[i + 1][num] , sum[i][num]);
                sum[i][num] = min(sum[i][num] , sum[i + 1][num - 1] + a[i].first);
            }
        }
    //...;
    reset();
    double ans = sum[1][k];
    for (int exp = 1; exp <= k + 1; ++exp){
        reset();
        dp[0][1] = 0;
        for (int i = 1; i <= k; ++i){
            for (int j = 1; j <= exp; ++j){
                dp[i][j] = min(dp[i - 1][j] + a[i].fi / (double)(exp) , dp[i][j]);
                if (j - 1 > 0)
                    dp[i][j] = min(dp[i - 1][j - 1] + a[i].se / (double)(j - 1) , dp[i][j]);
                if (j==exp){
                        if (fixbug){
                            cout << "EXP : " << exp << '\n';
                            cout << i << ' ' << j << ' ' << dp[i][j] << ' ' << dp[i][j] + sum[i + 1][k - i] / (double)exp << '\n';
                        }
                    ans = min(ans , dp[i][j] + sum[i + 1][k - i] / (double)exp);
                }
            }
        }
    }
    cout << ans;
}

Compilation message

Main.cpp: In function 'void SETIO(std::string)':
Main.cpp:9:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     freopen((name+".inp").c_str(),"r",stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:10:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     freopen((name+".out").c_str(),"w+",stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 19 ms 3452 KB Output is correct
8 Correct 62 ms 3932 KB Output is correct
9 Correct 153 ms 4416 KB Output is correct
10 Correct 50 ms 3676 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 19 ms 3452 KB Output is correct
8 Correct 62 ms 3932 KB Output is correct
9 Correct 153 ms 4416 KB Output is correct
10 Correct 50 ms 3676 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 5 ms 2908 KB Output is correct
13 Correct 5 ms 2908 KB Output is correct
14 Correct 5 ms 2908 KB Output is correct
15 Correct 56 ms 3672 KB Output is correct
16 Correct 51 ms 3820 KB Output is correct
17 Correct 59 ms 3672 KB Output is correct
18 Correct 141 ms 4440 KB Output is correct
19 Correct 140 ms 4440 KB Output is correct
20 Correct 150 ms 4184 KB Output is correct

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

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

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2508 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 1 ms 2396 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2392 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 0 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2396 KB Output is correct
23 Correct 1 ms 2396 KB Output is correct
24 Correct 0 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 1 ms 2648 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 1 ms 2512 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 1 ms 2396 KB Output is correct
31 Correct 1 ms 2392 KB Output is correct
32 Correct 1 ms 2396 KB Output is correct
33 Correct 0 ms 2396 KB Output is correct
34 Correct 1 ms 2392 KB Output is correct
35 Correct 0 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 0 ms 2396 KB Output is correct
38 Correct 1 ms 2392 KB Output is correct
39 Correct 1 ms 2396 KB Output is correct
40 Correct 1 ms 2392 KB Output is correct
41 Correct 1 ms 2652 KB Output is correct
42 Correct 1 ms 2652 KB Output is correct
43 Correct 1 ms 2652 KB Output is correct
44 Correct 1 ms 2516 KB Output is correct
45 Correct 1 ms 2648 KB Output is correct
46 Correct 1 ms 2652 KB Output is correct
47 Correct 1 ms 2648 KB Output is correct
48 Correct 1 ms 2652 KB Output is correct
49 Correct 1 ms 2652 KB Output is correct
50 Correct 2 ms 2776 KB Output is correct
51 Correct 2 ms 2652 KB Output is correct
52 Correct 2 ms 2652 KB Output is correct
53 Correct 1 ms 2648 KB Output is correct
54 Correct 1 ms 2652 KB Output is correct
55 Correct 1 ms 2652 KB Output is correct
56 Correct 1 ms 2652 KB Output is correct
57 Correct 1 ms 2652 KB Output is correct
58 Correct 1 ms 2652 KB Output is correct
59 Correct 1 ms 2648 KB Output is correct
60 Correct 1 ms 2652 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 141 ms 4188 KB Output is correct
2 Correct 142 ms 4184 KB Output is correct
3 Correct 145 ms 4188 KB Output is correct
4 Correct 146 ms 4188 KB Output is correct
5 Correct 141 ms 4184 KB Output is correct
6 Correct 155 ms 4416 KB Output is correct
7 Correct 145 ms 4440 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2652 KB Output is correct
6 Correct 3 ms 2764 KB Output is correct
7 Correct 19 ms 3452 KB Output is correct
8 Correct 62 ms 3932 KB Output is correct
9 Correct 153 ms 4416 KB Output is correct
10 Correct 50 ms 3676 KB Output is correct
11 Correct 1 ms 2392 KB Output is correct
12 Correct 5 ms 2908 KB Output is correct
13 Correct 5 ms 2908 KB Output is correct
14 Correct 5 ms 2908 KB Output is correct
15 Correct 56 ms 3672 KB Output is correct
16 Correct 51 ms 3820 KB Output is correct
17 Correct 59 ms 3672 KB Output is correct
18 Correct 141 ms 4440 KB Output is correct
19 Correct 140 ms 4440 KB Output is correct
20 Correct 150 ms 4184 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 1 ms 2508 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 0 ms 2396 KB Output is correct
26 Correct 1 ms 2396 KB Output is correct
27 Correct 0 ms 2396 KB Output is correct
28 Correct 0 ms 2396 KB Output is correct
29 Correct 1 ms 2396 KB Output is correct
30 Correct 0 ms 2396 KB Output is correct
31 Correct 1 ms 2396 KB Output is correct
32 Correct 0 ms 2396 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 0 ms 2396 KB Output is correct
35 Correct 1 ms 2396 KB Output is correct
36 Correct 1 ms 2396 KB Output is correct
37 Correct 1 ms 2392 KB Output is correct
38 Correct 1 ms 2396 KB Output is correct
39 Correct 0 ms 2396 KB Output is correct
40 Correct 1 ms 2396 KB Output is correct
41 Correct 1 ms 2396 KB Output is correct
42 Correct 1 ms 2396 KB Output is correct
43 Correct 1 ms 2396 KB Output is correct
44 Correct 0 ms 2396 KB Output is correct
45 Correct 1 ms 2396 KB Output is correct
46 Correct 1 ms 2648 KB Output is correct
47 Correct 0 ms 2396 KB Output is correct
48 Correct 1 ms 2512 KB Output is correct
49 Correct 1 ms 2396 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 1 ms 2392 KB Output is correct
52 Correct 1 ms 2396 KB Output is correct
53 Correct 0 ms 2396 KB Output is correct
54 Correct 1 ms 2392 KB Output is correct
55 Correct 0 ms 2396 KB Output is correct
56 Correct 1 ms 2396 KB Output is correct
57 Correct 0 ms 2396 KB Output is correct
58 Correct 1 ms 2392 KB Output is correct
59 Correct 1 ms 2396 KB Output is correct
60 Correct 1 ms 2392 KB Output is correct
61 Correct 1 ms 2652 KB Output is correct
62 Correct 1 ms 2652 KB Output is correct
63 Correct 1 ms 2652 KB Output is correct
64 Correct 1 ms 2516 KB Output is correct
65 Correct 1 ms 2648 KB Output is correct
66 Correct 1 ms 2652 KB Output is correct
67 Correct 1 ms 2648 KB Output is correct
68 Correct 1 ms 2652 KB Output is correct
69 Correct 1 ms 2652 KB Output is correct
70 Correct 2 ms 2776 KB Output is correct
71 Correct 2 ms 2652 KB Output is correct
72 Correct 2 ms 2652 KB Output is correct
73 Correct 1 ms 2648 KB Output is correct
74 Correct 1 ms 2652 KB Output is correct
75 Correct 1 ms 2652 KB Output is correct
76 Correct 1 ms 2652 KB Output is correct
77 Correct 1 ms 2652 KB Output is correct
78 Correct 1 ms 2652 KB Output is correct
79 Correct 1 ms 2648 KB Output is correct
80 Correct 1 ms 2652 KB Output is correct
81 Correct 141 ms 4188 KB Output is correct
82 Correct 142 ms 4184 KB Output is correct
83 Correct 145 ms 4188 KB Output is correct
84 Correct 146 ms 4188 KB Output is correct
85 Correct 141 ms 4184 KB Output is correct
86 Correct 155 ms 4416 KB Output is correct
87 Correct 145 ms 4440 KB Output is correct
88 Correct 2 ms 2652 KB Output is correct
89 Correct 1 ms 2652 KB Output is correct
90 Correct 4 ms 2960 KB Output is correct
91 Correct 3 ms 2908 KB Output is correct
92 Correct 21 ms 3280 KB Output is correct
93 Correct 20 ms 3420 KB Output is correct
94 Correct 64 ms 3932 KB Output is correct
95 Correct 62 ms 3928 KB Output is correct
96 Correct 102 ms 4184 KB Output is correct
97 Correct 103 ms 4224 KB Output is correct
98 Correct 51 ms 3932 KB Output is correct
99 Correct 51 ms 3824 KB Output is correct
100 Correct 50 ms 3788 KB Output is correct
101 Correct 50 ms 3676 KB Output is correct
102 Correct 53 ms 3672 KB Output is correct
103 Correct 51 ms 3676 KB Output is correct
104 Correct 59 ms 3676 KB Output is correct
105 Correct 50 ms 3676 KB Output is correct