oj.uz

답안 #629649

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
629649 2022-08-14T20:36:02 Z Ronin13 메기 농장 (IOI22_fish) C++17
9 / 100
 1000 ms 148336 KB 
#include "fish.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define pll pair<ll,ll>
#define pii pair<int,int>
#define pb push_back
#define epb emplace_back
#define f first
#define s second
#include <vector>

using namespace std;

map<pii, ll> val;
map <pii, ll> dp;
map <pii, ll> DP;

long long max_weights(int N, int M, std::vector<int> X, std::vector<int> Y,std::vector<int> W) {
    int n = N;
    int m = M;
    vector <set <int> > vec(n + 2);
    for(int i = 0; i < m; i++){
        vec[X[i] + 1].insert(Y[i] + 1);
        val[{X[i] + 1, Y[i] + 1}] = W[i];
    }
    for(int i = 0; i <= n + 1; i++){
        vec[i].insert(0);
        vec[i].insert(n);
    }
    for(int i = 1; i <= n + 1; i++){
        if(i > 1){
            set <int> :: reverse_iterator rit;
            int ind = 0;
            ll last = -1;
            for(rit = vec[i].rbegin(); rit != vec[i].rend(); rit++){
                int j = *rit;
                int a = *vec[i - 2].rbegin();
                int b = *vec[i - 2].begin();
                int v = val[{i, j}];
                if(last == -1){
                    dp[{i, j}] = max(DP[{i - 2, a}] + v, dp[{i - 2, b}] + v);
                }
                else{
                    int vv = *vec[i - 1].upper_bound(j);
                    dp[{i, j}] = max(last + v, dp[{i - 1, vv}] + v);
                }
                last = dp[{i, j}];
            }
        }
        set <int> :: iterator it;
        ll last = -1;
        for(it = vec[i].begin(); it != vec[i].end(); it++){
            int j = *it;
            ll v = val[{i, j}];
            if(last == -1){
                //int x = *vec[i - 1].begin();
                DP[{i, j}] = dp[{i - 1, 0}] + v;
            }
            else{
                int x = *(--vec[i].lower_bound(j));
                DP[{i, j}] = max(DP[{i - 1, x}], last) + v;
            }
            last = DP[{i, j}];
        }
    }
    ll ans = DP[{n + 1, 0}];
    for(int i = 1; i <= n; i++){
        ans = max(ans, DP[{n, 0}]);
    }
    return ans;
}

Compilation message

fish.cpp: In function 'long long int max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:34:17: warning: unused variable 'ind' [-Wunused-variable]
   34 |             int ind = 0;
      |                 ^~~

Subtask #1
0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 423 ms 67660 KB Output is correct
2 Correct 516 ms 77760 KB Output is correct
3 Correct 289 ms 51904 KB Output is correct
4 Correct 278 ms 52044 KB Output is correct
5 Execution timed out 1100 ms 148336 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 212 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 284 ms 51940 KB Output is correct
2 Correct 284 ms 51852 KB Output is correct
3 Correct 291 ms 60896 KB Output is correct
4 Correct 318 ms 61576 KB Output is correct
5 Correct 512 ms 77768 KB Output is correct
6 Correct 525 ms 77736 KB Output is correct
7 Correct 536 ms 77776 KB Output is correct
8 Correct 530 ms 77764 KB Output is correct

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 284 ms 51940 KB Output is correct
2 Correct 284 ms 51852 KB Output is correct
3 Correct 291 ms 60896 KB Output is correct
4 Correct 318 ms 61576 KB Output is correct
5 Correct 512 ms 77768 KB Output is correct
6 Correct 525 ms 77736 KB Output is correct
7 Correct 536 ms 77776 KB Output is correct
8 Correct 530 ms 77764 KB Output is correct
9 Incorrect 530 ms 84028 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 423 ms 67660 KB Output is correct
2 Correct 516 ms 77760 KB Output is correct
3 Correct 289 ms 51904 KB Output is correct
4 Correct 278 ms 52044 KB Output is correct
5 Execution timed out 1100 ms 148336 KB Time limit exceeded
6 Halted 0 ms 0 KB -