oj.uz

답안 #1078936

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1078936 2024-08-28T08:22:40 Z LittleOrange 메기 농장 (IOI22_fish) C++17
9 / 100
 122 ms 34148 KB 
#include "fish.h"

#include <vector>
#include<bits/stdc++.h>
using namespace std;
using ll = long long;

long long max_weights(int n, int m, std::vector<int> x, std::vector<int> y,
                      std::vector<int> w) {
  ll sub1 = 1, sub2 = 1, sub3 = 1;
  n++;
  vector<vector<pair<ll,ll>>> a(n);
  vector<vector<ll>> b(n);
  for(ll i = 0;i<m;i++){
    a[x[i]].push_back({y[i],w[i]});
    if(x[i]) b[x[i]-1].push_back(y[i]);
    b[x[i]+1].push_back(y[i]);
    if(x[i]&1) sub1 = 0;
    if(x[i]>1) sub2 = 0;
    if(y[i]) sub3 = 0;
  }
  n--;
  for(auto &o : a) sort(o.begin(),o.end());
  for(auto &o : b) sort(o.begin(),o.end());
  if (sub1){
    ll ans = 0;
    for(ll i : w) ans += i;
    return ans;
  }
  if(sub2){
    ll a1 = 0, a2 = 0;
    vector<array<ll,3>> o;
    for(auto [p,v] : a[0]) a1+=v,o.push_back({p,1,v});
    for(auto [p,v] : a[1]) a2+=v,o.push_back({p,0,v});
    ll ans = max(a1,a2);
    if(n>2){
      sort(o.begin(),o.end());
      ll dp0 = 0, dp1 = 0;
      for(auto &u : o){
        if (u[1]){
          dp0 += u[2];
          dp1 = max(dp1,dp0);
        }else{
          dp1 += u[2];
        }
      }
      ans = max(ans,dp1);
    }
    return ans;
  }
  if (sub3){
    vector<ll> dp(n+1,0);
    for(ll i = 0;i<n;i++){
      dp[i+1] = dp[i];
      ll v = a[i].size()?a[i][0].second:0;
      if (i>=1&&a[i-1].size()) v += a[i-1][0].second;;
      if (i>=3) v += dp[i-3];
      dp[i+1] = max(dp[i+1],v);
      v = a[i].size()?a[i][0].second:0;
      if (i>=2) v += dp[i-2];
      dp[i+1] = max(dp[i+1],v);
    }
    return dp.back();
  }
  return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 10880 KB Output is correct
2 Correct 34 ms 12592 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 122 ms 30364 KB Output is correct
6 Correct 115 ms 34148 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 82 ms 23932 KB Output is correct
3 Correct 122 ms 26916 KB Output is correct
4 Correct 27 ms 10964 KB Output is correct
5 Correct 34 ms 12488 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 2 ms 4956 KB Output is correct
11 Correct 3 ms 4956 KB Output is correct
12 Correct 38 ms 15556 KB Output is correct
13 Correct 45 ms 17456 KB Output is correct
14 Correct 36 ms 14284 KB Output is correct
15 Correct 45 ms 15544 KB Output is correct
16 Correct 35 ms 14392 KB Output is correct
17 Correct 38 ms 15288 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 3 ms 5724 KB Output is correct
3 Incorrect 23 ms 10964 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16365227345901'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 4952 KB Output is correct
2 Correct 3 ms 5724 KB Output is correct
3 Incorrect 23 ms 10964 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16365227345901'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 10880 KB Output is correct
2 Correct 34 ms 12592 KB Output is correct
3 Correct 2 ms 4952 KB Output is correct
4 Correct 2 ms 4956 KB Output is correct
5 Correct 122 ms 30364 KB Output is correct
6 Correct 115 ms 34148 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 82 ms 23932 KB Output is correct
9 Correct 122 ms 26916 KB Output is correct
10 Correct 27 ms 10964 KB Output is correct
11 Correct 34 ms 12488 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 4956 KB Output is correct
17 Correct 3 ms 4956 KB Output is correct
18 Correct 38 ms 15556 KB Output is correct
19 Correct 45 ms 17456 KB Output is correct
20 Correct 36 ms 14284 KB Output is correct
21 Correct 45 ms 15544 KB Output is correct
22 Correct 35 ms 14392 KB Output is correct
23 Correct 38 ms 15288 KB Output is correct
24 Correct 2 ms 4952 KB Output is correct
25 Correct 3 ms 5724 KB Output is correct
26 Incorrect 23 ms 10964 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '16365227345901'
27 Halted 0 ms 0 KB -