Submission #492427

#	Time	Username	Problem	Language	Result	Execution time	Memory
492427		pavement	Coin Collecting (JOI19_ho_t4)	C++17	0 / 100	1 ms	332 KiB

joi2019_ho_t4

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
#define int long long
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define ppb pop_back
#define eb emplace_back
#define g0(a) get<0>(a)
#define g1(a) get<1>(a)
#define g2(a) get<2>(a)
#define g3(a) get<3>(a)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef double db;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef tuple<int, int, int> iii;
typedef tuple<int, int, int, int> iiii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int N, ans, X[100005], Y[100005];
ii T[100005];

main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> N;
	for (int i = 1; i <= N * 2; i++) {
		cin >> X[i] >> Y[i];
		T[i] = mp(X[i], Y[i]);
	}
	sort(T + 1, T + 1 + N * 2);
	for (int i = 1; i <= N * 2; i++) tie(X[i], Y[i]) = T[i];
	for (int i = 1, cnt = 1; i <= N * 2; i += 2) {
		ans += min(llabs(X[i] - cnt) + llabs(Y[i] - 1) + llabs(X[i + 1] - cnt) + llabs(Y[i + 1] - 2), llabs(X[i] - cnt) + llabs(Y[i] - 2) + llabs(X[i + 1] - cnt) + llabs(Y[i + 1] - 1));
		cnt++;
	}
	cout << ans << '\n';
}

Compilation message (stderr)

joi2019_ho_t4.cpp:31:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   31 | main() {
      | ^~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 29
• Subtask 3: 0 / 63