oj.uz

Submission #901742

# Submission time Handle Problem Language Result Execution time Memory
901742 2024-01-10T01:46:23 Z iliccmarko Catfish Farm (IOI22_fish) C++17
12 / 100
 228 ms 38768 KB 
#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>(3, 0));
  for (int i = 0; i < n; ++i) {
    dp[i][0] = max({vall(i - 1, val, n) + max({dpp(i - 2, 2, dp, n), desnoo(i - 2, desno, n) + dpp(i - 2, 1, dp, n), dpp(i - 2, 0, dp, n)}), dpp(i - 1, 2, dp, n), dpp(i - 1, 0, dp, n)});
    dp[i][1] = max(dpp(i - 1, 1, dp, n), dpp(i - 1, 2, dp, n));
    dp[i][2] = ((i - 1 >= 0) ? val[i] : 0) + dpp(i - 1, 0, dp, n);
  }
  ll jos = 0;
  if (n >= 2) {
    jos = dp[n - 2][2] + levo[n - 1];
  }

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

}

Compilation message

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.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 18516 KB Output is correct
2 Correct 63 ms 21332 KB Output is correct
3 Correct 8 ms 12892 KB Output is correct
4 Correct 9 ms 12844 KB Output is correct
5 Correct 228 ms 38740 KB Output is correct
6 Correct 194 ms 38768 KB Output is correct

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 111 ms 25424 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40479197388443'
3 Halted 0 ms 0 KB -

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 12892 KB Output is correct
2 Correct 8 ms 12892 KB Output is correct
3 Correct 25 ms 16220 KB Output is correct
4 Correct 21 ms 16472 KB Output is correct
5 Correct 51 ms 22864 KB Output is correct
6 Correct 49 ms 22356 KB Output is correct
7 Correct 47 ms 22864 KB Output is correct
8 Correct 45 ms 22864 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 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 0 ms 344 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 0 ms 344 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 8 ms 12892 KB Output is correct
2 Correct 8 ms 12892 KB Output is correct
3 Correct 25 ms 16220 KB Output is correct
4 Correct 21 ms 16472 KB Output is correct
5 Correct 51 ms 22864 KB Output is correct
6 Correct 49 ms 22356 KB Output is correct
7 Correct 47 ms 22864 KB Output is correct
8 Correct 45 ms 22864 KB Output is correct
9 Incorrect 47 ms 22872 KB 1st lines differ - on the 1st token, expected: '99999', found: '74999'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 51 ms 18516 KB Output is correct
2 Correct 63 ms 21332 KB Output is correct
3 Correct 8 ms 12892 KB Output is correct
4 Correct 9 ms 12844 KB Output is correct
5 Correct 228 ms 38740 KB Output is correct
6 Correct 194 ms 38768 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Incorrect 111 ms 25424 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '40479197388443'
9 Halted 0 ms 0 KB -