oj.uz

Submission #693238

# Submission time Handle Problem Language Result Execution time Memory
693238 2023-02-02T13:36:23 Z true22 Visiting Singapore (NOI20_visitingsingapore) C++14
6 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long int ll;
typedef long double ld;

typedef pair<ll, ll> pl;
typedef vector<ll> vl;   
typedef vector<pl> vp;

#define nl "\n"
#define fr first
#define sc second
#define pb push_back

#define all(x) x.begin(), x.end()
#define fur(i, a, b) for(ll i = a; i <= b; ++i)
#define ruf(i, a, b) for(ll i = a; i >= b; --i)
#define pv(x) for(auto k : x){cout << k << " ";} cout << nl

ll K, n, m, A, B;
vl v, s, t;

/*
    There are K types of events
    We know the values of each type of event
    N of them will occur
    M of them you want to attend (in the given order, you can attend a type of event more than once)
    if you miss x consecutive normal events, you will lose points
    if you miss x consecutive special events, you will lose points
    now, what is the maximum score you can get?
*/

void solve(){
    // k = 1, n < m
    ll tot = n * v[1];

    ll rep = ((m-n) * B) + A;
    cout << (tot + rep) << nl;
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);

    cin >> K >> n >> m >> A >> B;
    v.resize(K + 1);
    s.resize(n + 1);
    t.resize(m + 1);
    fur(i, 1, K)
        cin >> v[i];
    fur(i, 1, n)
        cin >> s[i];
    fur(i, 1, m)
        cin >> t[i];

    
    solve();

    return 0;
}

Subtask #1
0 / 4.0

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

Subtask #2
6.0 / 6.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 7.0

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

Subtask #5
0 / 8.0

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

Subtask #6
0 / 13.0

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

Subtask #7
0 / 50.0

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