oj.uz

Submission #1070021

# Submission time Handle Problem Language Result Execution time Memory
1070021 2024-08-22T11:04:18 Z c2zi6 Catfish Farm (IOI22_fish) C++17
9 / 100
 64 ms 10940 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;
    }
};

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

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3236 KB Output is correct
2 Correct 17 ms 3932 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 53 ms 10900 KB Output is correct
6 Correct 64 ms 10940 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 43 ms 9796 KB Output is correct
3 Correct 64 ms 10504 KB Output is correct
4 Correct 29 ms 3236 KB Output is correct
5 Correct 18 ms 3912 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 23 ms 6572 KB Output is correct
13 Correct 26 ms 7188 KB Output is correct
14 Correct 39 ms 6428 KB Output is correct
15 Correct 24 ms 7020 KB Output is correct
16 Correct 39 ms 6596 KB Output is correct
17 Correct 24 ms 6884 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 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 1 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 1 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 348 KB Output is correct
2 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '882019', found: '-1'
3 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3236 KB Output is correct
2 Correct 17 ms 3932 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 53 ms 10900 KB Output is correct
6 Correct 64 ms 10940 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 43 ms 9796 KB Output is correct
9 Correct 64 ms 10504 KB Output is correct
10 Correct 29 ms 3236 KB Output is correct
11 Correct 18 ms 3912 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 23 ms 6572 KB Output is correct
19 Correct 26 ms 7188 KB Output is correct
20 Correct 39 ms 6428 KB Output is correct
21 Correct 24 ms 7020 KB Output is correct
22 Correct 39 ms 6596 KB Output is correct
23 Correct 24 ms 6884 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Incorrect 1 ms 348 KB 1st lines differ - on the 1st token, expected: '882019', found: '-1'
26 Halted 0 ms 0 KB -