oj.uz

Submission #721780

# Submission time Handle Problem Language Result Execution time Memory
721780 2023-04-11T07:14:59 Z Sharky Catfish Farm (IOI22_fish) C++17
0 / 100
 104 ms 10040 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

#define int long long

long long max_weights(int32_t n, int32_t m, std::vector<int32_t> x, std::vector<int32_t> y, std::vector<int32_t> w) {
    if (n > 2) {
        vector<int> pref(n + 1, 0), suff(n + 1, 0), s0(n + 1, 0);
        for (int i = 0; i < m; i++) {
            if (x[i] == 0) {
                pref[y[i]] += w[i];
                s0[y[i]] += w[i];
            }
            else if (x[i] == 1) suff[y[i]] += w[i];
        }
        for (int i = 1; i < n; i++) pref[i] += pref[i-1];
        for (int i = n - 2; i >= 0; i--) {
            suff[i] += suff[i+1];
            // s0[i] += s0[i + 1];
        }
        int ans = suff[0];
        for (int i = 0; i < n; i++) {
            ans = max(ans, pref[i] + suff[i + 1]);
            if (i < n - 1) ans = max(ans, suff[0] + s0[i + 1]);
        }
        return ans;
    }
    vector<vector<int>> a(2, vector<int> (n, 0));
    for (int i = 0; i < m; i++) a[x[i]][y[i]] = w[i];
    int ans = 0;
    for (int i = 0; i < 2; i++) {
        int tmp = 0;
        for (int j = 1; j < n; j++) tmp = max(tmp, a[i][j]);
        ans += tmp;
    }
    vector<int> pref(n + 1, 0), suff(n + 1, 0), s0(n + 1, 0), p0(n + 1, 0), p2(n + 1, 0);
        for (int i = 0; i < m; i++) {
            if (x[i] == 0) {
                pref[y[i]] += w[i];
                p0[y[i]] += w[i];
            }
            else if (x[i] == 1) {
                suff[y[i]] += w[i];
                s0[y[i]] += w[i];
                p2[y[i]] += w[i];
            }
        }
        for (int i = 1; i < n; i++) {
            pref[i] += pref[i-1];
            p2[i] += p2[i - 1];
        }
        for (int i = n - 2; i >= 0; i--) {
            suff[i] += suff[i+1];
            // s0[i] += s0[i + 1];
        }
        // int ans = suff[0];
        for (int i = 0; i < n; i++) {
            ans = max(ans, pref[i] + s0[i+1]);
            ans = max(ans, p0[i + 1] + p2[i]);
            // if (i < n - 1) ans = max(ans, suff[0] + s0[i + 1]);
        }
    return ans;
}

#ifndef EVAL

int32_t main() {
  int32_t N, M;
  assert(2 == scanf("%d %d", &N, &M));

  std::vector<int32_t> X(M), Y(M), W(M);
  for (int32_t i = 0; i < M; ++i) {
    assert(3 == scanf("%d %d %d", &X[i], &Y[i], &W[i]));
  }

  long long result = max_weights(N, M, X, Y, W);
  printf("%lld\n", result);
  return 0;
}
#endif

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4488 KB Output is correct
2 Correct 37 ms 5296 KB Output is correct
3 Correct 2 ms 2604 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Incorrect 104 ms 10040 KB 1st lines differ - on the 1st token, expected: '149814460735479', found: '0'
6 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 50 ms 6676 KB Output is correct
3 Correct 67 ms 8156 KB Output is correct
4 Correct 26 ms 5036 KB Output is correct
5 Correct 34 ms 5672 KB Output is correct
6 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '4044', found: '6066'
7 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2604 KB Output is correct
2 Incorrect 3 ms 2644 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
3 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 KB 1st lines differ - on the 1st token, expected: '3', found: '2'
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2604 KB Output is correct
2 Incorrect 3 ms 2644 KB 1st lines differ - on the 1st token, expected: '882019', found: '0'
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 4488 KB Output is correct
2 Correct 37 ms 5296 KB Output is correct
3 Correct 2 ms 2604 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Incorrect 104 ms 10040 KB 1st lines differ - on the 1st token, expected: '149814460735479', found: '0'
6 Halted 0 ms 0 KB -