oj.uz

Submission #1087545

# Submission time Handle Problem Language Result Execution time Memory
1087545 2024-09-12T21:49:45 Z I_am_Polish_Girl Let's Win the Election (JOI22_ho_t3) C++14
61 / 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;
}

mt19937 rnd(15);

int rnd_(int l, int r)
{
    int s = r - l + 1;

    int x = rnd();

    x = abs(x);

    x %= (s + 1);

    return l + x;
}

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--;
    }

    r = min(r, k);

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

    double ans = inf;

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


    cout << fixed;
    cout << setprecision(9);
    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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 843 ms 8340 KB Output is correct
6 Correct 867 ms 8284 KB Output is correct
7 Correct 841 ms 8340 KB Output is correct
8 Correct 810 ms 8280 KB Output is correct
9 Correct 820 ms 8340 KB Output is correct
10 Correct 817 ms 8284 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 843 ms 8340 KB Output is correct
6 Correct 867 ms 8284 KB Output is correct
7 Correct 841 ms 8340 KB Output is correct
8 Correct 810 ms 8280 KB Output is correct
9 Correct 820 ms 8340 KB Output is correct
10 Correct 817 ms 8284 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Execution timed out 2586 ms 8144 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 476 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 416 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 1 ms 392 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 3 ms 472 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 3 ms 348 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 476 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 2 ms 416 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 3 ms 348 KB Output is correct
26 Correct 3 ms 348 KB Output is correct
27 Correct 1 ms 392 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 5 ms 344 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 3 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 3 ms 348 KB Output is correct
34 Correct 3 ms 472 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 1 ms 348 KB Output is correct
40 Correct 3 ms 348 KB Output is correct
41 Correct 172 ms 604 KB Output is correct
42 Correct 83 ms 600 KB Output is correct
43 Correct 77 ms 756 KB Output is correct
44 Correct 260 ms 604 KB Output is correct
45 Correct 194 ms 600 KB Output is correct
46 Correct 274 ms 756 KB Output is correct
47 Correct 211 ms 760 KB Output is correct
48 Correct 310 ms 760 KB Output is correct
49 Correct 361 ms 600 KB Output is correct
50 Correct 100 ms 848 KB Output is correct
51 Correct 353 ms 604 KB Output is correct
52 Correct 313 ms 600 KB Output is correct
53 Correct 291 ms 604 KB Output is correct
54 Correct 345 ms 852 KB Output is correct
55 Correct 370 ms 764 KB Output is correct
56 Correct 107 ms 600 KB Output is correct
57 Correct 281 ms 756 KB Output is correct
58 Correct 282 ms 604 KB Output is correct
59 Correct 310 ms 600 KB Output is correct
60 Correct 224 ms 760 KB Output is correct

Subtask #6
0 / 11.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2563 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 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 843 ms 8340 KB Output is correct
6 Correct 867 ms 8284 KB Output is correct
7 Correct 841 ms 8340 KB Output is correct
8 Correct 810 ms 8280 KB Output is correct
9 Correct 820 ms 8340 KB Output is correct
10 Correct 817 ms 8284 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Execution timed out 2586 ms 8144 KB Time limit exceeded
13 Halted 0 ms 0 KB -