oj.uz

답안 #1037492

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037492 2024-07-29T00:58:46 Z HappyCapybara 메기 농장 (IOI22_fish) C++17
0 / 100
 53 ms 49492 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

int n;
unordered_map<ll,ll> dp;
vector<vector<ll>> v;

ll solve(int c, int p1, int p2){
  if (c == n) return 0;
  if (dp.find(c*100+(p1+1)*10+p2+1) != dp.end()) return dp[c*100+(p1+1)*10+p2+1];
  ll cur = 0, res = 0;
  for (int i=-1; i<max(n, 9); ){
    //if (c == 4 && p1 == -1 && p2 == -1) cout << i << " " << cur << "\n";
    res = max((ll) res, (ll) cur+ (ll) solve(c+1, i, p1));
    i++;
    if ((c > 0) && (p1 < i) && (c == 1 || p2 < i)) cur += v[c-1][i];
    if (c < n-1) cur += v[c+1][i];
    if ((c > 0) && (p1 >= i)) cur -= v[c][i];
  }
  //cout << c << " " << p1 << " " << p2 << " " << res << "\n";
  return dp[c*100+(p1+1)*10+p2+1] = res;
}

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
  n = N;
  v.resize(N, vector<ll>(9, 0));
  for (int i=0; i<M; i++) v[X[i]][Y[i]] = W[i];
  return solve(0, 0, 0);
}

Subtask #1
0 / 3.0

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

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 600 KB Output is correct
2 Runtime error 53 ms 49492 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
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 1 ms 348 KB Output is correct
5 Correct 0 ms 600 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 Incorrect 29 ms 1128 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '25200414713152259'
10 Halted 0 ms 0 KB -

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 1 ms 348 KB Output is correct
5 Correct 0 ms 600 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 Incorrect 29 ms 1128 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '25200414713152259'
10 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 1 ms 348 KB Output is correct
5 Correct 0 ms 600 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 Incorrect 29 ms 1128 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '25200414713152259'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

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

Subtask #8
0 / 16.0

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