oj.uz

답안 #956829

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
956829 2024-04-02T14:20:04 Z ono_de206 Netrpeljivost (COI23_netrpeljivost) C++14
100 / 100
 1143 ms 96524 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 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 adp = solve(1, n / 2), bdp = solve(n / 2 + 1, n);
	vector<int> mna(n / 2, inf), mnb(n / 2, inf);
	for(int i = 0; i < n / 2; i++) {
		for(int j = 0; j < n / 2; j++) {
			mnn(mna[j], adp[i][j]);
			mnn(mnb[i], bdp[i][j]);
		}
	}
	int ans = inf;
	for(int i = 0; i < n / 2; i++) {
		for(int j = 0; j < n / 2; j++) {
			mnn(ans, mna[i] + mnb[j] + a[i + 1][j + n / 2 + 1]);
		}
	}
	cout << ans << endl;
}

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2760 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2512 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2508 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 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2516 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2760 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2512 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2508 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 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2516 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 4 ms 2652 KB Output is correct
22 Correct 3 ms 2652 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 2 ms 2648 KB Output is correct
27 Correct 3 ms 2652 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 3 ms 2652 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 2 ms 2648 KB Output is correct
35 Correct 2 ms 2656 KB Output is correct
36 Correct 2 ms 2664 KB Output is correct
37 Correct 2 ms 2784 KB Output is correct
38 Correct 2 ms 2656 KB Output is correct
39 Correct 2 ms 2660 KB Output is correct
40 Correct 2 ms 2856 KB Output is correct

Subtask #3
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2760 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2512 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2508 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 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2516 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 4 ms 2652 KB Output is correct
22 Correct 3 ms 2652 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 2 ms 2648 KB Output is correct
27 Correct 3 ms 2652 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 3 ms 2652 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 2 ms 2648 KB Output is correct
35 Correct 2 ms 2656 KB Output is correct
36 Correct 2 ms 2664 KB Output is correct
37 Correct 2 ms 2784 KB Output is correct
38 Correct 2 ms 2656 KB Output is correct
39 Correct 2 ms 2660 KB Output is correct
40 Correct 2 ms 2856 KB Output is correct
41 Correct 40 ms 12568 KB Output is correct
42 Correct 33 ms 12628 KB Output is correct
43 Correct 33 ms 12660 KB Output is correct
44 Correct 32 ms 12636 KB Output is correct
45 Correct 33 ms 12560 KB Output is correct
46 Correct 34 ms 12672 KB Output is correct
47 Correct 35 ms 12744 KB Output is correct
48 Correct 34 ms 12624 KB Output is correct
49 Correct 32 ms 12664 KB Output is correct
50 Correct 41 ms 12636 KB Output is correct
51 Correct 33 ms 12636 KB Output is correct
52 Correct 32 ms 12692 KB Output is correct
53 Correct 32 ms 12636 KB Output is correct
54 Correct 33 ms 12628 KB Output is correct
55 Correct 34 ms 12892 KB Output is correct
56 Correct 32 ms 12708 KB Output is correct
57 Correct 34 ms 12688 KB Output is correct
58 Correct 33 ms 12628 KB Output is correct
59 Correct 32 ms 12948 KB Output is correct
60 Correct 33 ms 12572 KB Output is correct

Subtask #4
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2760 KB Output is correct
3 Correct 2 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 2 ms 2396 KB Output is correct
7 Correct 1 ms 2512 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2508 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 2392 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 1 ms 2648 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 1 ms 2516 KB Output is correct
18 Correct 1 ms 2392 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 4 ms 2652 KB Output is correct
22 Correct 3 ms 2652 KB Output is correct
23 Correct 2 ms 2648 KB Output is correct
24 Correct 1 ms 2396 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 2 ms 2648 KB Output is correct
27 Correct 3 ms 2652 KB Output is correct
28 Correct 2 ms 2652 KB Output is correct
29 Correct 2 ms 2652 KB Output is correct
30 Correct 2 ms 2652 KB Output is correct
31 Correct 3 ms 2652 KB Output is correct
32 Correct 2 ms 2652 KB Output is correct
33 Correct 2 ms 2652 KB Output is correct
34 Correct 2 ms 2648 KB Output is correct
35 Correct 2 ms 2656 KB Output is correct
36 Correct 2 ms 2664 KB Output is correct
37 Correct 2 ms 2784 KB Output is correct
38 Correct 2 ms 2656 KB Output is correct
39 Correct 2 ms 2660 KB Output is correct
40 Correct 2 ms 2856 KB Output is correct
41 Correct 40 ms 12568 KB Output is correct
42 Correct 33 ms 12628 KB Output is correct
43 Correct 33 ms 12660 KB Output is correct
44 Correct 32 ms 12636 KB Output is correct
45 Correct 33 ms 12560 KB Output is correct
46 Correct 34 ms 12672 KB Output is correct
47 Correct 35 ms 12744 KB Output is correct
48 Correct 34 ms 12624 KB Output is correct
49 Correct 32 ms 12664 KB Output is correct
50 Correct 41 ms 12636 KB Output is correct
51 Correct 33 ms 12636 KB Output is correct
52 Correct 32 ms 12692 KB Output is correct
53 Correct 32 ms 12636 KB Output is correct
54 Correct 33 ms 12628 KB Output is correct
55 Correct 34 ms 12892 KB Output is correct
56 Correct 32 ms 12708 KB Output is correct
57 Correct 34 ms 12688 KB Output is correct
58 Correct 33 ms 12628 KB Output is correct
59 Correct 32 ms 12948 KB Output is correct
60 Correct 33 ms 12572 KB Output is correct
61 Correct 1095 ms 95832 KB Output is correct
62 Correct 1084 ms 95852 KB Output is correct
63 Correct 1067 ms 95836 KB Output is correct
64 Correct 1100 ms 96012 KB Output is correct
65 Correct 1067 ms 95784 KB Output is correct
66 Correct 1086 ms 95784 KB Output is correct
67 Correct 1070 ms 95672 KB Output is correct
68 Correct 1101 ms 96192 KB Output is correct
69 Correct 1113 ms 95736 KB Output is correct
70 Correct 1089 ms 95976 KB Output is correct
71 Correct 1063 ms 96396 KB Output is correct
72 Correct 1082 ms 96396 KB Output is correct
73 Correct 1080 ms 96396 KB Output is correct
74 Correct 1143 ms 96168 KB Output is correct
75 Correct 1069 ms 96340 KB Output is correct
76 Correct 1063 ms 96144 KB Output is correct
77 Correct 1072 ms 96492 KB Output is correct
78 Correct 1095 ms 96524 KB Output is correct
79 Correct 1099 ms 96368 KB Output is correct
80 Correct 1055 ms 96336 KB Output is correct