Submission #922296

# Submission time Handle Problem Language Result Execution time Memory
922296 2024-02-05T11:33:12 Z Ludissey Catfish Farm (IOI22_fish) C++17
0 / 100
930 ms 2097152 KB
#include "fish.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<vector<int>> a;
vector<vector<int>> fsh;
vector<vector<int>> prfx;
vector<vector<int>> possprfx;
 
vector<vector<vector<int>>> memo;
int N,M;
//x N possible
//last N possible negatif et pas negatif
//big 3 possible
int dp(int x, int last, int big){
  if(memo[x][last][big]!=-1) return memo[x][last][big];
  if(x==N) {
    return 0;
  }
  int mx = 0;
  for (auto i:fsh[x]) //O(3)
  {
    if(i>last&&big==0) continue;
    int c=0;
    if(i==0) c=dp(x+1, last, 1+(last>0));
    else c+=dp(x+1, i, (i>last));

    if(i==0&&last>0) {
      if(big<2) c+=prfx[x][last-1];
    }
    else if(last>i) {
      c+=prfx[x][last-1]-prfx[x][i-1];
    }
    else if(i>last&&x>0){
      int ng=0;
      if(last>0) ng=prfx[x-1][last-1];
      c+=prfx[x-1][i-1]-ng;
    }
    mx=max(c, mx);
  }
  return memo[x][last][big]=mx;
}
 
long long max_weights(signed n, signed m, std::vector<signed> X, std::vector<signed> Y, std::vector<signed> W) {
  N=n; M=m; 
  fsh.resize(N,vector<int>(1,0));
  prfx.resize(N+1, vector<int>(N+1,0));
  possprfx.resize(N+1, vector<int>(N+1,0));
  memo.resize(N+1, vector<vector<int>>(2*(N+1), vector<int>(3,-1)));
  a.resize(N+1, vector<int>((N+1), 0));
  for (int i = 0; i < M; i++){
    a[X[i]][Y[i]] = W[i];
    //fsh[X[i]+1].push_back(Y[i]+1);
    //if(X[i]>0) fsh[X[i]-1].push_back(Y[i]+1);
  }
  for (int i = 0; i < N; i++) sort(fsh[i].begin(),fsh[i].end()); // N log  N
  for (int i = 0; i < N; i++) //N*N
  {
    for (int j = 0; j < N; j++)
    {
      prfx[i][j]=a[i][j];
      if(j>0) prfx[i][j]+=prfx[i][j-1];
    }
  }
  for (int i = 0; i < N; i++) //N*N
  {
    int mxIndx=-1;
    int mx=0;
    //decrease
    for (int j = 0; j < N; j++)
    {
      possprfx[i][j]-=a[i][j];
      if(j>0) possprfx[i][j]+=possprfx[i][j-1];
      if(i<N-1) possprfx[i][j]+=a[i+1][j];
      if(possprfx[i][j]>mx) { mxIndx=j; mx=possprfx[i][j]; }
    }
    fsh[i].push_back(mxIndx+1);
    mxIndx=-1;
    mx=0;
    //increase
    for (int j = 0; j < N; j++)
    {
      if(j>0) possprfx[i][j]=possprfx[i][j-1];
      if(i>0) possprfx[i][j]+=a[i-1][j];
      if(possprfx[i][j]>mx) { mxIndx=j; mx=possprfx[i][j]; }
    }
    fsh[i].push_back(mxIndx+1);
  }
 
  int p=dp(0,0,1); //(N*2N*2*N) (300*600*300*2) (108.000.000)
  return p;
}
# Verdict Execution time Memory Grader output
1 Runtime error 930 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Runtime error 842 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 815 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 4 ms 3420 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '201629176477'
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 4 ms 3420 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '201629176477'
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 600 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 356 KB Output is correct
7 Correct 0 ms 436 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Incorrect 4 ms 3420 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '201629176477'
10 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 815 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 930 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -