# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
641111 | cthbst | Let's Win the Election (JOI22_ho_t3) | C++14 | 844 ms | 8360 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
#define int long long
using pii = pair<int, int>;
const long double INF = 1e18;
const int maxn = 505;
int n, k;
vector<pii> vc;
long double dp[maxn][maxn];
long double sf[maxn][maxn]; // sf[i][j] 從 A[i~(n-1)] 選 j 個最大的數字
bool cmp(pii a, pii b) {
if (a.second == -1 && b.second == -1) {
return a.first < b.first;
}
if (a.second == -1 || b.second == -1) {
return a.second > b.second;
}
return a.second < b.second;
}
void build_sf() {
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |