# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
825106 | alvingogo | Catfish Farm (IOI22_fish) | C++17 | 467 ms | 98672 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 fs first
#define sc second
#define p_q priority_queue
using namespace std;
const long long inf=1e16;
long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
set<int> tw;
for(int i=0;i<m;i++){
if(y[i]==0){
tw.insert(x[i]);
}
}
vector<vector<pair<int,long long> > > v(n);
for(int i=0;i<n;i++){
v[i].push_back({-2,0});
if(tw.find(i)!=tw.end()){
continue;
}
x.push_back(i);
y.push_back(0);
w.push_back(0);
}
m=x.size();
vector<vector<int> > lis(n);
vector<int> s(n),vs(n);
for(int i=0;i<m;i++){
v[x[i]].push_back({y[i],w[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... |