답안 #528063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
528063	2022-02-19T05:55:30 Z	amukkalir	Let's Win the Election (JOI22_ho_t3)	C++17	56 / 100	2500 ms	990460 KB

Main

#include <bits/stdc++.h> 
using namespace std; 
typedef long long ll; 
 
#define prn printf
#define scn scanf
#define pii pair<int,int> 
#define fi first 
#define se second 
#define mp make_pair
 
const int nax = 500;  
const int inf = 1e9; 
 
int n,k; 
double memo[nax+5][nax+5][nax+5]; 
vector<pii> a; 
 
// double dp(int idx, int col, int rem) {
//     if(rem == 0) return 0; 
//     if(idx == n) return inf; 
 
//     double &ret = memo[idx][col][rem]; 
//     if(ret!=0) return ret; 
 
//     ret = dp(idx+1, col, rem); // ga ambil 
//     if(a[idx].fi != inf) ret = min(ret, (double)a[idx].fi/col + dp(idx+1, col+1, rem-1)); 
//     else ret = min(ret, (double)a[idx].se/col + dp(idx+1,col,rem-1)); 
 
//    // cerr << idx << " " << col << " " << rem << " = " << ret << endl; 
//     return ret; 
// }
 
double dp (int idx, int col, int vote, int tcol) {
    if(col + vote == 0) return 0; 
    if(idx==n) return inf; 
 
    double &ret = memo[idx][col][vote]; 
    if(ret!=0) return ret; 
 
    ret = dp(idx+1, col, vote, tcol); 
    
    if(col>0 && a[idx].fi != inf) ret = min(ret, (double)a[idx].fi/(tcol-col+1) + dp(idx+1, col-1, vote, tcol)); //consider jd collaborator 
    if(vote>0) ret = min(ret, (double)a[idx].se/(tcol+1) + dp(idx+1,col,vote-1, tcol)); 
    //cerr << idx << " " << col <<  " " << vote << endl; 
    return ret; 
}

double get(ll c) {
    for(int i=0;i<n;i++) for(int j=0;j<n; j++) for(int k=0; k<n; k++) memo[i][j][k] = 0; 
    return dp(0, c, k-c, c); 
}
 
signed main () {
    scn("%d%d", &n, &k); 
 
    a.assign(n,{0,0}); 
    for(int i=0; i<n; i++) {
        scn("%d%d", &a[i].se, &a[i].fi);
        if(a[i].fi == -1) a[i].fi = inf; 
    }
 
    sort(a.begin(), a.end()); 
    
    //for(int i=0; i<n; i++) //cerr << a[i].fi << " " << a[i].se << endl; 
 
    double ans = inf; 
    int lo = 0, hi = k; 

    while(lo < hi) {
        int mid = (lo+hi)>>1; 
        if(get(mid) < get(mid+1)) hi = mid; 
        else lo = mid+1; 
    }
    //cerr << " :: " << lo << " " << hi << endl; 
    ans = get(lo); 
 
    prn("%f", ans); 
}
 
/*

1 2 3 4 5 6 7 8 9 

9/3 

1 2 3 
4/3 
8/3 


 
dp(i,j,k) = time minimum untuk visit k kota up to index i 
ddn j collaboratior 
 
dp(i,j,0) = 0
 
ambil b 
dp(i+1, j+1, k-1) + b[i]
ambil a 
dp(i+1, j, k-1) + a[i]
ga ambil 
dp(i+1, j+1, k)
 
 
*/

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:55:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   55 |     scn("%d%d", &n, &k);
      |        ^
Main.cpp:59:12: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   59 |         scn("%d%d", &a[i].se, &a[i].fi);
      |            ^

Subtask #1
0 / 5.0

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

Subtask #2
0 / 5.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	460 KB	Output is correct
2	Correct	1 ms	460 KB	Output is correct
3	Correct	1 ms	460 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	0 ms	460 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	1 ms	460 KB	Output is correct
9	Correct	1 ms	460 KB	Output is correct
10	Correct	1 ms	460 KB	Output is correct
11	Correct	0 ms	460 KB	Output is correct
12	Correct	0 ms	460 KB	Output is correct
13	Correct	0 ms	460 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	1 ms	460 KB	Output is correct
16	Correct	1 ms	1868 KB	Output is correct
17	Correct	1 ms	1868 KB	Output is correct
18	Correct	1 ms	1868 KB	Output is correct
19	Correct	1 ms	1868 KB	Output is correct
20	Correct	2 ms	1868 KB	Output is correct
21	Correct	2 ms	1868 KB	Output is correct
22	Correct	1 ms	1868 KB	Output is correct
23	Correct	2 ms	1868 KB	Output is correct
24	Correct	1 ms	1868 KB	Output is correct
25	Correct	1 ms	1868 KB	Output is correct
26	Correct	1 ms	1868 KB	Output is correct
27	Correct	1 ms	1868 KB	Output is correct
28	Correct	1 ms	1868 KB	Output is correct
29	Correct	1 ms	1868 KB	Output is correct
30	Correct	1 ms	1868 KB	Output is correct
31	Correct	1 ms	1868 KB	Output is correct
32	Correct	1 ms	1868 KB	Output is correct
33	Correct	1 ms	1868 KB	Output is correct
34	Correct	1 ms	1868 KB	Output is correct
35	Correct	1 ms	1868 KB	Output is correct
36	Correct	1 ms	1868 KB	Output is correct
37	Correct	1 ms	1868 KB	Output is correct
38	Correct	1 ms	1868 KB	Output is correct
39	Correct	1 ms	1868 KB	Output is correct
40	Correct	1 ms	1868 KB	Output is correct

