# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
850835 | 2023-09-17T13:41:34 Z | AliHasanli | Catfish Farm (IOI22_fish) | C++17 | 179 ms | 20816 KB |
#include <iostream> #include <vector> #include<map> using namespace std; map<int,int>mX,mY; long long max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) { for(int i=0;i<X.size();i++) { mX[X[i]]=1; mY[Y[i]]=1; } if(N==1) return 0; bool check=true; int maxX=0; for(int i:X) maxX=max(maxX,i); for(int i:X) if(i%2) { check=false; break; } long long ans=0; if(check) { for(int i=0;i<W.size();i++) ans+=W[i]; return ans; } if(maxX==0) { for(int i=0;i<W.size();i++) ans+=W[i]; return ans; } if(maxX==1) { long long ansX0=0,ansX1=0,ans=0; for(int i=0;i<X.size();i++) if(X[i]==1) ansX1+=W[i]; ans=ansX1; for(int i=0;i<N;i++) { if(mY[i]==1 && mX[1]==1) ansX1-=W[i]; if(mY[i]==1 && mX[0]==1) ansX0+=W[i]; ans=max(ans,ansX0+ansX1); } return ans; } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 38 ms | 7504 KB | Output is correct |
2 | Correct | 48 ms | 9092 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 130 ms | 18512 KB | Output is correct |
6 | Correct | 179 ms | 20816 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '2', found: '1' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '882019', found: '0' |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | 1st lines differ - on the 1st token, expected: '3', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | 1st lines differ - on the 1st token, expected: '3', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | 1st lines differ - on the 1st token, expected: '3', found: '0' |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '882019', found: '0' |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 38 ms | 7504 KB | Output is correct |
2 | Correct | 48 ms | 9092 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 130 ms | 18512 KB | Output is correct |
6 | Correct | 179 ms | 20816 KB | Output is correct |
7 | Incorrect | 0 ms | 344 KB | 1st lines differ - on the 1st token, expected: '2', found: '1' |
8 | Halted | 0 ms | 0 KB | - |