oj.uz

답안 #496861

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496861 2021-12-22T05:40:59 Z armashka Coin Collecting (JOI19_ho_t4) C++17
0 / 100
 1 ms 332 KB 
#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 1e6 + 5;
const ll M = 1e8;
const ll inf = 1e18;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            

ll n, x[N], y[N], cnt[N][3], ans;
bool used[N];

const void solve(/*Armashka*/) {
	cin >> n;
	for (int i = 1; i <= n * 2; ++ i) {
		cin >> x[i] >> y[i];
		if (x[i] >= 1 && x[i] <= n && y[i] >= 1 && y[i] <= 2) ++ cnt[x[i]][y[i]];
	}	
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= 2; ++ j) {
			if (cnt[i][j]) continue;
			ll cur = -1, mn = inf;
			for (int k = 1; k <= n * 2; ++ k) {
				if (used[k]) continue;
				ll res = abs(i - x[k]) + abs(j - y[k]);
				if (x[k] >= 1 && x[k] <= n && y[k] >= 1 && y[k] <= 2) {
					if (cnt[x[k]][y[k]] > 1 && res < mn) mn = res, cur = k; 				
				} else if (res < mn) mn = res, cur = k;			
			}
			//cout << i << " " << j << " = " << x[cur] << " " << y[cur] << "\n";
			used[cur] = 1;
			ans += mn;
			if (x[cur] >= 1 && x[cur] <= n && y[cur] >= 1 && y[cur] <= 2) -- cnt[x[cur]][y[cur]];
		}
	}	
	cout << ans << "\n";
}
            
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

Subtask #1
0 / 8.0

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

Subtask #2
0 / 29.0

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

Subtask #3
0 / 63.0

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