답안 #534210

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
534210	2022-03-08T02:16:58 Z	Cookie197	Let's Win the Election (JOI22_ho_t3)	C++14	23 / 100	2500 ms	312 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];

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;

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

Subtask #1
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Execution timed out	2563 ms	204 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

Subtask #2
0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Execution timed out	2563 ms	204 KB	Time limit exceeded
6	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	1 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	312 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	312 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	1 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	312 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	312 KB	Output is correct
16	Correct	3 ms	312 KB	Output is correct
17	Correct	84 ms	204 KB	Output is correct
18	Correct	70 ms	300 KB	Output is correct
19	Correct	298 ms	292 KB	Output is correct
20	Correct	261 ms	204 KB	Output is correct
21	Correct	243 ms	296 KB	Output is correct
22	Correct	318 ms	308 KB	Output is correct
23	Correct	254 ms	204 KB	Output is correct
24	Correct	245 ms	292 KB	Output is correct
25	Correct	387 ms	300 KB	Output is correct
26	Correct	351 ms	292 KB	Output is correct
27	Correct	304 ms	292 KB	Output is correct
28	Correct	288 ms	296 KB	Output is correct
29	Correct	295 ms	296 KB	Output is correct
30	Correct	355 ms	292 KB	Output is correct
31	Correct	304 ms	292 KB	Output is correct
32	Correct	324 ms	296 KB	Output is correct
33	Correct	275 ms	204 KB	Output is correct
34	Correct	302 ms	300 KB	Output is correct
35	Correct	294 ms	204 KB	Output is correct
36	Correct	319 ms	292 KB	Output is correct
37	Correct	310 ms	300 KB	Output is correct
38	Correct	283 ms	296 KB	Output is correct
39	Correct	312 ms	304 KB	Output is correct
40	Correct	303 ms	204 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	1 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	1 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	312 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	312 KB	Output is correct
16	Correct	3 ms	312 KB	Output is correct
17	Correct	84 ms	204 KB	Output is correct
18	Correct	70 ms	300 KB	Output is correct
19	Correct	298 ms	292 KB	Output is correct
20	Correct	261 ms	204 KB	Output is correct
21	Correct	243 ms	296 KB	Output is correct
22	Correct	318 ms	308 KB	Output is correct
23	Correct	254 ms	204 KB	Output is correct
24	Correct	245 ms	292 KB	Output is correct
25	Correct	387 ms	300 KB	Output is correct
26	Correct	351 ms	292 KB	Output is correct
27	Correct	304 ms	292 KB	Output is correct
28	Correct	288 ms	296 KB	Output is correct
29	Correct	295 ms	296 KB	Output is correct
30	Correct	355 ms	292 KB	Output is correct
31	Correct	304 ms	292 KB	Output is correct
32	Correct	324 ms	296 KB	Output is correct
33	Correct	275 ms	204 KB	Output is correct
34	Correct	302 ms	300 KB	Output is correct
35	Correct	294 ms	204 KB	Output is correct
36	Correct	319 ms	292 KB	Output is correct
37	Correct	310 ms	300 KB	Output is correct
38	Correct	283 ms	296 KB	Output is correct
39	Correct	312 ms	304 KB	Output is correct
40	Correct	303 ms	204 KB	Output is correct
41	Incorrect	1 ms	204 KB	Output isn't correct
42	Halted	0 ms	0 KB	-

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 ms	204 KB	Output is correct
2	Correct	1 ms	204 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	0 ms	204 KB	Output is correct
5	Execution timed out	2563 ms	204 KB	Time limit exceeded
6	Halted	0 ms	0 KB	-

답안 #534210

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