oj.uz

Submission #956751

# Submission time Handle Problem Language Result Execution time Memory
956751 2024-04-02T12:32:26 Z ono_de206 Netrpeljivost (COI23_netrpeljivost) C++14
27 / 100
 1500 ms 14600 KB 
#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 j = 0; j < sz / 2; j++) {
				for(int ii = 0; ii < sz / 2; ii++) {
					for(int jj = 0; jj < sz / 2; jj++) {
						if(i == ii || j == jj) continue;
						mnn(ret[i][j + sz / 2], adp[i][ii] + bdp[jj][j] + a[ii + l][jj + m + 1]);
					}
				}
			}
		}
		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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2508 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2508 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2508 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2508 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 32 ms 2908 KB Output is correct
22 Correct 38 ms 2908 KB Output is correct
23 Correct 30 ms 2904 KB Output is correct
24 Correct 3 ms 2648 KB Output is correct
25 Correct 3 ms 2904 KB Output is correct
26 Correct 29 ms 2908 KB Output is correct
27 Correct 29 ms 2908 KB Output is correct
28 Correct 34 ms 2904 KB Output is correct
29 Correct 30 ms 2928 KB Output is correct
30 Correct 28 ms 2908 KB Output is correct
31 Correct 28 ms 2948 KB Output is correct
32 Correct 28 ms 2952 KB Output is correct
33 Correct 29 ms 2924 KB Output is correct
34 Correct 29 ms 2908 KB Output is correct
35 Correct 28 ms 2908 KB Output is correct
36 Correct 29 ms 2908 KB Output is correct
37 Correct 29 ms 2908 KB Output is correct
38 Correct 29 ms 2908 KB Output is correct
39 Correct 29 ms 2908 KB Output is correct
40 Correct 28 ms 2908 KB Output is correct

Subtask #3
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2508 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2508 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 32 ms 2908 KB Output is correct
22 Correct 38 ms 2908 KB Output is correct
23 Correct 30 ms 2904 KB Output is correct
24 Correct 3 ms 2648 KB Output is correct
25 Correct 3 ms 2904 KB Output is correct
26 Correct 29 ms 2908 KB Output is correct
27 Correct 29 ms 2908 KB Output is correct
28 Correct 34 ms 2904 KB Output is correct
29 Correct 30 ms 2928 KB Output is correct
30 Correct 28 ms 2908 KB Output is correct
31 Correct 28 ms 2948 KB Output is correct
32 Correct 28 ms 2952 KB Output is correct
33 Correct 29 ms 2924 KB Output is correct
34 Correct 29 ms 2908 KB Output is correct
35 Correct 28 ms 2908 KB Output is correct
36 Correct 29 ms 2908 KB Output is correct
37 Correct 29 ms 2908 KB Output is correct
38 Correct 29 ms 2908 KB Output is correct
39 Correct 29 ms 2908 KB Output is correct
40 Correct 28 ms 2908 KB Output is correct
41 Execution timed out 1570 ms 14600 KB Time limit exceeded
42 Halted 0 ms 0 KB -

Subtask #4
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2508 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2392 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2396 KB Output is correct
13 Correct 1 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2508 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 32 ms 2908 KB Output is correct
22 Correct 38 ms 2908 KB Output is correct
23 Correct 30 ms 2904 KB Output is correct
24 Correct 3 ms 2648 KB Output is correct
25 Correct 3 ms 2904 KB Output is correct
26 Correct 29 ms 2908 KB Output is correct
27 Correct 29 ms 2908 KB Output is correct
28 Correct 34 ms 2904 KB Output is correct
29 Correct 30 ms 2928 KB Output is correct
30 Correct 28 ms 2908 KB Output is correct
31 Correct 28 ms 2948 KB Output is correct
32 Correct 28 ms 2952 KB Output is correct
33 Correct 29 ms 2924 KB Output is correct
34 Correct 29 ms 2908 KB Output is correct
35 Correct 28 ms 2908 KB Output is correct
36 Correct 29 ms 2908 KB Output is correct
37 Correct 29 ms 2908 KB Output is correct
38 Correct 29 ms 2908 KB Output is correct
39 Correct 29 ms 2908 KB Output is correct
40 Correct 28 ms 2908 KB Output is correct
41 Execution timed out 1570 ms 14600 KB Time limit exceeded
42 Halted 0 ms 0 KB -