# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
968538 | maxFedorchuk | Boarding Passes (BOI22_passes) | C++17 | 402 ms | 357180 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 <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;
int N, G;
double pref[15][15][100005], suf[15][15][100005], cost[15][1 << 15], dp[1 << 15];
vector<int> place[15];
string s;
double sum(int i, int mask, int mid)
{
double res = 0, pre = 0, su = 0;
for (int j = 0; j < G; j++)
if (mask & (1 << j))
res += pref[i][j][mid] + suf[i][j][mid + 1];
res += pref[i][i][mid] + suf[i][i][mid + 1];
return res;
}
signed main()
{
cin >> s;
N = s.size();
Compilation message (stderr)
# | 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... |