제출 #1022749

#제출 시각아이디문제언어결과실행 시간메모리
1022749vjudge1메기 농장 (IOI22_fish)C++17
0 / 100
70 ms25964 KiB
#include "fish.h" #include<bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define pii pair<int, int> #define ff first #define ss second const int MAXN = 200100; int n, w[MAXN], m; pii a[MAXN]; namespace A{ ll solve(){ ll ans = 0; for(int i=1; i<=m; i++){ ans += w[i]; } return ans; } } long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { n = N; m = M; for(int i=1; i<=m; i++){ a[i] = {X[i-1], Y[i-1]}; } for(int i=1; i<=m; i++){ w[i] = W[i-1]; } int ok1 = 1; for(int i=1; i<=m; i++){ ok1 &= (a[i].ff % 2 == 0); } if(ok1) return A::solve(); return 0; }
#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...