oj.uz

답안 #671177

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
671177 2022-12-12T09:31:48 Z NothingXD Palembang Bridges (APIO15_bridge) C++17
9 / 100
 2000 ms 360 KB 
#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
/*typedef __uint128_t L;
  struct FastMod {
  ull b, m;
  FastMod(ull b) : b(b), m(ull((L(1) << 64) / b)) {}
  ull reduce(ull a) {
  ull q = (ull)((L(m) * a) >> 64);
  ull r = a - q * b; // can be proven that 0 <= r < 2*b
  return r >= b ? r - b : r;
  }
  };
  FastMod FM(2);*/
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
	cerr << " " << H;
	debug_out(T...);
}

#define debug(...) cerr << "(" << #__VA_ARGS__ << "):", debug_out(__VA_ARGS__)
#define all(x) x.begin(), x.end()
#define MP(x, y) make_pair(x, y)
#define F first
#define S second

//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 1e5 + 10;
const ll inf = 1e18;
int n, k, x[maxn], y[maxn];
vector<int> num;
ll res, ans;
int main(){
	ios_base::sync_with_stdio(false); cin.tie(0);

	cin >> k >> n;

	for (int i = 1; i <= n; i++){
		char s, t; cin >> s >> x[i] >> t >> y[i];
		if (x[i] > y[i]) swap(x[i], y[i]);
		if (s == t){
			res += y[i] - x[i];
			x[i] = y[i] = -1;
			continue;
		}
		num.push_back(x[i]);
		num.push_back(y[i]);
	}

	if (num.empty()) return cout << res << '\n', 0;

	sort(all(num));
	num.resize(distance(num.begin(), unique(all(num))));

	int N = num.size();
	ll ans = inf;

	for (int i = 0; i < N; i++){
		for (int j = i+1; j < N; j++){
			ll sum = 0;
			for (int k = 1; k <= n; k++){
				if (x[k] == -1) continue;
				sum += min(abs(x[k] - num[i]) + abs(y[k] - num[i]), abs(x[k] - num[j]) + abs(y[k] - num[j])) + 1;
			}
			ans = min(ans, sum);
		}
	}

	cout << ans + res << '\n';

	return 0;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 14.0

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

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 340 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 336 KB Output is correct
9 Correct 7 ms 212 KB Output is correct
10 Correct 6 ms 280 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 212 KB Output is correct

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 212 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 10 ms 340 KB Output is correct
9 Correct 7 ms 212 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 8 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 17 ms 340 KB Output is correct
15 Execution timed out 2081 ms 340 KB Time limit exceeded
16 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 5 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 7 ms 212 KB Output is correct
9 Correct 7 ms 332 KB Output is correct
10 Correct 6 ms 340 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 7 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 17 ms 360 KB Output is correct
15 Execution timed out 2076 ms 340 KB Time limit exceeded
16 Halted 0 ms 0 KB -