oj.uz

답안 #630812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
630812 2022-08-17T06:56:59 Z TimDee 메기 농장 (IOI22_fish) C++17
9 / 100
 91 ms 8020 KB 
#include "fish.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;


ll p2(int n, int m, vector<int> x, vector<int> y, vector<int> w) {

  vector<int> a(n,0), b(n,0);
  ll sum=0;
  for (int i=0; i<m; ++i) {
    if (x[i]==0) a[y[i]]=w[i];
    else b[y[i]]=w[i];
    sum+=w[i];
  }
  ll ans=0;
  for (int i=0; i<n; ++i) ans+=b[i];
  if (n==2) return max(ans,sum-ans);
  ll cnt=ans;
  for (int i=0; i<n; ++i) {
    cnt+=1ll*a[i]-1ll*b[i];
    ans=max(ans,cnt);
  }
  return ans;

}

ll p3(int n, int m, vector<int> x, vector<int> w) {

  vector<int> a(n,0);
  for (int i=0; i<m; ++i) a[x[i]]=w[i];
  vector<vector<ll>> dp(n+1,vector<ll>(2,0));
  dp[1]={a[1],0};
  for (int i=2; i<=n; ++i) {
    dp[i] = {dp[i-2][1]+a[i]+a[i-2], max(dp[i-1][0],dp[i-1][1])};
  }

  return max(dp[n][0],dp[n][1]);

}

ll max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {

  int _p1=1, _p2=1, _p3=1;
  ll sum=0;
  for (int i=0; i<m; ++i) {
    _p1&=!(x[i]&1);
    _p2&=(x[i]<=1);
    _p3&=(y[i]==0);
    sum+=w[i];
  }

  if (_p1) return sum;
  if (_p2) return p2(n,m,x,y,w);
  if (_p3) return p3(n,m,x,w);

}

Compilation message

fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:57:1: warning: control reaches end of non-void function [-Wreturn-type]
   57 | }
      | ^

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2120 KB Output is correct
2 Correct 26 ms 2636 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 82 ms 7268 KB Output is correct
6 Correct 91 ms 7264 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 45 ms 6688 KB Output is correct
3 Correct 56 ms 8020 KB Output is correct
4 Correct 20 ms 2132 KB Output is correct
5 Correct 26 ms 2632 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 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 23 ms 3820 KB Output is correct
13 Correct 27 ms 4564 KB Output is correct
14 Correct 22 ms 3820 KB Output is correct
15 Correct 27 ms 4200 KB Output is correct
16 Correct 23 ms 3828 KB Output is correct
17 Correct 25 ms 4180 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 9 ms 6104 KB Output is correct
3 Incorrect 21 ms 7252 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20490646833592'
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 0 ms 212 KB Output is correct
2 Correct 9 ms 6104 KB Output is correct
3 Incorrect 21 ms 7252 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20490646833592'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 21 ms 2120 KB Output is correct
2 Correct 26 ms 2636 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 82 ms 7268 KB Output is correct
6 Correct 91 ms 7264 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 45 ms 6688 KB Output is correct
9 Correct 56 ms 8020 KB Output is correct
10 Correct 20 ms 2132 KB Output is correct
11 Correct 26 ms 2632 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 23 ms 3820 KB Output is correct
19 Correct 27 ms 4564 KB Output is correct
20 Correct 22 ms 3820 KB Output is correct
21 Correct 27 ms 4200 KB Output is correct
22 Correct 23 ms 3828 KB Output is correct
23 Correct 25 ms 4180 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 9 ms 6104 KB Output is correct
26 Incorrect 21 ms 7252 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '20490646833592'
27 Halted 0 ms 0 KB -