oj.uz

답안 #626259

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626259 2022-08-11T10:35:36 Z sword060 메기 농장 (IOI22_fish) C++17
9 / 100
 120 ms 11484 KB 
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
long long dp[100010],ar[100010];
long long rec(int i,int m){
  if(i==m)return 0;
  if(~dp[i])return dp[i];
  return dp[i]=max({rec(i+2,m)+ar[i+1],rec(i+3,m)+ar[i]+ar[i+2]});
}
long long max_weights(int x,int k,vector<int> a,vector<int> b,vector<int> c){
  vector<pair<int,int>>l[2];
  long long ans=0,cur=0,cur2=0;
  bool f=1;
  for(int i=0;i<k;i++){
    l[a[i]%2].push_back({b[i],c[i]});
    if(a[i]%2)cur+=c[i];
    else cur2+=c[i];
    f&=(b[i]==0);
  }
  if(f){
    for(int i=0;i<x;i++)dp[i]=-1,ar[i]=0;
    for(int i=0;i<k;i++)ar[a[i]]+=c[i];
    return rec(0,x);
  }
  sort(l[0].begin(),l[0].end());
  sort(l[1].begin(),l[1].end());
  ans=cur;
  if(x<=2){
    return max(cur,cur2);
  }
  int j=0;
  for(int i=0;i<(int)l[0].size();i++){
    cur+=l[0][i].second;
    while(j<(int)l[1].size()&&l[1][j].first<=l[0][i].first){
      cur-=l[1][j].second;
      j++;
    }
    ans=max(ans,cur);
  }
  return ans;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 3396 KB Output is correct
2 Correct 35 ms 3776 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 120 ms 11484 KB Output is correct
6 Correct 115 ms 11480 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 63 ms 5696 KB Output is correct
3 Correct 76 ms 6732 KB Output is correct
4 Correct 35 ms 3276 KB Output is correct
5 Correct 36 ms 3788 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 4 ms 4876 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 29 ms 3276 KB Output is correct
13 Correct 34 ms 3776 KB Output is correct
14 Correct 30 ms 3064 KB Output is correct
15 Correct 39 ms 3432 KB Output is correct
16 Correct 29 ms 3200 KB Output is correct
17 Correct 31 ms 3392 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4932 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Incorrect 17 ms 6356 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21049836049923'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

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

Subtask #5
0 / 21.0

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

Subtask #6
0 / 17.0

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

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4932 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Incorrect 17 ms 6356 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21049836049923'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 3396 KB Output is correct
2 Correct 35 ms 3776 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 120 ms 11484 KB Output is correct
6 Correct 115 ms 11480 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 63 ms 5696 KB Output is correct
9 Correct 76 ms 6732 KB Output is correct
10 Correct 35 ms 3276 KB Output is correct
11 Correct 36 ms 3788 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 4 ms 4876 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 29 ms 3276 KB Output is correct
19 Correct 34 ms 3776 KB Output is correct
20 Correct 30 ms 3064 KB Output is correct
21 Correct 39 ms 3432 KB Output is correct
22 Correct 29 ms 3200 KB Output is correct
23 Correct 31 ms 3392 KB Output is correct
24 Correct 3 ms 4932 KB Output is correct
25 Correct 3 ms 4948 KB Output is correct
26 Incorrect 17 ms 6356 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '21049836049923'
27 Halted 0 ms 0 KB -