Submission #956753

#	Time	Username	Problem	Language	Result	Execution time	Memory
956753		ono_de206	Netrpeljivost (COI23_netrpeljivost)	C++14	59 / 100	1566 ms	128644 KiB

Main

#include<bits/stdc++.h>
using namespace std;

#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

#define int long long

typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
// typedef pair<int, int> P;

template<typename T, typename U>
ostream & operator << (ostream &out, const pair<T, U> &c) {
	out << c.first << ' ' << c.second;
	return out;
}

template<typename T>
ostream & operator << (ostream &out, vector<T> &v) {
	const int sz = v.size();
	for (int i = 0; i < sz; i++) {
		if (i) out << ' ';
		out << v[i];
	}
	return out;
}

template<typename T>
istream & operator >> (istream &in, vector<T> &v) {
	for (T &x : v) in >> x;
	return in;
}

template<typename T, typename U>
	istream & operator >> (istream &in, pair<T, U> &c) {
	in >> c.first;
	in >> c.second;
	return in;
}

template<typename T>
void mxx(T &a, T b){if(b > a) a = b;}
template<typename T>
void mnn(T &a, T b){if(b < a) a = b;}

const int mxn = 2050, MXLOG = 22, mod = 1e9 + 7, P = 1181, D = 1523, N = 2500;
const long long inf = 2e18 + 10;
int a[mxn][mxn];

vector<vector<int>> solve(int l, int r) {
	int sz = r - l + 1;
	vector<vector<int>> ret(sz, vector<int>(sz, inf));
	if(l + 1 == r) {
		ret[0][1] = ret[1][0] = a[l][r];
	} else {
		int m = (l + r) / 2;
		auto adp = solve(l, m);
		auto bdp = solve(m + 1, r);
		for(int i = 0; i < sz / 2; i++) {
			for(int jj = 0; jj < sz / 2; jj++) {
				int mn = inf;
				for(int ii = 0; ii < sz / 2; ii++) {
					mnn(mn, adp[i][ii] + a[ii + l][jj + m + 1]);
				}
				for(int j = 0; j < sz / 2; j++) {
					mnn(ret[i][j + sz / 2], mn + bdp[jj][j]);
				}
			}
		}
		for(int i = 0; i < sz / 2; i++) {
			for(int j = sz / 2; j < sz; j++) {
				ret[j][i] = ret[i][j];
			}
		}
	}
	// cout << l << ' ' << r << endl;
	// for(int i = 0; i < sz; i++) {
	// 	for(int j = 0; j < sz; j++) {
	// 		cout << ret[i][j] << ' ';
	// 	}
	// 	cout << endl;
	// }
	// cout << endl;
	return ret;
}

void go() {
	int n;
	cin >> n;
	for(int i = 1; i <= n; i++) {
		for(int j = 1; j <= n; j++) {
			cin >> a[i][j];
		}
	}
	auto dp = solve(1, n);
	int ans = inf;
	for(int i = 0; i < n; i++) {
		for(int j = 0; j < n; j++) {
			mnn(ans, dp[i][j]);
		}
	}
	cout << ans << endl;
}

signed main() {
	fast;
	int t = 1;
	// cin >> t;
	while(t--) {
		go();
	}
	return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 17 / 17
• Subtask 3: 32 / 32
• Subtask 4: 0 / 41