oj.uz

답안 #873307

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873307 2023-11-14T19:49:35 Z Ludissey 메기 농장 (IOI22_fish) C++17
14 / 100
 1000 ms 2097152 KB 
#include "fish.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
map<pair<int,int>, int> a;
vector<vector<int>> fsh;
vector<vector<int>> prfx;
 
map<pair<int,pair<int,int>>, int> memo;
int N,M;
int dp(int x, int last, int big){
  if(memo.find({x,{last,big}})!=memo.end()) return memo[{x,{last,big}}];
  if(x==N) return 0;
 
  memo[{x,{last,big}}] = 0;
  for (auto i:fsh[x])
  {
    int c=0;
    if(i==0){
      if(last<=0) c=dp(x+1, 0, 1);
      else if(last>0) c=dp(x+1,(-last), 1);
    } else if(i>=abs(last)) {
      if(big==0) break;
      c=dp(x+1, i, 1);
    }else if(i<abs(last)){
      c=dp(x+1, i, 0);
    }
    if(x>0) {
      if(last>=0) {
        for (int y = last; y < i; y++) c+=a[{x-1,y}];
        //if(abs(last)<i&&i>0) c+=prfx[x-1][i-1]-prfx[x-1][abs(last)];
        for (int y = i; y < last; y++) c+=a[{x,y}];
      }else{
        for (int y = abs(last); y < i; y++) c+=a[{x-1,y}];
      }
      
    }
    memo[{x,{last,big}}]=max(c, memo[{x,{last,big}}]);
  }
  return memo[{x,{last,big}}];
}
 
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+1, vector<int>(1,0));
  prfx.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());
  for (int i = 0; i < N; i++)
  {
    for (int j = 0; j < N; j++)
    {
      prfx[i][j]=a[{i,j}];
      if(j>0) prfx[i][j]+=prfx[i][j-1];
    }
  }

  int p=dp(0,0,1);
  return p;
}

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 845 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Runtime error 798 ms 2097152 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 747 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 2176 KB Output is correct
10 Correct 38 ms 7516 KB Output is correct
11 Correct 12 ms 2148 KB Output is correct
12 Correct 25 ms 7256 KB Output is correct
13 Correct 2 ms 864 KB Output is correct
14 Correct 20 ms 7200 KB Output is correct

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 2176 KB Output is correct
10 Correct 38 ms 7516 KB Output is correct
11 Correct 12 ms 2148 KB Output is correct
12 Correct 25 ms 7256 KB Output is correct
13 Correct 2 ms 864 KB Output is correct
14 Correct 20 ms 7200 KB Output is correct
15 Correct 25 ms 7016 KB Output is correct
16 Correct 466 ms 1528 KB Output is correct
17 Execution timed out 1059 ms 9616 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 6 ms 2176 KB Output is correct
10 Correct 38 ms 7516 KB Output is correct
11 Correct 12 ms 2148 KB Output is correct
12 Correct 25 ms 7256 KB Output is correct
13 Correct 2 ms 864 KB Output is correct
14 Correct 20 ms 7200 KB Output is correct
15 Correct 25 ms 7016 KB Output is correct
16 Correct 466 ms 1528 KB Output is correct
17 Execution timed out 1059 ms 9616 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 747 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 845 ms 2097152 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -