oj.uz

Submission #41481

# Submission time Handle Problem Language Result Execution time Memory
41481 2018-02-17T09:24:55 Z fest Palembang Bridges (APIO15_bridge) C++14
22 / 100
 81 ms 1764 KB 
// fest
#include <bits/stdc++.h>	

#define pb push_back
#define F first
#define S second
#define y1 dasdasfasfas
#define x1 wqdadfasfasfas
#define All(c) c.begin(), c.end()
#define SZ(A) (int((A).size()))
#define umap unordered_map
#define FILENAME ""
#define __ fflush(stdout)

typedef long long ll;
typedef long double ld;    

using namespace std;

void FREOPEN() {
	#ifdef COMP
		freopen(".in", "r", stdin);
		freopen("2.out", "w", stdout);
	#else
		freopen(FILENAME".in", "r", stdin);
		freopen(FILENAME".out", "w", stdout);
	#endif
}                           

inline double Time() {return (clock() * 1.0) / CLOCKS_PER_SEC; }             

const int N = 200500, inf = 1e9 + 1, MOD = (int)1e9 + 7;

char CH[N];

const ll INF = 1e18;

const int dx[] = {1, -1, 0, 0, -1, 1, -1, 1};
const int dy[] = {0, 0, 1, -1, -1, 1, 1, -1};

vector<pair<int, int> > all;

ll calc(int p1, int p2) {
	ll ret = 0;
	for (int i = 0; i < SZ(all); i++) {
		ret += min(abs(all[i].F - p1) + abs(all[i].S - p1), abs(all[i].F - p2) + abs(all[i].S - p2));
	}	
	return ret;
}

ll check(int k, int x) {
	if (k == 1) return calc(x, x);
	int l = 0;
	int r = min(x, inf - x);
	while (r - l > 1) {
		int mid = (l + r) / 2;
		if (calc(x - mid, x + mid) > calc(x - (mid + 1), x + (mid + 1))) l = mid;
		else r = mid;
	}
	ll ret = min(calc(x + l, x - l), calc(x + r, x - r));
	l = 1;
	r = min(x, inf - x + 1);
	while (r - l > 1) {
		int mid = (l + r) / 2;
		if (calc(x - mid, x + mid - 1) > calc(x - (mid + 1), x + (mid + 1) - 1)) l = mid;
		else r = mid;
	}
	return min(ret, min(calc(x - l, x + l - 1), calc(x - r, x + r - 1)));
}

int main() {
  
	int k, n;
	cin >> k >> n;
	ll un = 0;
	for (int i = 1; i <= n; i++) {
		char t1, t2;
		int p1, p2;
		scanf("\n%c %d %c %d", &t1, &p1, &t2, &p2);
		if (t2 == 'A') swap(t1, t2), swap(p1, p2);
		if (t1 == t2) {
			un += abs(p2 - p1);
			continue;
		}
		all.pb({p1, p2});
	}
	un += SZ(all);
	int l = 0;
	int r = inf;
	while (r - l > 1) {
		int mid = (l + r) / 2;
		if (check(k, mid) > check(k, mid + 1)) l = mid;
		else r = mid;
	}
	cout << min(check(k, l), check(k, r)) + un;
	return 0;	
}

Compilation message

bridge.cpp: In function 'void FREOPEN()':
bridge.cpp:25:37: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".in", "r", stdin);
                                     ^
bridge.cpp:26:39: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
   freopen(FILENAME".out", "w", stdout);
                                       ^
bridge.cpp: In function 'int main()':
bridge.cpp:79:45: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n%c %d %c %d", &t1, &p1, &t2, &p2);
                                             ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 2 ms 552 KB Output is correct
4 Correct 2 ms 552 KB Output is correct
5 Correct 2 ms 552 KB Output is correct
6 Correct 2 ms 640 KB Output is correct
7 Correct 2 ms 640 KB Output is correct
8 Correct 2 ms 640 KB Output is correct
9 Correct 3 ms 640 KB Output is correct
10 Correct 2 ms 640 KB Output is correct
11 Correct 2 ms 640 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 640 KB Output is correct
2 Correct 2 ms 640 KB Output is correct
3 Correct 2 ms 640 KB Output is correct
4 Correct 2 ms 640 KB Output is correct
5 Correct 2 ms 732 KB Output is correct
6 Correct 2 ms 732 KB Output is correct
7 Correct 2 ms 732 KB Output is correct
8 Correct 2 ms 732 KB Output is correct
9 Correct 2 ms 732 KB Output is correct
10 Correct 3 ms 732 KB Output is correct
11 Correct 2 ms 732 KB Output is correct
12 Correct 50 ms 1764 KB Output is correct
13 Correct 80 ms 1764 KB Output is correct
14 Correct 62 ms 1764 KB Output is correct
15 Correct 47 ms 1764 KB Output is correct
16 Correct 59 ms 1764 KB Output is correct
17 Correct 74 ms 1764 KB Output is correct
18 Correct 63 ms 1764 KB Output is correct
19 Correct 72 ms 1764 KB Output is correct
20 Correct 62 ms 1764 KB Output is correct
21 Correct 81 ms 1764 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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