oj.uz

답안 #922713

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922713 2024-02-06T03:53:28 Z GrindMachine Let's Win the Election (JOI22_ho_t3) C++17
11 / 100
 2500 ms 600 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n,k; cin >> n >> k;
    vector<pll> a(n);
    rep(i,n) cin >> a[i].ff >> a[i].ss;
    rep(i,n) if(a[i].ss == -1) a[i].ss = inf2;

    auto cmp = [&](pll p1, pll p2){
        return p1.ss < p2.ss;
    };

    sort(all(a),cmp);
    ld ans = inf2;

    rep(mask,1<<n){
        ld cost = 0;
        ll guys = 1;
        ll votes = 0;
        vector<ll> others;
        bool ok = true;

        rep(i,n){
            if(mask&(1<<i)){
                if(a[i].ss == inf2){
                    ok = false;
                }
                else{
                    cost += a[i].ss/(ld)guys;
                    guys++;
                    votes++;
                }
            }
            else{
                others.pb(a[i].ff);
            }
        }

        sort(rall(others));
        while(votes < k){
            ll x = others.back();
            others.pop_back();
            cost += (ld)x/guys;
            votes++;
        }

        amin(ans,cost);
    }

    cout << fixed << setprecision(11);
    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Compilation message

Main.cpp: In function 'void solve(int)':
Main.cpp:79:14: warning: variable 'ok' set but not used [-Wunused-but-set-variable]
   79 |         bool ok = true;
      |              ^~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 428 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 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 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 428 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 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 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 255 ms 428 KB Output is correct
17 Correct 246 ms 348 KB Output is correct
18 Correct 249 ms 428 KB Output is correct
19 Correct 270 ms 424 KB Output is correct
20 Correct 268 ms 348 KB Output is correct
21 Correct 272 ms 428 KB Output is correct
22 Correct 281 ms 436 KB Output is correct
23 Correct 264 ms 596 KB Output is correct
24 Runtime error 289 ms 596 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 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 428 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 600 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 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 255 ms 428 KB Output is correct
17 Correct 246 ms 348 KB Output is correct
18 Correct 249 ms 428 KB Output is correct
19 Correct 270 ms 424 KB Output is correct
20 Correct 268 ms 348 KB Output is correct
21 Correct 272 ms 428 KB Output is correct
22 Correct 281 ms 436 KB Output is correct
23 Correct 264 ms 596 KB Output is correct
24 Runtime error 289 ms 596 KB Execution killed with signal 11
25 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 348 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -