oj.uz

Submission #995807

# Submission time Handle Problem Language Result Execution time Memory
995807 2024-06-09T23:36:48 Z cpptowin Visiting Singapore (NOI20_visitingsingapore) C++17
22 / 100
 137 ms 262144 KB 
#include <bits/stdc++.h>
#define fo(i, d, c) for (int i = d; i <= c; i++)
#define fod(i, c, d) for (int i = c; i >= d; i--)
#define maxn 1000010
#define N 5010
#define fi first
#define se second
#define pb emplace_back
#define en cout << "\n";
#define int long long
#define inf (int)1e18
#define pii pair<int, int>
#define vii vector<pii>
#define lb(x) x & -x
#define bit(i, j) ((i >> j) & 1)
#define offbit(i, j) (i ^ (1LL << j))
#define onbit(i, j) (i | (1LL << j))
#define vi vector<int>
template <typename T1, typename T2>
bool minimize(T1 &a, T2 b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
}
template <typename T1, typename T2>
bool maximize(T1 &a, T2 b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
}
using namespace std;
const int nsqrt = 450;
const int mod = 1e9 + 7;
int k,n,m,a,b,s[N],t[N],v[N];
int f[N][N],dp[N][N];
namespace sub1
{
void solve()
{
    if(k != 1 or m > n) return;
    cout << m * v[1] ;
    exit(0);
}
}
namespace sub2
{
void solve()
{
    if(k != 1 or m <= n) return;
    cout << n * v[1] + (m - n) * b + a;
    exit(0);
}
}
namespace sub3
{
void solve()
{
    if(a != 0 or b != 0) return;
    int ans = 0;
    fo(i,1,n)
    {
        fo(j,1,m)
        {
            maximize(f[i][j],f[i - 1][j]);
            if(s[i] == t[j])
                maximize(f[i][j],f[i - 1][j - 1] + v[t[j]]);
        }
        fo(j,1,m) maximize(f[i][j],f[i][j - 1]);
        maximize(ans,f[i][m]);
    }
    cout << ans;
    exit(0);
}
}
namespace sub4
{
void solve()
{
    if(a != 0) return;
    int ans = -inf;
    memset(f,-0x3f,sizeof f);
    memset(dp,-0x3f,sizeof dp);
    fo(i,1,n)
    {
        fo(j,1,m)
        {
            dp[i][j] = max(dp[i][j - 1] + b,dp[i - 1][j] + b);
            if(s[i] == t[j])
            {
                f[i][j] = max(dp[i - 1][j - 1] + v[t[j]],(j - 1) * b + v[t[j]]);
                maximize(dp[i][j],f[i][j]);
            }
            maximize(ans,f[i][j] + (m - j) * b);
        }
    }
    cout << ans;
    exit(0);
}
}
main()
{
#define name "TASK"
    if (fopen(name ".inp", "r"))
    {
        freopen(name ".inp", "r", stdin);
        freopen(name ".out", "w", stdout);
    }
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> k >> n >> m >> a >> b;
    fo(i,1,k) cin >> v[i];
    fo(i,1,n) cin >> s[i];
    fo(i,1,m) cin >> t[i];
    sub1 :: solve();
    sub2 :: solve();
    sub3 :: solve();
    sub4 :: solve();
}

Compilation message

VisitingSingapore.cpp:108:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  108 | main()
      | ^~~~
VisitingSingapore.cpp: In function 'int main()':
VisitingSingapore.cpp:113:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  113 |         freopen(name ".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
VisitingSingapore.cpp:114:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |         freopen(name ".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 30044 KB Output is correct
2 Correct 8 ms 18280 KB Output is correct
3 Correct 40 ms 79856 KB Output is correct
4 Correct 85 ms 174360 KB Output is correct
5 Correct 31 ms 51368 KB Output is correct
6 Correct 39 ms 76332 KB Output is correct
7 Correct 72 ms 143408 KB Output is correct
8 Correct 26 ms 54876 KB Output is correct
9 Correct 64 ms 91476 KB Output is correct
10 Correct 137 ms 196220 KB Output is correct
11 Correct 100 ms 195660 KB Output is correct
12 Correct 104 ms 196176 KB Output is correct
13 Correct 42 ms 848 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 30044 KB Output is correct
2 Correct 8 ms 18280 KB Output is correct
3 Correct 40 ms 79856 KB Output is correct
4 Correct 85 ms 174360 KB Output is correct
5 Correct 31 ms 51368 KB Output is correct
6 Correct 39 ms 76332 KB Output is correct
7 Correct 72 ms 143408 KB Output is correct
8 Correct 26 ms 54876 KB Output is correct
9 Correct 64 ms 91476 KB Output is correct
10 Correct 137 ms 196220 KB Output is correct
11 Correct 100 ms 195660 KB Output is correct
12 Correct 104 ms 196176 KB Output is correct
13 Correct 42 ms 848 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Runtime error 39 ms 262144 KB Execution killed with signal 9
17 Halted 0 ms 0 KB -

Subtask #5
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 30044 KB Output is correct
2 Correct 8 ms 18280 KB Output is correct
3 Correct 40 ms 79856 KB Output is correct
4 Correct 85 ms 174360 KB Output is correct
5 Correct 31 ms 51368 KB Output is correct
6 Correct 39 ms 76332 KB Output is correct
7 Correct 72 ms 143408 KB Output is correct
8 Correct 26 ms 54876 KB Output is correct
9 Correct 64 ms 91476 KB Output is correct
10 Correct 137 ms 196220 KB Output is correct
11 Correct 100 ms 195660 KB Output is correct
12 Correct 104 ms 196176 KB Output is correct
13 Correct 42 ms 848 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Incorrect 1 ms 344 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 14 ms 30044 KB Output is correct
22 Correct 8 ms 18280 KB Output is correct
23 Correct 40 ms 79856 KB Output is correct
24 Correct 85 ms 174360 KB Output is correct
25 Correct 31 ms 51368 KB Output is correct
26 Correct 39 ms 76332 KB Output is correct
27 Correct 72 ms 143408 KB Output is correct
28 Correct 26 ms 54876 KB Output is correct
29 Correct 64 ms 91476 KB Output is correct
30 Correct 137 ms 196220 KB Output is correct
31 Correct 100 ms 195660 KB Output is correct
32 Correct 104 ms 196176 KB Output is correct
33 Correct 42 ms 848 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Runtime error 39 ms 262144 KB Execution killed with signal 9
37 Halted 0 ms 0 KB -