Submission #629480

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
629480	2022-08-14T14:19:13 Z	jh05013	Catfish Farm (IOI22_fish)	C++17	35 / 100	1000 ms	2097152 KB

fish

#include <bits/stdc++.h>
using namespace std;
void OJize(){cin.tie(NULL);ios_base::sync_with_stdio(false);}

typedef long long ll;
const int IINF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3f;
#define sz(X) (int)((X).size())
#define entire(X) X.begin(),X.end()
template <class T1, class T2>ostream&operator<<(ostream &os,pair<T1,T2>const&x){os<<'('<<x.first<<", "<<x.second<<')';return os;}
template <class Ch, class Tr, class Container>basic_ostream<Ch,Tr>&operator<<(basic_ostream<Ch,Tr>&os,Container const&x){os<<"[ ";for(auto&y:x)os<<y<<" ";return os<<"]";}

// NOTE: this is not a "sparse table" related to
// binary lifting, it's literally an array which is sparse!!
template<typename T>
struct SparseArray{
	// not actually sparse yet!!
	int n;
	vector<T> arr, sum;
	SparseArray(int N): n{N}, arr(N), sum(N){}

	void write(int i, T x){arr[i] = x;}
	void init(){
		sum[0] = arr[0];
		for(int i=1; i<n; i++) sum[i] = sum[i-1]+arr[i];
	}

	T operator[](int i){return arr[i];}
	T getsum(int l, int r){
		return sum[r] - (l? sum[l-1] : (T)0);
	}
};

ll max_weights(int L, int n,
vector<int> X, vector<int> Y, vector<int> W){
	vector<SparseArray<ll>> grid(L, SparseArray<ll>(L+1));
	for(int i=0; i<n; i++) grid[X[i]].write(Y[i], (ll)W[i]);
	for(auto &A: grid) A.init();

	vector<ll> dinc(L+1), ddec(L+1);
	// column _,
	// last column height j,
	// next will increase/decrease
	for(int i=1; i<L; i++){
		vector<ll> ndinc(L+1), nddec(L+1);
		ndinc[0] = nddec[0] = ddec[0];
		ndinc[L] = nddec[L] = max(ddec[0], dinc[L]);
		for(int y=0; y<=L; y++){
			if(!(y == L || y == 0 || grid[i][y])) continue;
			for(int y0=0; y0<y; y0++){ // inc
				if(!(y0 == L || y0 == 0 || grid[i-1][y0])) continue;
				// take [i-1][y0 to y-1]
				ll val = dinc[y0] + grid[i-1].getsum(y0, y-1);
				ndinc[y] = max(ndinc[y], val);
				if(y == L) nddec[y] = max(nddec[y], val);
			}
			for(int y0=y+1; y0<=L; y0++){ // dec
				if(!(y0 == L || y0 == 0 || grid[i-1][y0])) continue;
				// take [i][y to y0-1]
				ll val = ddec[y0] + grid[i].getsum(y, y0-1);
				nddec[y] = max(nddec[y], val);
			}
		}
		dinc = ndinc, ddec = nddec;
	}

	return max(
		*max_element(entire(dinc)),
		*max_element(entire(ddec))
	);
}

#ifdef jh
int main(){OJize();
	int n; cin>>n;
	vector<int> X, Y, W;
	for(int i=0; i<n; i++) for(int j=0; j<n; j++){
		int x; cin>>x;
		if(x){
			X.push_back(j);
			Y.push_back(n-1-i);
			W.push_back(x);
		}
	}
	cout << max_weights(n, sz(X), X, Y, W);
}
#endif

Subtask #1
0 / 3.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	743 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 6.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Runtime error	769 ms	2097152 KB	Execution killed with signal 9
3	Halted	0 ms	0 KB	-

Subtask #3
0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	727 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 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	1 ms	596 KB	Output is correct
10	Correct	3 ms	1748 KB	Output is correct
11	Correct	1 ms	596 KB	Output is correct
12	Correct	2 ms	1748 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	1748 KB	Output is correct

Subtask #5
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 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	1 ms	596 KB	Output is correct
10	Correct	3 ms	1748 KB	Output is correct
11	Correct	1 ms	596 KB	Output is correct
12	Correct	2 ms	1748 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	1748 KB	Output is correct
15	Correct	2 ms	1620 KB	Output is correct
16	Correct	2 ms	340 KB	Output is correct
17	Correct	53 ms	2776 KB	Output is correct
18	Correct	56 ms	2772 KB	Output is correct
19	Correct	46 ms	2756 KB	Output is correct
20	Correct	42 ms	2756 KB	Output is correct
21	Correct	41 ms	2772 KB	Output is correct
22	Correct	113 ms	3848 KB	Output is correct
23	Correct	9 ms	1876 KB	Output is correct
24	Correct	35 ms	2388 KB	Output is correct
25	Correct	2 ms	1748 KB	Output is correct
26	Correct	8 ms	1876 KB	Output is correct

Subtask #6
0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 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	1 ms	596 KB	Output is correct
10	Correct	3 ms	1748 KB	Output is correct
11	Correct	1 ms	596 KB	Output is correct
12	Correct	2 ms	1748 KB	Output is correct
13	Correct	1 ms	340 KB	Output is correct
14	Correct	2 ms	1748 KB	Output is correct
15	Correct	2 ms	1620 KB	Output is correct
16	Correct	2 ms	340 KB	Output is correct
17	Correct	53 ms	2776 KB	Output is correct
18	Correct	56 ms	2772 KB	Output is correct
19	Correct	46 ms	2756 KB	Output is correct
20	Correct	42 ms	2756 KB	Output is correct
21	Correct	41 ms	2772 KB	Output is correct
22	Correct	113 ms	3848 KB	Output is correct
23	Correct	9 ms	1876 KB	Output is correct
24	Correct	35 ms	2388 KB	Output is correct
25	Correct	2 ms	1748 KB	Output is correct
26	Correct	8 ms	1876 KB	Output is correct
27	Correct	134 ms	141620 KB	Output is correct
28	Correct	507 ms	14156 KB	Output is correct
29	Execution timed out	1106 ms	148584 KB	Time limit exceeded
30	Halted	0 ms	0 KB	-

Subtask #7
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	727 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Subtask #8
0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Runtime error	743 ms	2097152 KB	Execution killed with signal 9
2	Halted	0 ms	0 KB	-

Submission #629480

Compilation message