oj.uz

답안 #871926

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
871926 2023-11-11T21:29:31 Z HorizonWest Let's Win the Election (JOI22_ho_t3) C++17
66 / 100
 437 ms 1002584 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define endl '\n'
#define db double
#define ll __int128
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;
 
const int Max = 1e6 + 7, Inf = 1e9 + 7;
 
void print(bool x) { cout << (x ? "YES" : "NO") << endl; }
 
string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}
 
void printdb(double ans, int k)
{
    cout << setiosflags(ios::fixed)
         << setiosflags(ios::showpoint)
         << setprecision(k) << ans << endl;
}

pair <db, db> fmin(pair<db, db> a, pair <db, db> b, db j)
{
    if(db(a.fs + a.sd / j) < db(b.fs + b.sd / j))
        return a; 
    else   
        return b; 
}
 
int prec(vector <pair<db, db>> a, vector <pair<db, db>> b, int n, int m)
{
    vector <db> take(n, 1); db ans = Inf; 

    for(db i = 1; i <= m; i++)
    {
        db Z1 = 0.0, Z2 = b[i-1].fs / i; int cnt = i - 1;   //cerr << b[i-1].fs << endl; 
        
        for(int j = 0; j < n; j++)
        {
            //cerr << a[j].fs << " "; 
            if(cnt == m) break;
            Z1 += take[a[j].sd] * a[j].fs / i; 
            cnt += take[a[j].sd];
        } 
        
        cnt = i; take[b[i-1].sd] = 0;  

        for(int j = 0; j < n; j++)
        {
            if(cnt == m) break;
            Z2 += take[a[j].sd] * a[j].fs / (i + 1); 
            cnt += take[a[j].sd]; 
        }

        //cerr << Z1 << " " << Z2 << endl; 

        if(Z1 <= Z2) return i; 
    }

    return m; 
}

void solve()
{
    int n, m; cin >> n >> m; 
    vector <pair<db, db>> v(n), a(n), b(n);

    for(int i = 0; i < n; i++) 
    {
        cin >> v[i].sd >> v[i].fs;
        if(v[i].fs == -1) v[i].fs = Inf;
        a[i].fs = v[i].sd; b[i].fs = v[i].fs; 
        a[i].sd = b[i].sd = i;   
    } 

    sort(all(v)); sort(all(a)); sort(all(b)); 
    
    db ans = Inf; int fx = prec(a, b, n, m); 
    //cerr << fx << endl; 
    vector <vector<vector<db>>> dp(n + 2, vector <vector<db>> (
      m + 2, vector <db> (m + 2, Inf)
    )); dp[0][1][0] = 0.000; 
  
    for(db l = max(0, fx - 10); l <= min(fx + 10, m); l++)
    {        
        for(db i = 0; i < n; i++)
        {
            for(db k = 0; k <= m; k++)
            {
                if(i == k)
                {        
                    for(db j = 1; j <= l; j++)
                    {
                        dp[i+1][j][k] = min(dp[i+1][j][k], dp[i][j][k]);  
                        dp[i+1][j][k+1] = min(dp[i+1][j][k+1], dp[i][j][k] + v[i].sd / l); 
                        dp[i+1][j+1][k+1] = min(dp[i+1][j+1][k+1], dp[i][j][k] + v[i].fs / j); 
                    }
                }   
                else 
                {
                    dp[i+1][l][k] = min(dp[i+1][l][k], dp[i][l][k]);  
                    dp[i+1][l][k+1] = min(dp[i+1][l][k+1], dp[i][l][k] + v[i].sd / l); 
                }
            }
            ans = min(ans, dp[i+1][l][m]); 
        }
    }
 
    printdb(ans, 5); 
}
 
int32_t main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
 
    int Q = 1; //cin >> Q;
 
    while (Q--)
    {
        solve();
    }
 
    return 0;
}

Compilation message

Main.cpp: In function 'int prec(std::vector<std::pair<double, double> >, std::vector<std::pair<double, double> >, int, int)':
Main.cpp:50:32: warning: unused variable 'ans' [-Wunused-variable]
   50 |     vector <db> take(n, 1); db ans = Inf;
      |                                ^~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 7 ms 12036 KB Output is correct
