답안 #534218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534218	2022-03-08T02:27:54 Z	Cookie197	Let's Win the Election (JOI22_ho_t3)	C++14	23 / 100	392 ms	328 KB

Main

#include<iostream>
#include<vector>
#include<algorithm>
#include<math.h>
#include<iomanip>
using namespace std;
#define ll long long
#define pii pair<int,int> 
#define mp make_pair
#define endl "\n"
#define out(x) cout << #x << " = " << x << endl
#define outp(x) cout << #x << ".first = " << x.first << "  " << #x << ".second = " << x.second << endl
#pragma GCC optimize("Ofast")
#define lll __int128

// enumerate the num of collaborators, from 0 to k-1
// it is optimal to collect all collaborators first, then give speeches

int n,k;
pii arr[505];
bool subtask1 = true, subtask2 = true;
signed main(){
    ios::sync_with_stdio(false); cin.tie(0);
    cin>>n>>k;
    for (int i=0;i<n;i++) {
        cin>>arr[i].first>>arr[i].second;
        if (arr[i].second != -1) subtask1 = false;
        if (arr[i].second != -1 && arr[i].second != arr[i].first) subtask2 = false;
    }

    if (subtask1){
        sort(arr,arr+n);
        int ans = 0;
        for (int i=0;i<k;i++) ans+=arr[i].first;
        cout<<ans<<endl;
    }

    if (n<=20){
        double best = 1e9;
        int ok[505];
        vector<int> collab,speech;
        for (int bit=0;bit<(1<<n);bit++){ // choose collaborators
            if (__builtin_popcount(bit) >= k) continue;
            double now = 0;
            collab.clear();
            for (int i=0;i<n;i++) ok[i] = false;
            int cnt = 0;
            for (int i=0;i<n;i++) if ((1<<i) & bit) if (arr[i].second != -1) collab.push_back(arr[i].second), ok[i] = true, cnt++;
            
            sort(collab.begin(),collab.end());
            int people = 1;
            for (double d:collab){
                now += d/people;
                people++;
            }

            speech.clear();
            for (int i=0;i<n;i++) if (!ok[i]) speech.push_back(arr[i].first);

            sort(speech.begin(),speech.end());
            for (int i=0;i<k-cnt;i++) now += 1.0 * speech[i] / people;

            best = min(best, now);
        }
        cout<<fixed<<setprecision(9)<<best<<endl;
        return 0;
    }


    

}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 5.0

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

Subtask #3
11.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct

Subtask #4
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	3 ms	204 KB	Output is correct
17	Correct	80 ms	292 KB	Output is correct
18	Correct	72 ms	288 KB	Output is correct
19	Correct	282 ms	292 KB	Output is correct
20	Correct	259 ms	324 KB	Output is correct
21	Correct	248 ms	288 KB	Output is correct
22	Correct	295 ms	292 KB	Output is correct
23	Correct	256 ms	328 KB	Output is correct
24	Correct	227 ms	296 KB	Output is correct
25	Correct	392 ms	296 KB	Output is correct
26	Correct	335 ms	296 KB	Output is correct
27	Correct	284 ms	292 KB	Output is correct
28	Correct	294 ms	296 KB	Output is correct
29	Correct	300 ms	204 KB	Output is correct
30	Correct	315 ms	292 KB	Output is correct
31	Correct	291 ms	204 KB	Output is correct
32	Correct	297 ms	292 KB	Output is correct
33	Correct	278 ms	296 KB	Output is correct
34	Correct	278 ms	292 KB	Output is correct
35	Correct	306 ms	296 KB	Output is correct
36	Correct	307 ms	204 KB	Output is correct
37	Correct	309 ms	292 KB	Output is correct
38	Correct	280 ms	296 KB	Output is correct
39	Correct	310 ms	204 KB	Output is correct
40	Correct	284 ms	288 KB	Output is correct

Subtask #5
0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	0 ms	204 KB	Output is correct
3	Correct	0 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Correct	0 ms	204 KB	Output is correct
6	Correct	0 ms	204 KB	Output is correct
7	Correct	0 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	0 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	0 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	0 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	0 ms	204 KB	Output is correct
16	Correct	3 ms	204 KB	Output is correct
17	Correct	80 ms	292 KB	Output is correct
18	Correct	72 ms	288 KB	Output is correct
19	Correct	282 ms	292 KB	Output is correct
20	Correct	259 ms	324 KB	Output is correct
21	Correct	248 ms	288 KB	Output is correct
22	Correct	295 ms	292 KB	Output is correct
23	Correct	256 ms	328 KB	Output is correct
24	Correct	227 ms	296 KB	Output is correct
25	Correct	392 ms	296 KB	Output is correct
26	Correct	335 ms	296 KB	Output is correct
27	Correct	284 ms	292 KB	Output is correct
28	Correct	294 ms	296 KB	Output is correct
29	Correct	300 ms	204 KB	Output is correct
30	Correct	315 ms	292 KB	Output is correct
31	Correct	291 ms	204 KB	Output is correct
32	Correct	297 ms	292 KB	Output is correct
33	Correct	278 ms	296 KB	Output is correct
34	Correct	278 ms	292 KB	Output is correct
35	Correct	306 ms	296 KB	Output is correct
36	Correct	307 ms	204 KB	Output is correct
37	Correct	309 ms	292 KB	Output is correct
38	Correct	280 ms	296 KB	Output is correct
39	Correct	310 ms	204 KB	Output is correct
40	Correct	284 ms	288 KB	Output is correct
41	Incorrect	0 ms	204 KB	Output isn't correct
42	Halted	0 ms	0 KB	-

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

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

답안 #534218

Compilation message

Subtask #1 0 / 5.0

Subtask #2 0 / 5.0

Subtask #3 11.0 / 11.0

Subtask #4 12.0 / 12.0

Subtask #5 0 / 33.0

Subtask #6 0 / 11.0

Subtask #7 0 / 23.0

Subtask #1
0 / 5.0

Subtask #2
0 / 5.0

Subtask #3
11.0 / 11.0

Subtask #4
12.0 / 12.0

Subtask #5
0 / 33.0

Subtask #6
0 / 11.0

Subtask #7
0 / 23.0