oj.uz

답안 #41476

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41476 2018-02-17T09:20:44 Z cmaster Palembang Bridges (APIO15_bridge) C++14
0 / 100
 5 ms 632 KB 
#include <bits/stdc++.h>
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>*/
 
#define pb push_back
#define mp make_pair
#define sz(s) ((int)(s.size()))
#define all(s) s.begin(), s.end()
#define rep(i, a, n) for (int i = a; i <= n; ++i)
#define per(i, n, a) for (int i = n; i >= a; --i)
#define onlycin ios_base::sync_with_stdio(false); cin.tie(0) 
#define F first
#define S second
using namespace std;
// using namespace __gnu_pbds;
typedef long long ll;
typedef unsigned long long ull;
/*typedef tree<
pair < int, int >,
null_type,
less< pair < int, int > >,
rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;*/
// find_by_order() order_of_key()
const int MAXN = (int)5e5+228;
const char nxtl = '\n';
const int mod = (int)1e9+7;
const double eps = (double)1e-7;
template<typename T> inline bool updmin(T &a, const T &b) {return a > b ? a = b, 1 : 0;}
template<typename T> inline bool updmax(T &a, const T &b) {return a < b ? a = b, 1 : 0;}

int n, k;
bool side[2][MAXN];
int house[2][MAXN];

inline ll get(int pos) {
	ll ret = 0;
	rep(i, 1, n) {
		if(side[0][i] == side[1][i]) continue;
		ret += abs(pos - house[0][i])+abs(pos - house[1][i]) + 1;
	}
	return ret;
}

int main() {
	#ifdef accepted
		freopen(".in", "r", stdin);
		freopen(".out", "w", stdout);
	#endif
	onlycin;
	cin >> k >> n;
	ll cur = 0, res = LLONG_MAX;
	rep(i, 1, n) {
		char x, y; int q, w;
		cin >> x;	cin >> q;	cin >> y;	cin >> w;
		if(x == 'B') side[0][i] = 1;
		if(y == 'B') side[1][i] = 1;
		house[0][i] = q; house[1][i] = w;
		if(side[0][i] == side[1][i]) cur += abs(house[0][i]-house[1][i]);
	}
	rep(i, 1, n) if(updmin(res, get(i)));
	cout << res+cur << nxtl;
	
	return 0;
}

Subtask #1
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 380 KB Output is correct
2 Correct 2 ms 380 KB Output is correct
3 Correct 4 ms 424 KB Output is correct
4 Incorrect 5 ms 632 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 632 KB Output is correct
2 Correct 2 ms 632 KB Output is correct
3 Correct 5 ms 632 KB Output is correct
4 Incorrect 4 ms 632 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

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

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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