oj.uz

답안 #868523

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868523 2023-10-31T16:00:47 Z efedmrlr Let's Win the Election (JOI22_ho_t3) C++17
100 / 100
 935 ms 4692 KB 
#include <bits/stdc++.h>

using namespace std;

#define n_l '\n'
#define dbg(...) cout << "[" << #__VA_ARGS__ << "]: "; cout << to_string(__VA_ARGS__) << endl
template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); } 
#define dbgm(...) cout << "[" << #__VA_ARGS__ << "]: "; dbgm(__VA_ARGS__); cout << endl


#define int long long int
#define MP make_pair
#define pb push_back
#define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
#define ld long double
void fastio() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}


const double EPS = 0.0001;
const int INF = 1e14;
const int N = 600;
const int M = 3e5+5;
const int ALPH = 26;
const int LGN = 25;
const int MOD = 1e9+7;
int n,m,q,K;
vector<array<int,2> > a;
inline void solve() {
    cin >> n >> K;
    a.resize(n);
    REP(i,n) {
        cin >> a[i][1] >> a[i][0];
        if(a[i][0] == -1) a[i][0] = INF;
    }
    sort(a.begin(), a.end());
    ld ans = INF;
    for(int b = 0; b<=K; b++) {
        vector<vector<ld> > dp(n+10, vector<ld> (K - b + 5, INF));
        dp[0][0] = 0;
        for(int i = 0; i<n; i++) {
            for(int k = 0; k<=K - b; k++) {
                if(k < K - b) {
                    dp[i + 1][k + 1] = min(dp[i + 1][k + 1], dp[i][k] + (ld) a[i][1] / (ld)(b + 1));
                }
                dp[i + 1][k] = min(dp[i + 1][k], dp[i][k] + ((i - k < b) ? (ld) a[i][0] / (ld)(i - k + 1) : (ld)0 ));

            }
        }
        ans = min(ans , dp[n][K - b]);
    }

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

}    
 
signed main() {
    fastio();
    int test = 1;
    //cin>>test;
    while(test--) {
        solve();
    }
    
}

Compilation message

Main.cpp: In function 'std::string to_string(std::string, int, int)':
Main.cpp:7:208: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | template <typename T, size_t N> int SIZE(const T (&t)[N]){ return N; } template<typename T> int SIZE(const T &t){ return t.size(); } string to_string(const string s, int x1=0, int x2=1e9){ return '"' + ((x1 < s.size()) ? s.substr(x1, x2-x1+1) : "") + '"'; } string to_string(const char* s) { return to_string((string) s); } string to_string(const bool b) { return (b ? "true" : "false"); } string to_string(const char c){ return string({c}); } template<size_t N> string to_string(const bitset<N> &b, int x1=0, int x2=1e9){ string t = ""; for(int __iii__ = min(x1,SIZE(b)),  __jjj__ = min(x2, SIZE(b)-1); __iii__ <= __jjj__; ++__iii__){ t += b[__iii__] + '0'; } return '"' + t + '"'; } template <typename A, typename... C> string to_string(const A (&v), int x1=0, int x2=1e9, C... coords); int l_v_l_v_l = 0, t_a_b_s = 0; template <typename A, typename B> string to_string(const pair<A, B> &p) { l_v_l_v_l++; string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; l_v_l_v_l--; return res; } template <typename A, typename... C> string to_string(const A (&v), int x1, int x2, C... coords) { int rnk = rank<A>::value; string tab(t_a_b_s, ' '); string res = ""; bool first = true; if(l_v_l_v_l == 0) res += n_l; res += tab + "["; x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v)); auto l = begin(v); advance(l, x1); auto r = l; advance(r, (x2-x1) + (x2 < SIZE(v))); for (auto e = l; e != r; e = next(e)) { if (!first) { res += ", "; } first = false; l_v_l_v_l++; if(e != l){ if(rnk > 1) { res += n_l; t_a_b_s = l_v_l_v_l; }; } else{ t_a_b_s = 0; } res += to_string(*e, coords...); l_v_l_v_l--; } res += "]"; if(l_v_l_v_l == 0) res += n_l; return res; } void dbgm(){;} template<typename Heads, typename... Tails> void dbgm(Heads H, Tails... T){ cout << to_string(H) << " | "; dbgm(T...); }
      |                                                                                                                                                                                                             ~~~^~~~~~~~~~
Main.cpp: In function 'void solve()':
Main.cpp:14:26: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   14 | #define REP(i,n) for(int (i) = 0; (i) < (n); (i)++)
      |                          ^
