oj.uz

답안 #41427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41427 2018-02-17T08:14:37 Z fest Palembang Bridges (APIO15_bridge) C++14
22 / 100
 69 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 x, int y) {
	ll ret = 0;
	for (auto i : all) {
		ret += min(abs(i.F - x) + abs(i.S - x), abs(i.F - y) + abs(i.S - y));
	}	
	return ret;
}

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

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});
	}
	if (k == 1) {
		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 << un + SZ(all) + min(check(k, l), check(k, r));
		return 0;
	}
	ll mn = INF;
	for (auto i : all) {
		for (auto j : all) {
			mn = min(mn, calc(i.F, j.F));
			mn = min(mn, calc(i.F, j.S));
			mn = min(mn, calc(i.S, j.F));
			mn = min(mn, calc(i.S, j.S));
		}		
	}
	cout << mn + un + SZ(all);
	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:71: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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 2 ms 480 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 560 KB Output is correct
7 Correct 2 ms 560 KB Output is correct
8 Correct 3 ms 560 KB Output is correct
9 Correct 2 ms 560 KB Output is correct
10 Correct 2 ms 560 KB Output is correct
11 Correct 2 ms 560 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 560 KB Output is correct
2 Correct 1 ms 560 KB Output is correct
3 Correct 2 ms 560 KB Output is correct
4 Correct 2 ms 560 KB Output is correct
5 Correct 2 ms 560 KB Output is correct
6 Correct 2 ms 660 KB Output is correct
7 Correct 2 ms 660 KB Output is correct
8 Correct 2 ms 660 KB Output is correct
9 Correct 3 ms 660 KB Output is correct
10 Correct 2 ms 660 KB Output is correct
11 Correct 3 ms 660 KB Output is correct
12 Correct 49 ms 1764 KB Output is correct
13 Correct 67 ms 1764 KB Output is correct
14 Correct 52 ms 1764 KB Output is correct
15 Correct 42 ms 1764 KB Output is correct
16 Correct 53 ms 1764 KB Output is correct
17 Correct 69 ms 1764 KB Output is correct
18 Correct 59 ms 1764 KB Output is correct
19 Correct 67 ms 1764 KB Output is correct
20 Correct 56 ms 1764 KB Output is correct
21 Correct 63 ms 1764 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 1764 KB Output isn't correct
2 Halted 0 ms 0 KB -