제출 #1214719

#제출 시각아이디문제언어결과실행 시간메모리
1214719dosts메기 농장 (IOI22_fish)C++20
6 / 100
53 ms8776 KiB
#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 fs(N+1,0),sc(N+1,0); int smy=0,smx = 0; for (int i = 0;i<M;i++) { if (!X[i]) fs[Y[i]+1] = W[i],smx+=W[i]; else sc[Y[i]+1] = W[i],smy+=W[i]; } int ans = smy; if (N > 2) { for (int i=1;i<=N;i++) { smy-=sc[i]; smy+=fs[i]; ans = max(ans,smy); } } else ans = max(ans,smx); return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...