oj.uz

답안 #824429

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
824429 2023-08-14T06:10:31 Z peteza Let's Win the Election (JOI22_ho_t3) C++14
11 / 100
 2500 ms 994508 KB 
#include <bits/stdc++.h>
using namespace std;

int n, k;
bool vis[505][505][505];
double DP[505][505][505], inf = 1e12, cans = inf;
pair<int, int> dat[505];

int main() {
    DP[0][0][0] = 0; vis[0][0][0] = 1;
    cin >> n >> k;
    int bc = n;
    for(int i=0;i<n;i++) {
        cin >> dat[i].first >> dat[i].second;
        if(dat[i].second == -1) bc--, dat[i].second = INT_MAX;
    }
    sort(dat, dat+n);
    double frfr = 1e12;
    do {
        for(int i=0;i<=n;i++) {
            for(int j=0;j<=k;j++) {
                for(int K=0;K<=bc;K++) {
                    if(i == j && j == K && !i) continue;
                    if(i == 0 || j<K) {DP[i][j][K] = inf; continue;}
                    DP[i][j][K] = DP[i-1][j][K];
                    if(j) DP[i][j][K] = min(DP[i][j][K], DP[i-1][j-1][K] + (1.00*dat[i-1].first/(K+1)));
                    if(j && K && dat[i-1].second != INT_MAX) DP[i][j][K] = min(DP[i][j][K], DP[i-1][j-1][K-1] + (1.00*dat[i-1].second/K));                
                }
            }
        }
        for(int i=0;i<=bc;i++) cans = min(cans, DP[n][k][i]);
        frfr = min(frfr, cans);
    } while (next_permutation(dat, dat+n));
    cout << frfr;
}

Subtask #1
0 / 5.0

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

Subtask #2
0 / 5.0

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

Subtask #3
11.0 / 11.0

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

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 6 ms 404 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 7 ms 596 KB Output is correct
16 Execution timed out 2573 ms 724 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 3 ms 468 KB Output is correct
4 Correct 6 ms 404 KB Output is correct
5 Correct 5 ms 468 KB Output is correct
6 Correct 7 ms 468 KB Output is correct
7 Correct 7 ms 596 KB Output is correct
8 Correct 5 ms 468 KB Output is correct
9 Correct 5 ms 468 KB Output is correct
10 Correct 5 ms 468 KB Output is correct
11 Correct 5 ms 468 KB Output is correct
12 Correct 5 ms 468 KB Output is correct
13 Correct 5 ms 468 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 7 ms 596 KB Output is correct
16 Execution timed out 2573 ms 724 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #6
0 / 11.0

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

Subtask #7
0 / 23.0

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