oj.uz

Submission #41470

# Submission time Handle Problem Language Result Execution time Memory
41470 2018-02-17T09:18:44 Z RockyB Palembang Bridges (APIO15_bridge) C++14
22 / 100
 147 ms 5636 KB 
/// In The Name Of God
 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
 
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
int k, n;
ll add, ans = linf;
 
int p1[N], p2[N];
char t1[N], t2[N];
 
 
namespace k1 {
	int sz;
	int a[N];
	ll pref[N], suff[N];
 
 
	void calc(int p) {
		ll cur = 0;
		int id = upper_bound(a + 1, a + 1 + sz, p) - a;
		cur += (ll)p * (id - 1) - pref[id - 1];
		cur += suff[id] - (ll)p * (sz - id + 1);
		ans = min(ans, cur);
	}
	void solve() {
		for (int i = 1; i <= n; i++) {
			if (t1[i] == t2[i]) add += abs(p1[i] - p2[i]);
			else {
				a[++sz] = p1[i];
				a[++sz] = p2[i];
			}
		}
		sort (a + 1, a + 1 + sz);
		for (int i = 1; i <= sz; i++) {
			pref[i] = pref[i - 1] + a[i];
		}
		for (int i = sz; i >= 1; i--) {
			suff[i] = suff[i + 1] + a[i];
		}
		for (int i = 1; i <= n; i++) {
			calc(p1[i]);
			calc(p2[i]);
			if (clock() / (double)CLOCKS_PER_SEC > 1.9) break;
		}
		cout << ans + add;
		ioi
	}
}
namespace k2 {
	ll calc(int p, int P1) {
		ll cur = 0;
		for (int i = 1; i <= n; i++) {
			cur += min(abs(p - p1[i]) + abs(p - p2[i]), abs(P1 - p1[i]) + abs(P1 - p2[i]));
		}
		//ans = min(ans, cur);
		if (clock() / (double)CLOCKS_PER_SEC > 1.85) {
			cout << ans + add, ioi
		}
		return cur;
	}
	void solve() {
		vector <int> a;
		int bfr = 0;
		for (int i = 1; i <= n; i++) {
			a.pb(p1[i]);
			a.pb(p2[i]);
			if (t1[i] == t2[i]) {
				add += abs(p1[i] - p2[i]);
			}
			else {
				p1[++bfr] = p1[i];
				p2[bfr] = p2[i];
			}
		}
		n = bfr;
		sort(all(a));
		//a.erase(unique(all(a)), a.end());
		random_shuffle(all(a));
		for (int i = 0; i < sz(a) - 1; i++) {
			int l = i + 1, r = sz(a) - 1, res = i + 1;
			while (r - l > 5) {
				int m1 = (l + l + r) / 3, m2 = (l + r + r) / 3;
				if (calc(a[i], a[m1]) <= calc(a[i], a[m2])) r = m2;
				else l = m2;
			}
			for (int j = l; j <= r; j++) {
				ans = min(ans, calc(a[i], a[j]));
			}
			if (clock() / (double)CLOCKS_PER_SEC > 1.85) break;
		}
		cout << ans + add;
		ioi
	}
}
 
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> k >> n;
	for (int i = 1; i <= n; i++) {
		cin >> t1[i] >> p1[i] >> t2[i] >> p2[i];
		if (t1[i] != t2[i]) add++;
	}
	if (k == 1) k1 :: solve();
	if (k == 2) k2 :: solve();
	ioi
}

Compilation message

bridge.cpp: In function 'void k2::solve()':
bridge.cpp:113:34: warning: unused variable 'res' [-Wunused-variable]
    int l = i + 1, r = sz(a) - 1, res = i + 1;
                                  ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 1 ms 376 KB Output is correct
3 Correct 2 ms 532 KB Output is correct
4 Correct 3 ms 604 KB Output is correct
5 Correct 3 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 704 KB Output is correct
9 Correct 3 ms 704 KB Output is correct
10 Correct 3 ms 704 KB Output is correct
11 Correct 3 ms 704 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 704 KB Output is correct
2 Correct 2 ms 704 KB Output is correct
3 Correct 2 ms 704 KB Output is correct
4 Correct 3 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 2 ms 704 KB Output is correct
7 Correct 3 ms 704 KB Output is correct
8 Correct 2 ms 704 KB Output is correct
9 Correct 3 ms 704 KB Output is correct
10 Correct 2 ms 704 KB Output is correct
11 Correct 3 ms 704 KB Output is correct
12 Correct 84 ms 5612 KB Output is correct
13 Correct 147 ms 5612 KB Output is correct
14 Correct 130 ms 5612 KB Output is correct
15 Correct 84 ms 5612 KB Output is correct
16 Correct 90 ms 5612 KB Output is correct
17 Correct 99 ms 5612 KB Output is correct
18 Correct 108 ms 5636 KB Output is correct
19 Correct 138 ms 5636 KB Output is correct
20 Correct 111 ms 5636 KB Output is correct
21 Correct 113 ms 5636 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5636 KB Output is correct
2 Correct 2 ms 5636 KB Output is correct
3 Correct 4 ms 5636 KB Output is correct
4 Correct 3 ms 5636 KB Output is correct
5 Correct 2 ms 5636 KB Output is correct
6 Correct 2 ms 5636 KB Output is correct
7 Correct 4 ms 5636 KB Output is correct
8 Incorrect 3 ms 5636 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5636 KB Output is correct
2 Correct 2 ms 5636 KB Output is correct
3 Correct 3 ms 5636 KB Output is correct
4 Correct 3 ms 5636 KB Output is correct
5 Correct 2 ms 5636 KB Output is correct
6 Correct 2 ms 5636 KB Output is correct
7 Correct 4 ms 5636 KB Output is correct
8 Incorrect 3 ms 5636 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5636 KB Output is correct
2 Correct 1 ms 5636 KB Output is correct
3 Correct 4 ms 5636 KB Output is correct
4 Correct 4 ms 5636 KB Output is correct
5 Correct 2 ms 5636 KB Output is correct
6 Correct 2 ms 5636 KB Output is correct
7 Correct 4 ms 5636 KB Output is correct
8 Incorrect 3 ms 5636 KB Output isn't correct
9 Halted 0 ms 0 KB -