# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174095 | irmuun | Catfish Farm (IOI22_fish) | C++17 | 191 ms | 32236 KiB |
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define all(s) s.begin(),s.end()
#define rall(s) s.rbegin(),s.rend()
const ll N=1e5+5;
int n,m,sz[N];
vector<ll>dp[2][N];
vector<pair<int,int>>f[N];
ll max_weights(int N,int M,vector<int>X,vector<int>Y,vector<int>W){
n=N,m=M;
for(int i=0;i<n;i++){
f[i].pb({0,0});
}
for(int i=0;i<m;i++){
f[X[i]].pb({Y[i],W[i]});
}
for(int i=0;i<n;i++){
f[i].pb({n,0});
}
for(int i=0;i<n;i++){
# | 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... |