제출 #1329883

#제출 시각아이디문제언어결과실행 시간메모리
1329883srividya_06메기 농장 (IOI22_fish)C++20
0 / 100
50 ms7260 KiB
#include <bits/stdc++.h>
#define REP(i,a,b) for(long long i = a; i<b; i++)
using namespace std;
typedef long long ll;
ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
    ll res1 = 0;
    ll res2 = 0;
    int y = 1e9;
    REP(i,0,M){
        if(X[i] == 0) res1+=W[i];
        else{
            y = min(y,Y[i]);
            res2+=W[i];
        }
    }
    REP(i,0,M){
        if(X[i] == 0 && Y[i] < y){
            res2+= W[i];
        }
    }
    return max(res2,res1);
}
#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...