# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
218891 | socho | Visiting Singapore (NOI20_visitingsingapore) | C++14 | 644 ms | 640 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"
using namespace std;
// #define endl '\n'
// #define double long double
// #define int long long
// int MOD = 1000 * 1000 * 1000 + 7;
// int MOD = 998244353;
const int MXN = 5005;
const int MXK = 1005;
int k, n, m, a, b;
int hap[MXK];
int eve[MXN];
int want[MXN];
int dp[2][MXN][2][2];
int best(int a, int b, int c, int d) {
return dp[a % 2][b][c][d];
}
signed main() {
cin >> k >> n >> m >> a >> b;
for (int i=1; i<=k; i++) cin >> hap[i];
for (int i=1; i<=n; i++) cin >> eve[i];
for (int i=1; i<=m; i++) cin >> want[i];
int MX = INT_MIN;
# | 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... |