#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];
}
};
namespace TEST4 {
ll solve(int N, int M, VI X, VI Y, VI W) {
int n = N+3;
int m = min(9, N);
VVL a(n+1, VL(m));
rep(i, M) a[X[i]+3][Y[i]] = W[i];
VVL dp(n, VL(m));
/*
* dp[i][j]
* patasxan@, ete amenaverjin@ i-rd
* vandakum e u ira boy@ j e
*/
VL dp2(n);
/* dp2[i]
* patasxan@ ete amenaverjin@ i-rd
* vandakum e kam aveli dzax
*/
replr(i, 3, n-1) {
replr(k, 0, m-1) {
replr(prevk, 0, m-1) {
if (true) {
ll sum = 0;
replr(l, 0, k) {
sum += a[i+1][l];
if (l <= min(k, prevk)) sum -= a[i][l];
else sum += a[i-1][l];
}
setmin(dp[i][k], dp[i-1][prevk] + sum);
}
if (true) {
ll sum = 0;
replr(l, 0, k) {
sum += a[i+1][l];
}
setmin(dp[i][k], dp[i-2][prevk] + sum);
}
}
ll sum = 0;
replr(l, 0, k) {
sum += a[i-1][l];
sum += a[i+1][l];
}
setmax(dp[i][k], dp2[i-3] + sum);
setmax(dp2[i], dp[i][k]);
}
}
return dp2[n-1];
}
};
ll max_weights(int N, int M, VI X, VI Y, VI W) {
return TEST4::solve(N, M, X, Y, W);
solvefor(TEST1);
solvefor(TEST2);
solvefor(TEST3);
return -1;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
96 ms |
40148 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '2', found: '1' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
87 ms |
21340 KB |
1st lines differ - on the 1st token, expected: '10082010', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
1st lines differ - on the 1st token, expected: '3', found: '2' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
87 ms |
21340 KB |
1st lines differ - on the 1st token, expected: '10082010', found: '0' |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
96 ms |
40148 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |