oj.uz

답안 #1087925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1087925 2024-09-13T14:27:17 Z I_am_Polish_Girl Let's Win the Election (JOI22_ho_t3) C++14
61 / 100
 2500 ms 1964 KB 
#pragma target("arch=icelake-server")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimization ("unroll-loops")
 
#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;
 
 
int log_ = 3;
int inf = 200000000000000;
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;
}
 
 
double dp1[501][501];
 
vector <pair <int, int>> vp;
 
int k;
 
 
vector <double> ans__;
 
double c(int col)
{
    if (ans__[col] != -1)
        return ans__[col];
 
    int n = vp.size();
 
 
    for (int i = 0; i <= col; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            dp1[i][j] = inf;
        }
    }
 
    dp1[0][0] = 0;
 
 
    for (int k = 0; k < n; k++)
    {
        for (int i = col; i >= 0; i--)
        {
            for (int j = n; j >= 0; j--)
            {
                if (i > 0)
                {
                    if (vp[k].second != -1)
                    {
                        dp1[i][j] = min(dp1[i][j], dp1[i - 1][j] + ((0. + (col + 1) * vp[k].second) / i));
                    }
                }
 
                if (j > 0)
                {
                    dp1[i][j] = min(dp1[i][j], dp1[i][j - 1] + ((0. + vp[k].first)));
                }
            }
        }
 
    }
 
    double ans = inf;
    for (int i = 0; i <= col; i++)
    {
        for (int j = 0; j <= n; j++)
        {
            if (i + j == k)
            {
                if (i == col)
                {
                    ans = min(dp1[i][j], ans);
                }
            }
        }
    }
 
    ans /= col + 1;
 
    ans__[col] = ans;
 
    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;
 
    ans__.resize(n + 2, -1);
 
    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--;
    }
 
    int sq = sqrt(r);
    r = min(r, k);
 
 
    while (r - l > 1)
    {
        int m = (l + r) / 2;
 
        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:1: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    1 | #pragma target("arch=icelake-server")
      | 
Main.cpp:4: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("unroll-loops")
      | 
Main.cpp:24:11: warning: overflow in conversion from 'long int' to 'int' changes value from '200000000000000' to '552894464' [-Woverflow]
   24 | int inf = 200000000000000;
      |           ^~~~~~~~~~~~~~~
Main.cpp: In function 'int main()':
Main.cpp:161:9: warning: unused variable 'sq' [-Wunused-variable]
  161 |     int sq = sqrt(r);
      |         ^~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 1 ms 344 KB Output is correct

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 935 ms 1024 KB Output is correct
13 Correct 515 ms 920 KB Output is correct
14 Correct 142 ms 600 KB Output is correct
15 Execution timed out 2526 ms 1828 KB Time limit exceeded
16 Halted 0 ms 0 KB -

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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 1 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 1 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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 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 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 1 ms 472 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 472 KB Output is correct
40 Correct 0 ms 464 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 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 1 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 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 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 344 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 468 KB Output is correct
34 Correct 0 ms 468 KB Output is correct
35 Correct 1 ms 472 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 472 KB Output is correct
40 Correct 0 ms 464 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 3 ms 348 KB Output is correct
43 Correct 3 ms 540 KB Output is correct
44 Correct 4 ms 348 KB Output is correct
45 Correct 7 ms 604 KB Output is correct
46 Correct 5 ms 344 KB Output is correct
47 Correct 6 ms 604 KB Output is correct
48 Correct 9 ms 604 KB Output is correct
49 Correct 13 ms 716 KB Output is correct
50 Correct 7 ms 604 KB Output is correct
51 Correct 11 ms 604 KB Output is correct
52 Correct 13 ms 628 KB Output is correct
53 Correct 4 ms 604 KB Output is correct
54 Correct 6 ms 604 KB Output is correct
55 Correct 13 ms 600 KB Output is correct
56 Correct 4 ms 600 KB Output is correct
57 Correct 10 ms 604 KB Output is correct
58 Correct 11 ms 692 KB Output is correct
59 Correct 10 ms 604 KB Output is correct
60 Correct 9 ms 672 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2518 ms 1964 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 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 1 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 935 ms 1024 KB Output is correct
13 Correct 515 ms 920 KB Output is correct
14 Correct 142 ms 600 KB Output is correct
15 Execution timed out 2526 ms 1828 KB Time limit exceeded
16 Halted 0 ms 0 KB -