oj.uz

Submission #723776

# Submission time Handle Problem Language Result Execution time Memory
723776 2023-04-14T09:49:37 Z Nelt Catfish Farm (IOI22_fish) C++17
3 / 100
 98 ms 13904 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include "fish.h"

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                    \
  ios_base::sync_with_stdio(0); \
  cin.tie(0);                   \
  cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

ll max_weights(int n, int m, std::vector<int> x, std::vector<int> y,std::vector<int> w)
{
  ll ans = 0, rem = 0;
  for (ll i : w)
    ans += i;
  for (ll i : x)
    rem |= i & 1;
  if (!rem)
    return ans;
  ll dp[n][2], a[n];
  for (ll i = 0; i < n; i++)
    a[i] = 0;
  for (ll i = 0; i < m; i++)
    a[x[i]] = w[i];
  dp[0][0] = a[0];
  dp[0][1] = 0;
  dp[1][0] = a[1];
  dp[1][1] = a[0];
  for (ll i = 2; i < n; i++)
  {
    dp[i][0] = max(max(dp[i - 2][0], dp[i - 2][1]), dp[i - 1][1] + a[0]);
    dp[i][1] = max(dp[i - 2][1] + a[i - 1], max(dp[i - 1][0], dp[i - 1][1])); 
  }
  return max(dp[n - 1][0], dp[n - 1][1]);
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 3512 KB Output is correct
2 Correct 33 ms 4280 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 90 ms 13656 KB Output is correct
6 Correct 98 ms 13904 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 2 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 308 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 308 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 308 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 1 ms 212 KB Output is correct
2 Incorrect 2 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 3512 KB Output is correct
2 Correct 33 ms 4280 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 90 ms 13656 KB Output is correct
6 Correct 98 ms 13904 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Incorrect 70 ms 8968 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '11836568540126'
9 Halted 0 ms 0 KB -