oj.uz

Submission #579232

# Submission time Handle Problem Language Result Execution time Memory
579232 2022-06-18T13:51:12 Z lcj Two Dishes (JOI19_dishes) C++17
5 / 100
 174 ms 17100 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;

int n, m;

vector<ll> p1, p2, po1, po2;

void solve() {
    cin >> n >> m;
    ll a, s, p;
    p1.assign(n+1, 0);
    p2.assign(m+1, 0);
    po1.assign(n+1, 0);
    po2.assign(m+1, 0);
    ll t1;
    for (int i = 0; i < n; i++)
    {
        cin >> a >> s >> p;
        p1[i+1] = p1[i]+a;
        po1[i+1] = po1[i]+p;
        t1 = s;
    }
    for (int i = 0; i < m; i++)
    {
        cin >> a >> s >> p;
        p2[i+1] = p2[i]+a;
        po2[i+1] = po2[i]+p;
    }
    ll cmax = 0; 
    bool iset = 0;
    for (int i = 0; i <= n; i++)
    {
        if (p1[i] > t1) {continue;}
        int idx = upper_bound(p2.begin(), p2.end(), t1-p1[i])-p2.begin()-1;
        if (i != n && p1[i+1]+p2[idx] <= t1) continue;
        if (!iset) {
            cmax = po1[i]+po2[idx];
        }
        cmax = max(cmax, po1[i]+po2[idx]);
        iset = 1;
    }
    cout << cmax << endl;
}

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

Compilation message

dishes.cpp: In function 'void solve()':
dishes.cpp:40:20: warning: 't1' may be used uninitialized in this function [-Wmaybe-uninitialized]
   40 |         if (i != n && p1[i+1]+p2[idx] <= t1) continue;
      |             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 6584 KB Output is correct
2 Correct 167 ms 9932 KB Output is correct
3 Correct 158 ms 10828 KB Output is correct
4 Correct 166 ms 10776 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 172 ms 16092 KB Output is correct
7 Correct 71 ms 10212 KB Output is correct
8 Correct 79 ms 10340 KB Output is correct
9 Correct 174 ms 17100 KB Output is correct
10 Correct 126 ms 13856 KB Output is correct
11 Correct 102 ms 14244 KB Output is correct

Subtask #2
0 / 3.0

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

Subtask #3
0 / 7.0

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

Subtask #4
0 / 39.0

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

Subtask #5
0 / 11.0

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

Subtask #6
0 / 9.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 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 6584 KB Output is correct
2 Correct 167 ms 9932 KB Output is correct
3 Correct 158 ms 10828 KB Output is correct
4 Correct 166 ms 10776 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 172 ms 16092 KB Output is correct
7 Correct 71 ms 10212 KB Output is correct
8 Correct 79 ms 10340 KB Output is correct
9 Correct 174 ms 17100 KB Output is correct
10 Correct 126 ms 13856 KB Output is correct
11 Correct 102 ms 14244 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -

Subtask #8
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 148 ms 6584 KB Output is correct
2 Correct 167 ms 9932 KB Output is correct
3 Correct 158 ms 10828 KB Output is correct
4 Correct 166 ms 10776 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 172 ms 16092 KB Output is correct
7 Correct 71 ms 10212 KB Output is correct
8 Correct 79 ms 10340 KB Output is correct
9 Correct 174 ms 17100 KB Output is correct
10 Correct 126 ms 13856 KB Output is correct
11 Correct 102 ms 14244 KB Output is correct
12 Incorrect 1 ms 212 KB Output isn't correct
13 Halted 0 ms 0 KB -