Submission #907718

#	Time	Username	Problem	Language	Result	Execution time	Memory
907718		gaga999	Let's Win the Election (JOI22_ho_t3)	C++17	10 / 100	1 ms	364 KiB

Main

#include <cstdio>
#include <stdio.h>
#include <iostream>
#include <math.h>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <stdlib.h>
#include <cstring>
#include <string.h>
#include <string>
#include <sstream>
#include <assert.h>
#include <climits>
#include <sstream>
#include <numeric>
#include <time.h>
#include <limits.h>
#include <list>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <iomanip>
#include <complex>
#include <chrono>
#include <fstream>
#include <functional>
#include <unistd.h>
// #pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,lzcnt,popcnt")
#define lowbit(x) ((x) & -(x))
#define ml(a, b) ((1ll * (a) * (b)) % M)
#define tml(a, b) (a) = ((1ll * (a) * (b)) % M)
#define ad(a, b) ((0ll + (a) + (b)) % M)
#define tad(a, b) (a) = ((0ll + (a) + (b)) % M)
#define mi(a, b) ((0ll + M + (a) - (b)) % M)
#define tmi(a, b) (a) = ((0ll + M + (a) - (b)) % M)
#define tmin(a, b) (a) = min((a), (b))
#define tmax(a, b) (a) = max((a), (b))
#define iter(a) (a).begin(), (a).end()
#define riter(a) (a).rbegin(), (a).rend()
#define init(a, b) memset((a), (b), sizeof(a))
#define cpy(a, b) memcpy((a), (b), sizeof(a))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define pb emplace_back
#define mpr make_pair
#define ls(i) ((i) << 1)
#define rs(i) ((i) << 1 | 1)
#define INF 0x3f3f3f3f
#define NIF 0xc0c0c0c0
#define eps 1e-9
#define F first
#define S second
#define AC cin.tie(0)->sync_with_stdio(0)
using namespace std;
typedef long long llt;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef pair<llt, llt> pll;
typedef complex<double> cd;
// const int M = 998244353;

// random_device rm;
// mt19937 rg(rm());
// default_random_engine rg(rm());
// uniform_int_distribution<int> rd(INT_MIN, INT_MAX);
// uniform_real_distribution<double> rd(0, M_PI);

void db() { cerr << "\n"; }
template <class T, class... U>
void db(T a, U... b) { cerr << a << " ", db(b...); }

inline char gc()
{
    const static int SZ = 1 << 16;
    static char buf[SZ], *p1, *p2;
    if (p1 == p2 && (p2 = buf + fread(p1 = buf, 1, SZ, stdin), p1 == p2))
        return -1;
    return *p1++;
}
void rd() {}
template <typename T, typename... U>
void rd(T &x, U &...y)
{
    x = 0;
    bool f = 0;
    char c = gc();
    while (!isdigit(c))
        f ^= !(c ^ 45), c = gc();
    while (isdigit(c))
        x = (x << 1) + (x << 3) + (c ^ 48), c = gc();
    f && (x = -x), rd(y...);
}

template <typename T>
void prt(T x)
{
    if (x < 0)
        putchar('-'), x = -x;
    if (x > 9)
        prt(x / 10);
    putchar((x % 10) ^ 48);
}

const int N = 505;
pii ar[N];
bool vd[N];

signed main()
{
    int n, k;
    rd(n, k);
    for (int i = 0; i < n; i++)
    {
        rd(ar[i].F, ar[i].S);
        if (!~ar[i].S)
            ar[i].S = INF;
    }
    sort(ar, ar + n);
    double ans = 1e12, sum = 0, num = 0;
    for (int i = 0; i < k; i++)
        sum += ar[i].F;
    ans = sum;
    int cp = k - 1;
    for (int t = 1; t <= k; t++)
    {
        int po = -1;
        pii mn(INF, INF);
        for (int i = 0; i < n; i++)
        {
            if (vd[i])
                continue;
            if (i <= cp)
            {
                if (num + ar[i].S / double(t) + (sum - ar[i].F) / double(t + 1) < ans && mpr(ar[i].S, -ar[i].F) < mn)
                    po = i, mn = mpr(ar[i].S, -ar[i].F);
            }
            else
            {
                if (num + ar[i].S / double(t) + (sum - ar[cp].F) / double(t + 1) < ans && mpr(ar[i].S, -ar[cp].F) < mn)
                    po = i, mn = mpr(ar[i].S, -ar[i].F);
            }
        }
        if (~po)
        {
            vd[po] = 1;
            if (po <= cp)
                ans = num + ar[po].S / double(t) + (sum - ar[po].F) / double(t + 1),
                sum -= ar[po].F;
            else
                ans = num + ar[po].S / double(t) + (sum - ar[cp].F) / double(t + 1),
                sum -= ar[cp--].F;
            num += ar[po].S / double(t);
        }
        else
            break;
        while (cp >= 0 && vd[cp])
            cp--;
    }
    printf("%.10lf\n", ans);
}

• 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