| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1234690 | Muhammad_Aneeq | 메기 농장 (IOI22_fish) | C++17 | 50 ms | 7276 KiB |
#include "fish.h"
#include <vector>
#include <iostream>
using namespace std;
int const N=310;
long long dp[N][N][2]={};
long long gr[N][N]={},pre[N][N]={}; // 0 if we are updating it from behind 1 if being updated from
long long max_weights(int N, int M, vector<int> X, vector<int> Y,vector<int> W)
{
long long ans=0;
for (int i=0;i<M;i++)
ans+=W[i];
return ans;
}
| # | 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... | ||||
