제출 #1214713

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1214713		dosts	Catfish Farm (IOI22_fish)	C++20	0 / 100	54 ms	8776 KiB

fish

#include "fish.h"
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#define int long long
#define pii pair<int,int>
#define vi vector<int>
#define ff first
#define ss second
#define sp << " " <<
#define all(x) x.begin(),x.end()
#define big(x) ((int)(x.size()))
using namespace std;
const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9;
const int NN = 100001;

int max_weights(int32_t N, int32_t M, vector<int32_t> X,vector<int32_t> Y, vector<int32_t> W) {
  vi pref(N+1,0),suf(N+1,0);
  for (int i=0;i<M;i++) {
    if (X[i] == 0) pref[Y[i]+1]+=W[i];
    else suf[Y[i]+1]+=W[i];
  }
  for (int i=1;i<=N;i++) pref[i]+=pref[i-1];
  for (int i = N-1;i>=0;i--) suf[i]+=suf[i+1];
  int ans = 0;
  for (int i = 0;i<N;i++) ans = max(ans,pref[i]+suf[i+1]);
  ans = max(ans,suf[1]);
  ans = max(ans,pref[N]);
  return ans;
}

• 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