oj.uz

답안 #832489

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832489 2023-08-21T10:51:51 Z NothingXD 메기 농장 (IOI22_fish) C++17
9 / 100
 225 ms 86216 KB 
#include "fish.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out(){cerr << endl;}
template<typename Head, typename... Tail>
void debug_out(Head H, Tail... T){
	cerr << H << ' ';
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "): ", debug_out(__VA_ARGS__)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)

const int maxn = 3e5 + 10;

int n, m, x[maxn], y[maxn], w[maxn];
vector<int> num[maxn];
vector<int> val[maxn];
vector<ll> dp1[maxn], dp2[maxn], sum[maxn];
ll gole[maxn];

ll max_weights(int N, int M, vector<int> X, vector<int> Y, vector<int> W) {
	n = N, m = M;
	for (int i = 0; i < m; i++){
		x[i] = X[i];
		y[i] = Y[i];
		w[i] = W[i];
		num[x[i]].push_back(y[i]-1);
		num[x[i]].push_back(y[i]);
	}
//	debug(0);
	for (int i = 0; i < n; i++){
		num[i].push_back(-1);
		num[i].push_back(n-1);
		sort(all(num[i]));
		num[i].resize(distance(num[i].begin(), unique(all(num[i]))));
		for (auto x: num[i]){
			val[i].push_back(0);
		}
	}
	for (int i = 0; i < m; i++){
		int idx = lower_bound(all(num[x[i]]), y[i]) - num[x[i]].begin();
		val[x[i]][idx] = w[i];
	}
//	debug(1);
	dp1[0].resize(val[0].size(), 0);
	dp2[0].resize(val[0].size(), 0);
	sum[0].resize(val[0].size(), 0);
	for (int i = 1; i < val[0].size(); i++){
		dp1[0][i] = dp1[0][i-1] + val[0][i];
		sum[0][i] = sum[0][i-1] + val[0][i];
	}
	//gole[0] = 0;
//	for (int i = 0; i < val[0].size(); i++) debug(0, i, num[0][i], dp1[0][i], dp2[0][i], sum[0][i]);
	for (int i = 1; i < n; i++){
		dp1[i].resize(val[i].size());
		dp2[i].resize(val[i].size());
		sum[i].resize(val[i].size());
		for (int j = 0; j < val[i].size(); j++){
			int idx = upper_bound(all(num[i-1]), num[i][j]) - num[i-1].begin() - 1;
			dp1[i][j] = dp1[i-1][idx];
			if (j){
				dp1[i][j] = max(dp1[i][j], dp1[i][j-1] + val[i][j]);
			}
			if (i > 1){
				dp1[i][j] = max(dp1[i][j], dp2[i-1][0]);
				dp1[i][j] = max(dp1[i][j], dp2[i-2][0] + sum[i-1][idx]);
			}
		}
		for (int j = val[i].size()-1; ~j; j--){
		//	debug(i, j);
			int idx = lower_bound(all(num[i-1]), num[i][j]) - num[i-1].begin();
			dp2[i][j] = dp2[i-1][idx];
			if (j + 1 != val[i].size()) dp2[i][j] = max(dp2[i][j], dp2[i][j+1] + val[i][j+1]);
			if (i > 1){
			//	debug(1, dp1[i-2][val[i-2].size()-1]);
				dp2[i][j] = max(dp2[i][j], dp1[i-2][val[i-2].size()-1]);
			}
			if (i > 2){
				dp2[i][j] = max(dp2[i][j], dp2[i-1][0]);
				dp2[i][j] = max(dp2[i][j], dp2[i-2][0] + sum[i-1][val[i-1].size()-1]);
			}
		}
		for (int j = 1; j < val[i].size(); j++){
			sum[i][j] = sum[i][j-1] + val[i][j];
		}
	//	for (int j = 0; j < val[i].size(); j++) debug(i, j, num[i][j], dp1[i][j], dp2[i][j], sum[i][j]);
	}
	ll ans = max(dp2[n-1][0], dp1[n-2][val[n-2].size()-1]);
	return ans;
}

Compilation message

