oj.uz

답안 #830638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
830638 2023-08-19T08:47:15 Z NeroZein 메기 농장 (IOI22_fish) C++17
14 / 100
 122 ms 220720 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

const int N = 302;
int n; 
int a[N][N]; 
int max_m, max_n;
long long pref[N][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 <= min(n, 11); ++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

# 결과 실행 시간 메모리 Grader output
1 Incorrect 92 ms 218988 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '6031663374020881'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 70 ms 215788 KB Output is correct
2 Incorrect 122 ms 220720 KB 1st lines differ - on the 1st token, expected: '40604614618209', found: '6707562537929743'
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 215840 KB 1st lines differ - on the 1st token, expected: '10082010', found: '20164020'
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 215896 KB Output is correct
2 Correct 76 ms 215880 KB Output is correct
3 Correct 67 ms 215792 KB Output is correct
4 Correct 66 ms 215852 KB Output is correct
5 Correct 66 ms 215820 KB Output is correct
6 Correct 66 ms 215896 KB Output is correct
7 Correct 66 ms 215788 KB Output is correct
8 Correct 67 ms 215808 KB Output is correct
9 Correct 69 ms 216416 KB Output is correct
10 Correct 71 ms 217000 KB Output is correct
11 Correct 70 ms 216396 KB Output is correct
12 Correct 71 ms 216976 KB Output is correct
13 Correct 68 ms 216132 KB Output is correct
14 Correct 73 ms 216956 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 215896 KB Output is correct
2 Correct 76 ms 215880 KB Output is correct
3 Correct 67 ms 215792 KB Output is correct
4 Correct 66 ms 215852 KB Output is correct
5 Correct 66 ms 215820 KB Output is correct
6 Correct 66 ms 215896 KB Output is correct
7 Correct 66 ms 215788 KB Output is correct
8 Correct 67 ms 215808 KB Output is correct
9 Correct 69 ms 216416 KB Output is correct
10 Correct 71 ms 217000 KB Output is correct
11 Correct 70 ms 216396 KB Output is correct
12 Correct 71 ms 216976 KB Output is correct
13 Correct 68 ms 216132 KB Output is correct
14 Correct 73 ms 216956 KB Output is correct
15 Incorrect 74 ms 216896 KB 1st lines differ - on the 1st token, expected: '299', found: '11'
16 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 66 ms 215896 KB Output is correct
2 Correct 76 ms 215880 KB Output is correct
3 Correct 67 ms 215792 KB Output is correct
4 Correct 66 ms 215852 KB Output is correct
5 Correct 66 ms 215820 KB Output is correct
6 Correct 66 ms 215896 KB Output is correct
7 Correct 66 ms 215788 KB Output is correct
8 Correct 67 ms 215808 KB Output is correct
9 Correct 69 ms 216416 KB Output is correct
10 Correct 71 ms 217000 KB Output is correct
11 Correct 70 ms 216396 KB Output is correct
12 Correct 71 ms 216976 KB Output is correct
13 Correct 68 ms 216132 KB Output is correct
14 Correct 73 ms 216956 KB Output is correct
15 Incorrect 74 ms 216896 KB 1st lines differ - on the 1st token, expected: '299', found: '11'
16 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 68 ms 215840 KB 1st lines differ - on the 1st token, expected: '10082010', found: '20164020'
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 92 ms 218988 KB 1st lines differ - on the 1st token, expected: '40313272768926', found: '6031663374020881'
2 Halted 0 ms 0 KB -