oj.uz

답안 #626268

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
626268 2022-08-11T10:42:31 Z sword060 메기 농장 (IOI22_fish) C++17
9 / 100
 187 ms 11488 KB 
#include <bits/stdc++.h>
#include "fish.h"
using namespace std;
long long dp[100010][2],ar[100010];
long long rec(int i,bool f,int m){
  if(i==m)return 0;
  if(~dp[i][f])return dp[i][f];
  long long z=rec(i+1,0,m);
  if(f)return dp[i][f]=max(z,rec(i+3,1,m)+ar[i]+ar[i+2]);
  return dp[i][f]=max(rec(i+2,1,m)+ar[i+1],z);
}
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][0]=-1,dp[i][1]=-1,ar[i]=0;
    for(int i=0;i<k;i++)ar[a[i]]+=c[i];
    return rec(0,1,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 35 ms 3312 KB Output is correct
2 Correct 40 ms 3792 KB Output is correct
3 Correct 10 ms 10452 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 153 ms 11484 KB Output is correct
6 Correct 187 ms 11488 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 73 ms 5704 KB Output is correct
3 Correct 95 ms 6740 KB Output is correct
4 Correct 38 ms 3300 KB Output is correct
5 Correct 51 ms 3764 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 8 ms 10468 KB Output is correct
11 Correct 1 ms 224 KB Output is correct
12 Correct 35 ms 3308 KB Output is correct
13 Correct 38 ms 3748 KB Output is correct
14 Correct 31 ms 3060 KB Output is correct
15 Correct 44 ms 3428 KB Output is correct
16 Correct 40 ms 3152 KB Output is correct
17 Correct 34 ms 3420 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 10464 KB Output is correct
2 Correct 9 ms 10488 KB Output is correct
3 Incorrect 23 ms 11240 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '19428809891943'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 300 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 1 ms 300 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 1 ms 300 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 6 ms 10464 KB Output is correct
2 Correct 9 ms 10488 KB Output is correct
3 Incorrect 23 ms 11240 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '19428809891943'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 35 ms 3312 KB Output is correct
2 Correct 40 ms 3792 KB Output is correct
3 Correct 10 ms 10452 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 153 ms 11484 KB Output is correct
6 Correct 187 ms 11488 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 73 ms 5704 KB Output is correct
9 Correct 95 ms 6740 KB Output is correct
10 Correct 38 ms 3300 KB Output is correct
11 Correct 51 ms 3764 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 256 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 8 ms 10468 KB Output is correct
17 Correct 1 ms 224 KB Output is correct
18 Correct 35 ms 3308 KB Output is correct
19 Correct 38 ms 3748 KB Output is correct
20 Correct 31 ms 3060 KB Output is correct
21 Correct 44 ms 3428 KB Output is correct
22 Correct 40 ms 3152 KB Output is correct
23 Correct 34 ms 3420 KB Output is correct
24 Correct 6 ms 10464 KB Output is correct
25 Correct 9 ms 10488 KB Output is correct
26 Incorrect 23 ms 11240 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '19428809891943'
27 Halted 0 ms 0 KB -