oj.uz

답안 #868073

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
868073 2023-10-30T11:27:32 Z Nuraly_Serikbay Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 0 ms 348 KB 
//çalışan kazanır//
 
#include "bits/stdc++.h"
 
using namespace std;
 
#define int long long
#define pb push_back
#define S second
#define F first
#define all(x) x.begin(),x.end()
#define YOSIK() ios_base::sync_with_stdio(0),cin.tie(0)
int gcd (int a, int b) {if (b == 0){return a;}else {return gcd (b, a % b);}}
 
const int N = 4e5 + 15;
const int INF = 1e18;
const int MOD = 1e9 + 7;
const int MODD = 1070234587ll;
const double eps = 0.0001;
const int p = 87;

int n;// x[N], y[N], u[3];
int dp[2001][2001], cnt[N][3];
pair <int, int> x[N];

void solution () {
	cin >> n;
	for (int i = 1; i <= n * 2; ++ i) cin >> x[i].F >> x[i].S; 
	
	int res = 0;
	sort (x + 1, x + n + n + 1);
	for (int i = 0; i < n * 2; ++ i) {
		res += abs(x[i + 1].F - (i / 2 + 1));
		if (i % 2) {
			int w = abs(x[i + 1].S - 2) + abs(x[i].S - 1);
			w = min (w, abs(x[i].S - 2) + abs(x[i + 1].S - 1));
			res += w;
		//	cout << i << " => " << w << '\n';
		}
		
	}
	cout << res;
	return;	
}
 
signed main() {
	YOSIK();
	srand (time(0));
//	freopen ("E.in", "r", stdin);
//	freopen ("E.out", "w", stdout);
	int TT = 1;// cin >> TT;
	for (int i = 1; i <= TT; ++ i) {
//		cout << "Case " << i << ": ";
		solution ();
		
  	}
 
	return 0;
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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