Subtask #5
33.0 / 33.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	460 KB	Output is correct
2	Correct	1 ms	460 KB	Output is correct
3	Correct	1 ms	460 KB	Output is correct
4	Correct	0 ms	460 KB	Output is correct
5	Correct	1 ms	460 KB	Output is correct
6	Correct	0 ms	460 KB	Output is correct
7	Correct	1 ms	460 KB	Output is correct
8	Correct	1 ms	460 KB	Output is correct
9	Correct	1 ms	460 KB	Output is correct
10	Correct	1 ms	460 KB	Output is correct
11	Correct	0 ms	460 KB	Output is correct
12	Correct	0 ms	460 KB	Output is correct
13	Correct	0 ms	460 KB	Output is correct
14	Correct	0 ms	332 KB	Output is correct
15	Correct	1 ms	460 KB	Output is correct
16	Correct	1 ms	1868 KB	Output is correct
17	Correct	1 ms	1868 KB	Output is correct
18	Correct	1 ms	1868 KB	Output is correct
19	Correct	1 ms	1868 KB	Output is correct
20	Correct	2 ms	1868 KB	Output is correct
21	Correct	2 ms	1868 KB	Output is correct
22	Correct	1 ms	1868 KB	Output is correct
23	Correct	2 ms	1868 KB	Output is correct
24	Correct	1 ms	1868 KB	Output is correct
25	Correct	1 ms	1868 KB	Output is correct
26	Correct	1 ms	1868 KB	Output is correct
27	Correct	1 ms	1868 KB	Output is correct
28	Correct	1 ms	1868 KB	Output is correct
29	Correct	1 ms	1868 KB	Output is correct
30	Correct	1 ms	1868 KB	Output is correct
31	Correct	1 ms	1868 KB	Output is correct
32	Correct	1 ms	1868 KB	Output is correct
33	Correct	1 ms	1868 KB	Output is correct
34	Correct	1 ms	1868 KB	Output is correct
35	Correct	1 ms	1868 KB	Output is correct
36	Correct	1 ms	1868 KB	Output is correct
37	Correct	1 ms	1868 KB	Output is correct
38	Correct	1 ms	1868 KB	Output is correct
39	Correct	1 ms	1868 KB	Output is correct
40	Correct	1 ms	1868 KB	Output is correct
41	Correct	32 ms	40228 KB	Output is correct
42	Correct	33 ms	40116 KB	Output is correct
43	Correct	42 ms	40208 KB	Output is correct
44	Correct	38 ms	40140 KB	Output is correct
45	Correct	52 ms	40264 KB	Output is correct
46	Correct	48 ms	40140 KB	Output is correct
47	Correct	59 ms	40204 KB	Output is correct
48	Correct	60 ms	40160 KB	Output is correct
49	Correct	68 ms	40208 KB	Output is correct
50	Correct	76 ms	40164 KB	Output is correct
51	Correct	100 ms	40212 KB	Output is correct
52	Correct	76 ms	40140 KB	Output is correct
53	Correct	53 ms	40140 KB	Output is correct
54	Correct	67 ms	40204 KB	Output is correct
55	Correct	55 ms	40176 KB	Output is correct
56	Correct	52 ms	40140 KB	Output is correct
57	Correct	58 ms	40212 KB	Output is correct
58	Correct	55 ms	40208 KB	Output is correct
59	Correct	60 ms	40212 KB	Output is correct
60	Correct	60 ms	40204 KB	Output is correct

Subtask #6
0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	2623 ms	990460 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	Incorrect	1 ms	204 KB	Output isn't correct
3	Halted	0 ms	0 KB	-

답안 #528063

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 33.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
33.0 / 33.0

Subtask #6
0 / 11.0

Subtask #7
0 / 23.0