oj.uz

Submission #830632

# Submission time Handle Problem Language Result Execution time Memory
830632 2023-08-19T08:45:20 Z NeroZein Catfish Farm (IOI22_fish) C++17
0 / 100
 1000 ms 446724 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 302;
int n; 
int a[N][N]; 
int pref[N][N]; 
int max_m, max_n;
long long dp[N][N][N]; 

long long bt(int col, int last, int last2) {
  if (col > n) {
    return 0;
  }
  long long& ret = dp[col][last][last2];
  if (ret != -1) {
    return ret;
  }
  long long sum = 0; 
  long long ps = pref[col][last]; 
  for (int nlast = 0; nlast <= n; ++nlast) {
    if (nlast > last2 && nlast > last) sum += a[col - 1][nlast];
    if (nlast <= last) ps -= a[col][nlast];
    //if (sum) assert(ps == 0);
    ret = max(ret, bt(col + 1, nlast, last) + sum + ps); 
  }
  return ret;
}

long long max_weights(int N_, int M, vector<int> X, vector<int> Y, vector<int> W) {
  n = N_; 
  for (int i = 0; i < M; ++i) {
    max_m = max(max_m, X[i] + 1); 
    max_n = max(max_n, Y[i] + 1); 
    a[X[i] + 1][Y[i] + 1] = W[i];
  }
  for (int i = 1; i <= max_m; ++i) {
    for (int j = 1; j <= max_n; ++j) {
      pref[i][j] = pref[i][j - 1] + a[i][j];      
    } 
  }
  memset(dp, -1, sizeof dp);
  return bt(1, 0, 0); 
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Runtime error 256 ms 442820 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 68 ms 215844 KB Output is correct
2 Runtime error 270 ms 446724 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Runtime error 247 ms 437592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 215788 KB Output is correct
2 Correct 72 ms 215860 KB Output is correct
3 Correct 70 ms 215824 KB Output is correct
4 Correct 81 ms 215896 KB Output is correct
5 Correct 71 ms 215884 KB Output is correct
6 Correct 70 ms 215872 KB Output is correct
7 Correct 70 ms 215888 KB Output is correct
8 Correct 79 ms 215784 KB Output is correct
9 Execution timed out 1104 ms 216152 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 215788 KB Output is correct
2 Correct 72 ms 215860 KB Output is correct
3 Correct 70 ms 215824 KB Output is correct
4 Correct 81 ms 215896 KB Output is correct
5 Correct 71 ms 215884 KB Output is correct
6 Correct 70 ms 215872 KB Output is correct
7 Correct 70 ms 215888 KB Output is correct
8 Correct 79 ms 215784 KB Output is correct
9 Execution timed out 1104 ms 216152 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 215788 KB Output is correct
2 Correct 72 ms 215860 KB Output is correct
3 Correct 70 ms 215824 KB Output is correct
4 Correct 81 ms 215896 KB Output is correct
5 Correct 71 ms 215884 KB Output is correct
6 Correct 70 ms 215872 KB Output is correct
7 Correct 70 ms 215888 KB Output is correct
8 Correct 79 ms 215784 KB Output is correct
9 Execution timed out 1104 ms 216152 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# Verdict Execution time Memory Grader output
1 Runtime error 247 ms 437592 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# Verdict Execution time Memory Grader output
1 Runtime error 256 ms 442820 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -