| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 682844 | irmuun | Catfish Farm (IOI22_fish) | C++17 | 22 ms | 2124 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<bits/stdc++.h>
#include "fish.h"
using namespace std;
#define ll long long
long long max_weights(int n,int m,vector<int>x,vector<int>y,vector<int>w){
int count=0,X=-1,Y=-1;
for(int i=0;i<m;i++){
if(x[i]%2==0){
count++;
}
X=max(X,x[i]);
Y=max(Y,y[i]);
}
if(count==m){//subtask1
ll ans=0;
for(int i=0;i<n;i++){
ans+=w[i];
}
return ans;
}
if(X<=1){//subtask2
ll res=0;
int dp[n+5][2];
for(int i=0;i<n;i++){
dp[i][0]=0;
dp[i][1]=0;
}
ll ans;
for(int i=0;i<m;i++){
if(x[i]==1){
res+=w[i];
}
dp[y[i]+1][x[i]]=w[i];
}
ans=res;
for(int i=1;i<=n;i++){
res+=dp[i][0]-dp[i][1];
ans=max(ans,res);
}
return ans;
}
}
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... | ||||
