Submission #1072389

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072389		vjudge1	Catfish Farm (IOI22_fish)	C++17	0 / 100	28 ms	10184 KiB

fish

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
 
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)

bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
const int N = 1e5 + 7;
ll dp[N][2][2];
ll max_weights(int n,int m,vi x,vi y,vi w){
    vi arr(n+2, 0);
    fo(i, m) {
        arr[x[i]+2] = w[i];
    }
    fore(i, 2, n+2) {
        dp[i][1][1] = max(dp[i-1][1][1], dp[i-1][1][0]);
        dp[i][1][0] = max(dp[i-1][0][1], dp[i-1][0][0] + arr[i-1]);
        dp[i][0][1] = max(dp[i-1][1][0] + arr[i], dp[i-1][1][1] + arr[i]);
        dp[i][0][0] = max(dp[i-1][0][1], dp[i-1][0][0]);
    }
    return max({dp[n+1][0][0], dp[n+1][0][1], dp[n+1][1][0], dp[n+1][1][1]});
}
// void test_case(){

// }

// int main(){cin.tie(0)->sync_with_stdio(0);
//     int t=1;
//     // cin >> t;
//     while(t--)test_case();
// }

• Subtask 1: 0 / 3
• Subtask 2: 0 / 6
• Subtask 3: 0 / 9
• Subtask 4: 0 / 14
• Subtask 5: 0 / 21
• Subtask 6: 0 / 17
• Subtask 7: 0 / 14
• Subtask 8: 0 / 16