oj.uz

답안 #901690

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
901690 2024-01-10T00:13:45 Z iliccmarko 메기 농장 (IOI22_fish) C++17
12 / 100
 78 ms 13668 KB 
#include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define endl "\n"
#define INF 1000000000
#define LINF 10000000000000000LL
#define pb push_back
#define all(x) x.begin(), x.end()
#define len(s) (int)s.size()
#define test_case { int t; cin>>t; while(t--)solve(); }
#define single_case solve();
#define line cerr<<"----------"<<endl;
#define ios { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cerr.tie(NULL); }
#define mod 1000000007LL

long long max_weights(int n, int m, vector<int> x, vector<int> y, vector<int> w) {
  vector<ll> val(n, 0);

  for (int i = 0; i < m; ++i) {
    val[x[i]] += (ll)w[i];
  }

  vector<vector<ll> > dp(n, vector<ll>(3, 0));
  for (int i = 0; i < n; ++i) {
    if (i - 1 >= 0) {
        dp[i][0] = max({dp[i - 1][2], dp[i - 1][1], dp[i - 1][0]});
        if (i + 1 < n)
            dp[i][2] = max(dp[i - 1][1], dp[i - 1][0]);
    }
    if (i - 2 >= 0) {
        dp[i][1] = max({dp[i - 2][1] , dp[i - 2][2], dp[i - 2][0]});
    }
    if (i - 1 >= 0)
        dp[i][1] += (ll)val[i];
    if (i + 1 < n)
        dp[i][2] += (ll)val[i];
  }

  return max({dp[n - 1][0], dp[n - 1][1], dp[n - 1][2]});

}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 7892 KB Output is correct
2 Correct 26 ms 9044 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 6 ms 6492 KB Output is correct
5 Correct 78 ms 13668 KB Output is correct
6 Correct 72 ms 13652 KB Output is correct

Subtask #2
0 / 6.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 6492 KB Output is correct
2 Correct 6 ms 6492 KB Output is correct
3 Correct 16 ms 7224 KB Output is correct
4 Correct 13 ms 8024 KB Output is correct
5 Correct 27 ms 10588 KB Output is correct
6 Correct 25 ms 9776 KB Output is correct
7 Correct 26 ms 10568 KB Output is correct
8 Correct 26 ms 10428 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 600 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 600 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 600 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 8 ms 6492 KB Output is correct
2 Correct 6 ms 6492 KB Output is correct
3 Correct 16 ms 7224 KB Output is correct
4 Correct 13 ms 8024 KB Output is correct
5 Correct 27 ms 10588 KB Output is correct
6 Correct 25 ms 9776 KB Output is correct
7 Correct 26 ms 10568 KB Output is correct
8 Correct 26 ms 10428 KB Output is correct
9 Incorrect 26 ms 10176 KB 1st lines differ - on the 1st token, expected: '99999', found: '66666'
10 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 22 ms 7892 KB Output is correct
2 Correct 26 ms 9044 KB Output is correct
3 Correct 6 ms 6492 KB Output is correct
4 Correct 6 ms 6492 KB Output is correct
5 Correct 78 ms 13668 KB Output is correct
6 Correct 72 ms 13652 KB Output is correct
7 Incorrect 0 ms 344 KB 1st lines differ - on the 1st token, expected: '2', found: '1'
8 Halted 0 ms 0 KB -