Submission #1078993

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1078993	2024-08-28T09:11:42 Z	LittleOrange	Catfish Farm (IOI22_fish)	C++17	9 / 100	119 ms	27764 KB

fish

#include "fish.h"

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

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){
    ll ans = 0;
    for(ll i : w) ans += i;
    return ans;
    vector<ll> dp(n+1,big);
    dp[0] = 0;
    for(ll i = 0;i<n;i++){
      ll cur = a[i].size()?a[i][0].second:0;
      dp[i+1] = min(dp[i+1],dp[i]+cur);
      if(i>=1)dp[i+1] = min(dp[i+1],dp[i-1]+cur);
      if(i>=3)dp[i+1] = min(dp[i+1],dp[i-2]+cur);
    }
    ll de = min(dp.back(),dp.end()[-2]);
    return ans-de;
  }
  return 0;
}

Subtask #1
3.0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	9608 KB	Output is correct
2	Correct	36 ms	10700 KB	Output is correct
3	Correct	2 ms	4952 KB	Output is correct
4	Correct	3 ms	4952 KB	Output is correct
5	Correct	119 ms	24072 KB	Output is correct
6	Correct	119 ms	27764 KB	Output is correct

Subtask #2
6.0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	83 ms	21168 KB	Output is correct
3	Correct	100 ms	23340 KB	Output is correct
4	Correct	30 ms	9420 KB	Output is correct
5	Correct	33 ms	10700 KB	Output is correct
6	Correct	0 ms	344 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	1 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	4 ms	4956 KB	Output is correct
11	Correct	2 ms	4956 KB	Output is correct
12	Correct	37 ms	14388 KB	Output is correct
13	Correct	45 ms	15880 KB	Output is correct
14	Correct	33 ms	12948 KB	Output is correct
15	Correct	45 ms	13756 KB	Output is correct
16	Correct	36 ms	12852 KB	Output is correct
17	Correct	38 ms	13888 KB	Output is correct

Subtask #3
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4956 KB	Output is correct
2	Correct	2 ms	4956 KB	Output is correct
3	Incorrect	23 ms	9308 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '26722970331638'
4	Halted	0 ms	0 KB	-

Subtask #4
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	1st lines differ - on the 1st token, expected: '3', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	1st lines differ - on the 1st token, expected: '3', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	0 ms	348 KB	1st lines differ - on the 1st token, expected: '3', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	4956 KB	Output is correct
2	Correct	2 ms	4956 KB	Output is correct
3	Incorrect	23 ms	9308 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '26722970331638'
4	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	28 ms	9608 KB	Output is correct
2	Correct	36 ms	10700 KB	Output is correct
3	Correct	2 ms	4952 KB	Output is correct
4	Correct	3 ms	4952 KB	Output is correct
5	Correct	119 ms	24072 KB	Output is correct
6	Correct	119 ms	27764 KB	Output is correct
7	Correct	0 ms	344 KB	Output is correct
8	Correct	83 ms	21168 KB	Output is correct
9	Correct	100 ms	23340 KB	Output is correct
10	Correct	30 ms	9420 KB	Output is correct
11	Correct	33 ms	10700 KB	Output is correct
12	Correct	0 ms	344 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	0 ms	348 KB	Output is correct
16	Correct	4 ms	4956 KB	Output is correct
17	Correct	2 ms	4956 KB	Output is correct
18	Correct	37 ms	14388 KB	Output is correct
19	Correct	45 ms	15880 KB	Output is correct
20	Correct	33 ms	12948 KB	Output is correct
21	Correct	45 ms	13756 KB	Output is correct
22	Correct	36 ms	12852 KB	Output is correct
23	Correct	38 ms	13888 KB	Output is correct
24	Correct	2 ms	4956 KB	Output is correct
25	Correct	2 ms	4956 KB	Output is correct
26	Incorrect	23 ms	9308 KB	1st lines differ - on the 1st token, expected: '21261825233649', found: '26722970331638'
27	Halted	0 ms	0 KB	-

Submission #1078993

Compilation message