oj.uz

Submission #1070059

# Submission time Handle Problem Language Result Execution time Memory
1070059 2024-08-22T11:21:28 Z c2zi6 Catfish Farm (IOI22_fish) C++17
18 / 100
 58 ms 10904 KB 
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define replr(i, a, b) for (int i = int(a); i <= int(b); ++i)
#define reprl(i, a, b) for (int i = int(a); i >= int(b); --i)
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define mkp(a, b) make_pair(a, b)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VPI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<VPI> VVPI;
typedef pair<ll, ll> PLL;
typedef vector<ll> VL;
typedef vector<PLL> VPL;
typedef vector<VL> VVL;
typedef vector<VVL> VVVL;
typedef vector<VPL> VVPL;
template<class T> T setmax(T& a, T b) {if (a < b) return a = b; return a;}
template<class T> T setmin(T& a, T b) {if (a < b) return a; return a = b;}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template<class T>
using indset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#include "fish.h"

#define solvefor(a) if (a::check(N, M, X, Y, W)) return a::solve(N, M, X, Y, W);

namespace TEST1 {
    bool check(int N, int M, VI X, VI Y, VI W) {
        for (int x : X) if (x & 1) return false;
        return true;
    }
    ll solve(int N, int M, VI X, VI Y, VI W) {
        ll ans = 0;
        for (int x : W) ans += x;
        return ans;
    }
};
namespace TEST2 {
    bool check(int N, int M, VI X, VI Y, VI W) {
        for (int x : X) if (x > 1) return false;
        return true;
    }
    struct POINT {
        int x, y, w;
    };
    ll solve(int N, int M, VI X, VI Y, VI W) {
        if (N == 2) {
            ll sum[2]{};
            rep(i, M) sum[X[i]] += W[i];
            return max(sum[0], sum[1]);
        }
        vector<POINT> vec;
        rep(i, M) vec.pb({X[i], Y[i], W[i]});
        int n = vec.size();
        sort(all(vec), [](const POINT& a, const POINT& b){return make_tuple(a.y, -a.x, a.w) < make_tuple(b.y, -b.x, b.w);});

        ll sum = 0;
        rep(i, n) if (vec[i].x == 1) sum += vec[i].w;
        ll ans = sum;
        rep(i, n) {
            if (vec[i].x == 1) sum -= vec[i].w;
            else sum += vec[i].w;
            setmax(ans, sum);
        }
        return ans;
    }
};
namespace TEST3 {
    bool check(int N, int M, VI X, VI Y, VI W) {
        for (int x : Y) if (x != 0) return false;
        return true;
    }
    ll solve(int N, int M, VI X, VI Y, VI W) {
        int n = N+3;
        VL a(n+2);
        rep(i, M) a[X[i]+3] = W[i];
        VL dp(n);
        replr(i, 3, n-1) {
            dp[i] = dp[i-1];
            setmax(dp[i], dp[i-3] + a[i-1] + a[i+1]);
            setmax(dp[i], dp[i-2] + a[i+1]);
            setmax(dp[i], dp[i-1] - a[i] + a[i+1]);
        }
        return dp[n-1];
    }
};


ll max_weights(int N, int M, VI X, VI Y, VI W) {
    solvefor(TEST1);
    solvefor(TEST2);
    solvefor(TEST3);
    return -1;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3240 KB Output is correct
2 Correct 19 ms 3924 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 58 ms 10904 KB Output is correct
6 Correct 57 ms 10904 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 45 ms 10820 KB Output is correct
3 Correct 56 ms 10500 KB Output is correct
4 Correct 14 ms 3240 KB Output is correct
5 Correct 25 ms 3924 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 22 ms 5192 KB Output is correct
13 Correct 27 ms 5556 KB Output is correct
14 Correct 22 ms 5152 KB Output is correct
15 Correct 25 ms 5336 KB Output is correct
16 Correct 22 ms 5148 KB Output is correct
17 Correct 24 ms 5496 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 11 ms 3736 KB Output is correct
4 Correct 8 ms 3216 KB Output is correct
5 Correct 18 ms 5284 KB Output is correct
6 Correct 18 ms 5284 KB Output is correct
7 Correct 20 ms 5548 KB Output is correct
8 Correct 19 ms 5540 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 1884 KB Output is correct
3 Correct 11 ms 3736 KB Output is correct
4 Correct 8 ms 3216 KB Output is correct
5 Correct 18 ms 5284 KB Output is correct
6 Correct 18 ms 5284 KB Output is correct
7 Correct 20 ms 5548 KB Output is correct
8 Correct 19 ms 5540 KB Output is correct
9 Incorrect 18 ms 3928 KB 1st lines differ - on the 1st token, expected: '99999', found: '-1'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 3240 KB Output is correct
2 Correct 19 ms 3924 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 600 KB Output is correct
5 Correct 58 ms 10904 KB Output is correct
6 Correct 57 ms 10904 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 45 ms 10820 KB Output is correct
9 Correct 56 ms 10500 KB Output is correct
10 Correct 14 ms 3240 KB Output is correct
11 Correct 25 ms 3924 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 22 ms 5192 KB Output is correct
19 Correct 27 ms 5556 KB Output is correct
20 Correct 22 ms 5152 KB Output is correct
21 Correct 25 ms 5336 KB Output is correct
22 Correct 22 ms 5148 KB Output is correct
23 Correct 24 ms 5496 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 1 ms 1884 KB Output is correct
26 Correct 11 ms 3736 KB Output is correct
27 Correct 8 ms 3216 KB Output is correct
28 Correct 18 ms 5284 KB Output is correct
29 Correct 18 ms 5284 KB Output is correct
30 Correct 20 ms 5548 KB Output is correct
31 Correct 19 ms 5540 KB Output is correct
32 Incorrect 0 ms 348 KB 1st lines differ - on the 1st token, expected: '3', found: '-1'
33 Halted 0 ms 0 KB -