제출 #1169695

#제출 시각아이디문제언어결과실행 시간메모리
1169695thelegendary08Catfish Farm (IOI22_fish)C++17
0 / 100
52 ms8776 KiB
#include "fish.h" #include<bits/stdc++.h> #define int long long #define vi vector<int> #define pb push_back #define f0r(i,n) for(int i = 0; i<n; i++) #define FOR(i, k, n) for(int i = k; i<n; i++) using namespace std; int max_weights(signed n, signed m, std::vector<signed> x, std::vector<signed> y, std::vector<signed> w) { int ans = 0; vi a(n, -1); vi b(n, -1); f0r(i,m){ if(x[i] == 0){ a[y[i]] = w[i]; } else{ b[y[i]] = w[i]; } } f0r(i, n){ if(b[i] != -1)ans += b[i]; } int cur = ans; f0r(i,n){ if(a[i] != -1){ cur += a[i]; } if(b[i] != -1)cur -= b[i]; ans = max(ans, cur); } 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...