6 Correct 32 ms 65944 KB Output is correct
7 Correct 109 ms 255316 KB Output is correct
8 Correct 229 ms 566008 KB Output is correct
9 Correct 389 ms 1002576 KB Output is correct
10 Correct 195 ms 495264 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 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 7 ms 12036 KB Output is correct
6 Correct 32 ms 65944 KB Output is correct
7 Correct 109 ms 255316 KB Output is correct
8 Correct 229 ms 566008 KB Output is correct
9 Correct 389 ms 1002576 KB Output is correct
10 Correct 195 ms 495264 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 45 ms 94252 KB Output is correct
13 Correct 52 ms 94288 KB Output is correct
14 Correct 48 ms 94288 KB Output is correct
15 Correct 225 ms 495188 KB Output is correct
16 Correct 234 ms 495700 KB Output is correct
17 Correct 204 ms 495188 KB Output is correct
18 Correct 423 ms 1002576 KB Output is correct
19 Correct 437 ms 1002580 KB Output is correct
20 Correct 391 ms 1002584 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 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 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 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 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct

Subtask #4
12.0 / 12.0

# 결과 실행 시간 메모리 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 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 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 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 544 KB Output is correct
40 Correct 0 ms 348 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 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 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 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 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 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 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 344 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 600 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 544 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 1 ms 856 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 1372 KB Output is correct
44 Correct 1 ms 1372 KB Output is correct
45 Correct 2 ms 2652 KB Output is correct
46 Correct 2 ms 2652 KB Output is correct
47 Correct 2 ms 4188 KB Output is correct
48 Correct 3 ms 4188 KB Output is correct
49 Correct 4 ms 5980 KB Output is correct
50 Correct 4 ms 6092 KB Output is correct
51 Correct 5 ms 9052 KB Output is correct
52 Correct 6 ms 9264 KB Output is correct
53 Correct 2 ms 4188 KB Output is correct
54 Correct 3 ms 4188 KB Output is correct
55 Correct 3 ms 4188 KB Output is correct
56 Correct 2 ms 4188 KB Output is correct
57 Correct 3 ms 4188 KB Output is correct
58 Correct 3 ms 4184 KB Output is correct
59 Correct 3 ms 4184 KB Output is correct
60 Correct 2 ms 4188 KB Output is correct

Subtask #6
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 420 ms 1002580 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 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 7 ms 12036 KB Output is correct
6 Correct 32 ms 65944 KB Output is correct
7 Correct 109 ms 255316 KB Output is correct
8 Correct 229 ms 566008 KB Output is correct
9 Correct 389 ms 1002576 KB Output is correct
10 Correct 195 ms 495264 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 45 ms 94252 KB Output is correct
13 Correct 52 ms 94288 KB Output is correct
14 Correct 48 ms 94288 KB Output is correct
15 Correct 225 ms 495188 KB Output is correct
16 Correct 234 ms 495700 KB Output is correct
17 Correct 204 ms 495188 KB Output is correct
18 Correct 423 ms 1002576 KB Output is correct
19 Correct 437 ms 1002580 KB Output is correct
20 Correct 391 ms 1002584 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 344 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 1 ms 600 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 544 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 856 KB Output is correct
62 Correct 1 ms 604 KB Output is correct
63 Correct 1 ms 1372 KB Output is correct
64 Correct 1 ms 1372 KB Output is correct
65 Correct 2 ms 2652 KB Output is correct
66 Correct 2 ms 2652 KB Output is correct
67 Correct 2 ms 4188 KB Output is correct
68 Correct 3 ms 4188 KB Output is correct
69 Correct 4 ms 5980 KB Output is correct
70 Correct 4 ms 6092 KB Output is correct
71 Correct 5 ms 9052 KB Output is correct
72 Correct 6 ms 9264 KB Output is correct
73 Correct 2 ms 4188 KB Output is correct
74 Correct 3 ms 4188 KB Output is correct
75 Correct 3 ms 4188 KB Output is correct
76 Correct 2 ms 4188 KB Output is correct
77 Correct 3 ms 4188 KB Output is correct
78 Correct 3 ms 4184 KB Output is correct
79 Correct 3 ms 4184 KB Output is correct
80 Correct 2 ms 4188 KB Output is correct
81 Incorrect 420 ms 1002580 KB Output isn't correct
82 Halted 0 ms 0 KB -