oj.uz

답안 #1037448

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1037448 2024-07-28T22:27:47 Z HappyCapybara 메기 농장 (IOI22_fish) C++17
0 / 100
 1000 ms 204556 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long

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

ll solve(int c, int p1, int p2){
  if (c == n) return 0;
  if (dp.find((ll)c*(ll)pow(10,12)+(ll)p1*(ll)pow(10,6)+(ll)p2) != dp.end()) return dp[(ll)c*(ll)pow(10,12)+(ll)p1*(ll)pow(10,6)+(ll)p2];
  ll cur = 0, res = 0;
  int l = 0, r = 0;
  while (r < v[c].size()){
    res = max(res, cur+solve(c+1, r, p1));
    //if (c == 3 && p1 == 2 && p2 == 0) cout << r << " " << res << "\n";
    while (c != 0 && l < p1 && v[c-1][l+1] <= v[c][r+1]){
      l++;
      cur -= m[(ll) c*100001 + (ll) v[c-1][l]];
    }
    r++;
    if (c < n-1) cur += m[(ll) (c+1)*100001 + (ll) v[c][r]];
    if (c > 0 && v[c-1][p1] < v[c][r] && (c == 1 || v[c][r] > v[c-2][p2])) cur += m[(ll) (c-1)*100001 + (ll) v[c][r]];
  }
  //cout << c << " " << p1 << " " << p2 << " " << res << "\n";
  return dp[(ll)c*(ll)pow(10,12)+(ll)p1*(ll)pow(10,6)+(ll)p2] = res;
}

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W){
  n = N;
  v.resize(N, {-1});
  for (int i=0; i<M; i++){
    m[(ll)X[i]*100001+(ll)Y[i]] = W[i];
    if (X[i] > 0) v[X[i]-1].push_back(Y[i]);
    if (X[i] < N-1) v[X[i]+1].push_back(Y[i]);
  }
  for (int i=0; i<N; i++) sort(v[i].begin(), v[i].end());

  return solve(0, 0, 0);
}

Compilation message

fish.cpp: In function 'long long int solve(int, int, int)':
fish.cpp:16:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   16 |   while (r < v[c].size()){
      |          ~~^~~~~~~~~~~~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 45620 KB Output is correct
2 Correct 96 ms 51576 KB Output is correct
3 Correct 28 ms 33604 KB Output is correct
4 Correct 29 ms 33596 KB Output is correct
5 Execution timed out 1018 ms 61376 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 1089 ms 204556 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 33596 KB Output is correct
2 Correct 29 ms 33604 KB Output is correct
3 Incorrect 144 ms 48660 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '41647849438518'
4 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 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 Incorrect 3 ms 860 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '431502134630'
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 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 Incorrect 3 ms 860 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '431502134630'
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 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 Incorrect 3 ms 860 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '431502134630'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 33596 KB Output is correct
2 Correct 29 ms 33604 KB Output is correct
3 Incorrect 144 ms 48660 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '41647849438518'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 81 ms 45620 KB Output is correct
2 Correct 96 ms 51576 KB Output is correct
3 Correct 28 ms 33604 KB Output is correct
4 Correct 29 ms 33596 KB Output is correct
5 Execution timed out 1018 ms 61376 KB Time limit exceeded
6 Halted 0 ms 0 KB -