Submission #901718

#	Time	Username	Problem	Language	Result	Execution time	Memory
901718		iliccmarko	Catfish Farm (IOI22_fish)	C++17	3 / 100	225 ms	38764 KiB

fish

#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 10000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL

ll levoo(int i, vector<ll> &levo, int n) {
    if (i < 0 || i >= n)
        return 0;
    return levo[i];
}

ll desnoo(int i, vector<ll> &desno, int n) {
    if (i < 0 || i >= n)
        return 0;
    return desno[i];
}

ll dpp(int i, int j, vector<vector<ll> > &dp, int n) {
    if (i < 0 || i >= n)
        return 0;
    return dp[i][j];
}

ll vall(int i, vector<ll> &val, int n) {
    if (i < 0 || i >= n)
        return 0;
    return val[i];
}

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
  vector<ll> val(n, 0);
  vector<set<pair<ll, ll> > > visine(n);
  vector<ll> desno(n, 0), levo(n, 0);

  for (int i = 0; i < m; ++i) {
    visine[x[i]].insert({y[i], i});
    val[x[i]] += (ll)w[i];
  }

  ll sigurno = 0;
  for (int i = 0; i < n; ++i) {
    ll cnt = 0;
    if (i - 1 >= 0) {
        for (auto u : visine[i]) {
            if (y[u.second] >= (*visine[i - 1].begin()).first)
                break;
            cnt += (ll)w[u.second];
        }
        levo[i] = cnt;
    }
    if (i + 1 < n) {
        cnt = 0;
        for (auto u : visine[i]) {
            if (y[u.second] >= (*visine[i + 1].begin()).first)
                break;
            cnt += (ll)w[u.second];
        }
        desno[i] = cnt;
    }
  }

  vector<vector<ll> > dp(n, vector<ll>(2, 0));
  for (int i = 0; i < n; ++i) {
        dp[i][0] = max(vall(i - 1, val, n) + max({dpp(i - 2, 0, dp, n), desnoo(i - 2, desno, n) + max({dpp(i - 3, 0, dp, n), dpp(i - 3, 1, dp, n)})}), dpp(i - 2, 1, dp, n));
        dp[i][1] = ((i - 1 >= 0) ? val[i] : 0LL) + max(dpp(i - 2, 0, dp, n), dpp(i - 2, 1, dp, n));
  }
  ll jos = 0;
  if (n >= 2) {
    jos = dp[n - 2][1] + levo[n - 1];
  }

  return max({dp[n - 1][0], dp[n - 1][1], jos});

}

Compilation message (stderr)

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:51:6: warning: unused variable 'sigurno' [-Wunused-variable]
   51 |   ll sigurno = 0;
      |      ^~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16