제출 #1123355

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1123355		ljtunas	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	1112 ms	8396 KiB

Main

// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v)    memset(h, v, sizeof h)
#define Forv(i, a)     for(auto& i : a)
#define For(i, a, b)   for(int i = a; i <= b; ++i)
#define Ford(i, a, b)  for(int i = a; i >= b; --i)
#define c_bit(i)     __builtin_popcountll(i)
#define Bit(mask, i)    ((mask >> i) & 1LL)
#define onbit(mask, i)  ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define Log2(x) (63 - __builtin_clzll(x))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;
namespace std {
    template <typename T, int D>
    struct _vector : public vector <_vector <T, D - 1>> {
        static_assert(D >= 1, "Dimension must be positive!");
        template <typename... Args>
        _vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
    };
    template <typename T> struct _vector <T, 1> : public vector <T> {
        _vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
    };
    template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
    template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 5e2 + 5;
const  ll  mod = 1e9 + 7;
const  ll   oo = 1e18;

//#define int long long

int n, k;
#define db long double
int a[MAXN], b[MAXN]; ii c[MAXN];

namespace subtrau{
    db dp[2][MAXN][MAXN];
    void Solve(){
        db ans = oo;
        sort(c + 1, c + n + 1);
        For(i, 1, n) a[i] = c[i].se, b[i] = c[i].fi;
        For(i, 0, 1) For(j, 0, n + 1) For(cc, 0, n + 1) dp[i][j][cc] = oo;
        dp[0][0][0] = 0;
        For(loops, 1, n) {
            For(i, 0, k) For(j, 0, n){
                minimize(dp[1][i][j], dp[0][i][j]);
                db _j = j;
                if (i) minimize(dp[1][i][j], dp[0][i - 1][j] + 1.0*(a[loops] / (_j + 1)));
                if (b[loops] != inf && i){
                    minimize(dp[1][i][j], dp[0][i - 1][j - 1] + 1.0*(b[loops] / _j));
                }
            }
            For(j, 0, n) minimize(ans, dp[1][k][j]);
            For(i, 0, k) For(j, 0, n){
                dp[0][i][j] = dp[1][i][j];
                dp[1][i][j] = oo;
            }
        }

//        For(cc, 1, n) For(j, 0, n) minimize(ans, dp[cc][k][j]);


        cout << setprecision(6) << fixed << ans << '\n';
    }
}

namespace subfull{
    void Solve(){

    }
}

void Solve() {
    cin >> n >> k;
    For(i, 1, n) {
        cin >> a[i] >> b[i];
        if(b[i] == -1) b[i] = inf;
        c[i] = {b[i], a[i]};
    }
//    For(i, 1, n) cerr << a[i] << ' ' << b[i] << '\n';
    subtrau::Solve();
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    if(fopen("lat.inp", "r")) {
        freopen("lat.inp", "r", stdin);
        freopen("lat.out", "w", stdout);
    }

    int t = 1;
//    cin >> t;
    while(t --) Solve();

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

Main.cpp: In function 'int main()':
Main.cpp:94:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   94 |         freopen("lat.inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:95:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |         freopen("lat.out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 11
• Subtask 4: 0 / 12
• Subtask 5: 0 / 33
• Subtask 6: 0 / 11
• Subtask 7: 0 / 23