oj.uz

Submission #1087536

# Submission time Handle Problem Language Result Execution time Memory
1087536 2024-09-12T21:34:36 Z I_am_Polish_Girl Let's Win the Election (JOI22_ho_t3) C++14
5 / 100
 2500 ms 8340 KB 
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <stack>
#include <queue>
#include <cmath>
#include <random>
#include <chrono>
#include <iomanip>
#include <iostream>

using namespace std;

#define double long double

int log_ = 3;
int inf = 2000000000000000000;
int mod = 1102024631;

int p = 505;


bool cmp(pair <int, int> a, pair <int, int> b)
{
    if (a.second < b.second)
    {
        return true;
    }

    return false;
}

vector <pair <int, int>> vp;

int k;

double c(int col)
{
    int n = vp.size();

    vector <vector <double>> dp0(n + 1);
    vector <vector <double>> dp1;

    for (int i = 0; i <= n; i++)
    {
       dp0[i].resize(n + 1, inf);
    }

    dp0[0][0] = 0;

    dp1 = dp0;

    for (int k = 0; k < n; k++)
    {
        for (int i = 0; i <= n; i++)
        {
            for (int j = 0; j <= n; j++)
            {
                if (i > 0)
                {
                    if (vp[k].second != -1)
                    {
                        dp1[i][j] = min(dp1[i][j], dp0[i - 1][j] + ((0. + vp[k].second) / i));
                    }
                }

                if (j > 0)
                {
                    dp1[i][j] = min(dp1[i][j], dp0[i][j - 1] + ((0. + vp[k].first) / (col + 1)));
                }
            }
        }

        dp0 = dp1;
    }


    vector <double> ans_;

    double ans = inf;
    for (int i = 0; i <= n; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            if (i + j == k)
            {
                if (i == col)
                {
                    ans = min(dp0[i][j], ans);

                    ans_.push_back(dp0[i][j]);
                }
            }
        }
    }

    return ans;
}

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int n;
    cin >> n >> k;

    vp.resize(n);

    for (int i = 0; i < n; i++)
    {
        int a, b;
        cin >> a >> b;

        vp[i] = { a,  b };
    }

    sort(vp.begin(), vp.end(), cmp);

    int l = 0;
    int r = n;

    for (int i = 0; i < n; i++)
    {
        if (vp[i].second == -1)
            r--;
    }

    while (r - l > 5)
    {
        int m = (l + r) / 2;
        
        if (c(m) < c(m + 1))
            r = m;
        else
            l = m;
    }

    double ans = inf;

    for (int i = l; i <= r; i++)
    {
        ans = min(ans, c(i));
    }

    cout << ans;
}

Compilation message

Main.cpp:21:11: warning: overflow in conversion from 'long int' to 'int' changes value from '2000000000000000000' to '1321730048' [-Woverflow]
   21 | int inf = 2000000000000000000;
      |           ^~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 452 KB Output is correct
5 Correct 787 ms 8284 KB Output is correct
6 Correct 807 ms 8336 KB Output is correct
7 Correct 785 ms 8280 KB Output is correct
8 Correct 795 ms 8284 KB Output is correct
9 Correct 786 ms 8340 KB Output is correct
10 Correct 827 ms 8284 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 452 KB Output is correct
5 Correct 787 ms 8284 KB Output is correct
6 Correct 807 ms 8336 KB Output is correct
7 Correct 785 ms 8280 KB Output is correct
8 Correct 795 ms 8284 KB Output is correct
9 Correct 786 ms 8340 KB Output is correct
10 Correct 827 ms 8284 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Execution timed out 2591 ms 8284 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2566 ms 8284 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 1 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 452 KB Output is correct
5 Correct 787 ms 8284 KB Output is correct
6 Correct 807 ms 8336 KB Output is correct
7 Correct 785 ms 8280 KB Output is correct
8 Correct 795 ms 8284 KB Output is correct
9 Correct 786 ms 8340 KB Output is correct
10 Correct 827 ms 8284 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Execution timed out 2591 ms 8284 KB Time limit exceeded
13 Halted 0 ms 0 KB -