fish.cpp: In function 'll max_weights(int, int, std::vector<int>, std::vector<int>, std::vector<int>)':
fish.cpp:46:13: warning: unused variable 'x' [-Wunused-variable]
   46 |   for (auto x: num[i]){
      |             ^
fish.cpp:58:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |  for (int i = 1; i < val[0].size(); i++){
      |                  ~~^~~~~~~~~~~~~~~
fish.cpp:68:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   68 |   for (int j = 0; j < val[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~
fish.cpp:83:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |    if (j + 1 != val[i].size()) dp2[i][j] = max(dp2[i][j], dp2[i][j+1] + val[i][j+1]);
      |        ~~~~~~^~~~~~~~~~~~~~~~
fish.cpp:93:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |   for (int j = 1; j < val[i].size(); j++){
      |                   ~~^~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 56948 KB Output is correct
2 Correct 100 ms 59908 KB Output is correct
3 Correct 49 ms 51152 KB Output is correct
4 Correct 48 ms 51104 KB Output is correct
5 Correct 207 ms 77612 KB Output is correct
6 Correct 225 ms 86216 KB Output is correct

Subtask #2
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 35552 KB Output is correct
2 Correct 142 ms 64228 KB Output is correct
3 Correct 187 ms 68768 KB Output is correct
4 Correct 89 ms 56868 KB Output is correct
5 Correct 100 ms 59968 KB Output is correct
6 Correct 18 ms 35528 KB Output is correct
7 Correct 19 ms 35540 KB Output is correct
8 Correct 19 ms 35532 KB Output is correct
9 Correct 21 ms 35432 KB Output is correct
10 Correct 50 ms 51184 KB Output is correct
11 Correct 49 ms 51132 KB Output is correct
12 Correct 87 ms 56940 KB Output is correct
13 Correct 99 ms 59976 KB Output is correct
14 Correct 88 ms 56968 KB Output is correct
15 Correct 117 ms 59340 KB Output is correct
16 Correct 97 ms 56896 KB Output is correct
17 Correct 95 ms 59356 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 51096 KB Output is correct
2 Correct 48 ms 51148 KB Output is correct
3 Incorrect 75 ms 52448 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '26722445760742'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 35432 KB Output is correct
2 Correct 18 ms 35508 KB Output is correct
3 Correct 18 ms 35444 KB Output is correct
4 Correct 18 ms 35548 KB Output is correct
5 Correct 18 ms 35548 KB Output is correct
6 Correct 18 ms 35444 KB Output is correct
7 Correct 19 ms 35540 KB Output is correct
8 Correct 19 ms 35548 KB Output is correct
9 Incorrect 18 ms 35540 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '310323004046'
10 Halted 0 ms 0 KB -

Subtask #5
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 35432 KB Output is correct
2 Correct 18 ms 35508 KB Output is correct
3 Correct 18 ms 35444 KB Output is correct
4 Correct 18 ms 35548 KB Output is correct
5 Correct 18 ms 35548 KB Output is correct
6 Correct 18 ms 35444 KB Output is correct
7 Correct 19 ms 35540 KB Output is correct
8 Correct 19 ms 35548 KB Output is correct
9 Incorrect 18 ms 35540 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '310323004046'
10 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 35432 KB Output is correct
2 Correct 18 ms 35508 KB Output is correct
3 Correct 18 ms 35444 KB Output is correct
4 Correct 18 ms 35548 KB Output is correct
5 Correct 18 ms 35548 KB Output is correct
6 Correct 18 ms 35444 KB Output is correct
7 Correct 19 ms 35540 KB Output is correct
8 Correct 19 ms 35548 KB Output is correct
9 Incorrect 18 ms 35540 KB 1st lines differ - on the 1st token, expected: '216624184325', found: '310323004046'
10 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 50 ms 51096 KB Output is correct
2 Correct 48 ms 51148 KB Output is correct
3 Incorrect 75 ms 52448 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '26722445760742'
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 87 ms 56948 KB Output is correct
2 Correct 100 ms 59908 KB Output is correct
3 Correct 49 ms 51152 KB Output is correct
4 Correct 48 ms 51104 KB Output is correct
5 Correct 207 ms 77612 KB Output is correct
6 Correct 225 ms 86216 KB Output is correct
7 Correct 17 ms 35552 KB Output is correct
8 Correct 142 ms 64228 KB Output is correct
9 Correct 187 ms 68768 KB Output is correct
10 Correct 89 ms 56868 KB Output is correct
11 Correct 100 ms 59968 KB Output is correct
12 Correct 18 ms 35528 KB Output is correct
13 Correct 19 ms 35540 KB Output is correct
14 Correct 19 ms 35532 KB Output is correct
15 Correct 21 ms 35432 KB Output is correct
16 Correct 50 ms 51184 KB Output is correct
17 Correct 49 ms 51132 KB Output is correct
18 Correct 87 ms 56940 KB Output is correct
19 Correct 99 ms 59976 KB Output is correct
20 Correct 88 ms 56968 KB Output is correct
21 Correct 117 ms 59340 KB Output is correct
22 Correct 97 ms 56896 KB Output is correct
23 Correct 95 ms 59356 KB Output is correct
24 Correct 50 ms 51096 KB Output is correct
25 Correct 48 ms 51148 KB Output is correct
26 Incorrect 75 ms 52448 KB 1st lines differ - on the 1st token, expected: '21261825233649', found: '26722445760742'
27 Halted 0 ms 0 KB -