Main.cpp:34:5: note: in expansion of macro 'REP'
   34 |     REP(i,n) {
      |     ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 13 ms 948 KB Output is correct
6 Correct 57 ms 1468 KB Output is correct
7 Correct 224 ms 2504 KB Output is correct
8 Correct 521 ms 3564 KB Output is correct
9 Correct 893 ms 4528 KB Output is correct
10 Correct 435 ms 3324 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 13 ms 948 KB Output is correct
6 Correct 57 ms 1468 KB Output is correct
7 Correct 224 ms 2504 KB Output is correct
8 Correct 521 ms 3564 KB Output is correct
9 Correct 893 ms 4528 KB Output is correct
10 Correct 435 ms 3324 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 81 ms 1724 KB Output is correct
13 Correct 81 ms 1684 KB Output is correct
14 Correct 81 ms 1680 KB Output is correct
15 Correct 460 ms 3284 KB Output is correct
16 Correct 453 ms 3320 KB Output is correct
17 Correct 438 ms 3304 KB Output is correct
18 Correct 930 ms 4472 KB Output is correct
19 Correct 900 ms 4472 KB Output is correct
20 Correct 890 ms 4472 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 468 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 452 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 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 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 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 348 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 448 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 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 468 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 452 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 1 ms 604 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 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 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 348 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 596 KB Output is correct
47 Correct 3 ms 604 KB Output is correct
48 Correct 3 ms 600 KB Output is correct
49 Correct 4 ms 672 KB Output is correct
50 Correct 4 ms 664 KB Output is correct
51 Correct 7 ms 628 KB Output is correct
52 Correct 7 ms 660 KB Output is correct
53 Correct 3 ms 600 KB Output is correct
54 Correct 3 ms 600 KB Output is correct
55 Correct 3 ms 604 KB Output is correct
56 Correct 3 ms 604 KB Output is correct
57 Correct 3 ms 604 KB Output is correct
58 Correct 3 ms 600 KB Output is correct
59 Correct 3 ms 604 KB Output is correct
60 Correct 3 ms 600 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 913 ms 4508 KB Output is correct
2 Correct 893 ms 4492 KB Output is correct
3 Correct 935 ms 4472 KB Output is correct
4 Correct 901 ms 4512 KB Output is correct
5 Correct 934 ms 4524 KB Output is correct
6 Correct 903 ms 4692 KB Output is correct
7 Correct 913 ms 4532 KB Output is correct

Subtask #7
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 13 ms 948 KB Output is correct
6 Correct 57 ms 1468 KB Output is correct
7 Correct 224 ms 2504 KB Output is correct
8 Correct 521 ms 3564 KB Output is correct
9 Correct 893 ms 4528 KB Output is correct
10 Correct 435 ms 3324 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 81 ms 1724 KB Output is correct
13 Correct 81 ms 1684 KB Output is correct
14 Correct 81 ms 1680 KB Output is correct
15 Correct 460 ms 3284 KB Output is correct
16 Correct 453 ms 3320 KB Output is correct
17 Correct 438 ms 3304 KB Output is correct
18 Correct 930 ms 4472 KB Output is correct
19 Correct 900 ms 4472 KB Output is correct
20 Correct 890 ms 4472 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 448 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 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 0 ms 348 KB Output is correct
38 Correct 0 ms 468 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 452 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 1 ms 344 KB Output is correct
55 Correct 1 ms 344 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 344 KB Output is correct
62 Correct 1 ms 344 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 348 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 3 ms 604 KB Output is correct
68 Correct 3 ms 600 KB Output is correct
69 Correct 4 ms 672 KB Output is correct
70 Correct 4 ms 664 KB Output is correct
71 Correct 7 ms 628 KB Output is correct
72 Correct 7 ms 660 KB Output is correct
73 Correct 3 ms 600 KB Output is correct
74 Correct 3 ms 600 KB Output is correct
75 Correct 3 ms 604 KB Output is correct
76 Correct 3 ms 604 KB Output is correct
77 Correct 3 ms 604 KB Output is correct
78 Correct 3 ms 600 KB Output is correct
79 Correct 3 ms 604 KB Output is correct
80 Correct 3 ms 600 KB Output is correct
81 Correct 913 ms 4508 KB Output is correct
82 Correct 893 ms 4492 KB Output is correct
83 Correct 935 ms 4472 KB Output is correct
84 Correct 901 ms 4512 KB Output is correct
85 Correct 934 ms 4524 KB Output is correct
86 Correct 903 ms 4692 KB Output is correct
87 Correct 913 ms 4532 KB Output is correct
88 Correct 10 ms 1164 KB Output is correct
89 Correct 10 ms 1164 KB Output is correct
90 Correct 58 ms 1464 KB Output is correct
91 Correct 58 ms 1720 KB Output is correct
92 Correct 227 ms 2516 KB Output is correct
93 Correct 224 ms 2516 KB Output is correct
94 Correct 559 ms 3472 KB Output is correct
95 Correct 498 ms 3472 KB Output is correct
96 Correct 730 ms 4056 KB Output is correct
97 Correct 729 ms 4060 KB Output is correct
98 Correct 441 ms 3308 KB Output is correct
99 Correct 438 ms 3308 KB Output is correct
100 Correct 453 ms 3304 KB Output is correct
101 Correct 444 ms 3324 KB Output is correct
102 Correct 442 ms 3304 KB Output is correct
103 Correct 440 ms 3324 KB Output is correct
104 Correct 471 ms 3328 KB Output is correct
105 Correct 443 ms 3324 KB Output is correct