# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852739 | abcvuitunggio | Catfish Farm (IOI22_fish) | C++17 | 467 ms | 180928 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "fish.h"
#include <bits/stdc++.h>
#define MX mx[i][idx][b]
#define int long long
using namespace std;
const int INF=1e18;
vector <int> v[100001];
vector <pair <int, int>> s[100001],mx[100002][4][2];
int n,m,x,y,res;
void update(int pos, int val, int i, int idx){
mx[pos][idx][0].push_back({i,val});
mx[pos][idx][1].push_back({n-i-1,val});
}
int get(int pos, int i, int idx, int b){
if (b)
pos=n-pos-1;
int p=upper_bound(MX.begin(),MX.end(),make_pair(pos,INF))-MX.begin()-1;
return (p<0?-INF:MX[p].second);
}
int sum(int i, int j){
if (i<0)
return 0;
return s[i][upper_bound(s[i].begin(),s[i].end(),make_pair(j,INF))-s[i].begin()-1].second;
}
int max_weights(int32_t N, int32_t M, vector <int32_t> X, vector <int32_t> Y, vector <int32_t> W){
n=N;
for (int i=0;i<M;i++){
s[X[i]].push_back({Y[i],W[i]});
if (X[i])
v[X[i]-1].push_back(Y[i]);
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |