# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
294981 | crossing0ver | Visiting Singapore (NOI20_visitingsingapore) | C++17 | 415 ms | 668 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>
using namespace std;
int k,n,m,a,b,hap[5005],s[5005],t[5005];
int dp[5005][2][2],old_dp[5005][2][2]; //
//int dp[5005][5005][2][2];
void change(int& a,int b) {
if (a < b)
a = b;
}
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 >> s[i];
for (int i = 1; i <= m; i++)
cin >> t[i];
int ans = a + b*m;
const int inf = -1e8;
for (int j = 1; j <= m; j++)
for (int y = 0; y < 2; y++)
dp[j][1][y] = inf,dp[j][0][y] = a + b*j;
// for (int i = 1; i <= n; i++)
// for (int x = 0; x < 2; x++)
// dp[i][0][x][1] =inf,dp[i][0][x][0] = a + b;
//
//for (int j = 1; j <= m ;j ++)
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |