oj.uz

Submission #496829

# Submission time Handle Problem Language Result Execution time Memory
496829 2021-12-22T05:00:52 Z armashka Coin Collecting (JOI19_ho_t4) C++17
8 / 100
 1000 ms 4988 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], ans = inf;

void rec(string s, ll cnt) {
	if (s.sz == 2 * n) {
		if (cnt < n || cnt > n) return;
		ll res = 0;
		pll d = {1, 1}, u = {1, 2};
		vector <pair<ll, ll>> a, b;
		for (int i = 0; i < s.sz; ++ i) {
			if (s[i] == '0') {
				a.pb({x[i], y[i]});				
			} else {
				b.pb({x[i], y[i]});				
			}
		}
		sort(all(a)); sort(all(b));
		for (auto [x, y] : a) {
			res += abs(x - d.ft) + abs(y - d.sd);
			++ d.ft;
		}
		for (auto [x, y] : b) {
        	res += abs(x - u.ft) + abs(y - u.sd);
			++ u.ft;
		}
		ans = min(ans, res);
		return;		
	}
	if (cnt + 1 <= n) rec(s + "1", cnt + 1);
	rec(s + "0", cnt);
}

const void solve(/*Armashka*/) {
	cin >> n;
	for (int i = 0; i < n * 2; ++ i) cin >> x[i] >> y[i];
	rec("", 0);
	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
*/

Compilation message

joi2019_ho_t4.cpp: In function 'void rec(std::string, ll)':
joi2019_ho_t4.cpp:34:11: warning: comparison of integer expressions of different signedness: 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   34 |  if (s.sz == 2 * n) {
      |      ~~~~~^~~~~~~~
joi2019_ho_t4.cpp:39:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |   for (int i = 0; i < s.sz; ++ i) {
      |                     ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 249 ms 300 KB Output is correct
5 Correct 172 ms 300 KB Output is correct
6 Correct 200 ms 316 KB Output is correct
7 Correct 187 ms 204 KB Output is correct
8 Correct 187 ms 308 KB Output is correct
9 Correct 192 ms 204 KB Output is correct
10 Correct 188 ms 304 KB Output is correct
11 Correct 187 ms 204 KB Output is correct
12 Correct 192 ms 304 KB Output is correct
13 Correct 201 ms 304 KB Output is correct
14 Correct 204 ms 304 KB Output is correct
15 Correct 203 ms 308 KB Output is correct
16 Correct 191 ms 308 KB Output is correct
17 Correct 185 ms 204 KB Output is correct
18 Correct 231 ms 204 KB Output is correct
19 Correct 197 ms 304 KB Output is correct
20 Correct 244 ms 332 KB Output is correct
21 Correct 192 ms 308 KB Output is correct
22 Correct 200 ms 308 KB Output is correct
23 Correct 241 ms 204 KB Output is correct
24 Correct 197 ms 324 KB Output is correct
25 Correct 199 ms 320 KB Output is correct
26 Correct 192 ms 204 KB Output is correct
27 Correct 213 ms 308 KB Output is correct
28 Correct 206 ms 204 KB Output is correct
29 Correct 199 ms 308 KB Output is correct
30 Correct 246 ms 324 KB Output is correct
31 Correct 218 ms 432 KB Output is correct
32 Correct 198 ms 204 KB Output is correct
33 Correct 249 ms 304 KB Output is correct

Subtask #2
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 249 ms 300 KB Output is correct
5 Correct 172 ms 300 KB Output is correct
6 Correct 200 ms 316 KB Output is correct
7 Correct 187 ms 204 KB Output is correct
8 Correct 187 ms 308 KB Output is correct
9 Correct 192 ms 204 KB Output is correct
10 Correct 188 ms 304 KB Output is correct
11 Correct 187 ms 204 KB Output is correct
12 Correct 192 ms 304 KB Output is correct
13 Correct 201 ms 304 KB Output is correct
14 Correct 204 ms 304 KB Output is correct
15 Correct 203 ms 308 KB Output is correct
16 Correct 191 ms 308 KB Output is correct
17 Correct 185 ms 204 KB Output is correct
18 Correct 231 ms 204 KB Output is correct
19 Correct 197 ms 304 KB Output is correct
20 Correct 244 ms 332 KB Output is correct
21 Correct 192 ms 308 KB Output is correct
22 Correct 200 ms 308 KB Output is correct
23 Correct 241 ms 204 KB Output is correct
24 Correct 197 ms 324 KB Output is correct
25 Correct 199 ms 320 KB Output is correct
26 Correct 192 ms 204 KB Output is correct
27 Correct 213 ms 308 KB Output is correct
28 Correct 206 ms 204 KB Output is correct
29 Correct 199 ms 308 KB Output is correct
30 Correct 246 ms 324 KB Output is correct
31 Correct 218 ms 432 KB Output is correct
32 Correct 198 ms 204 KB Output is correct
33 Correct 249 ms 304 KB Output is correct
34 Execution timed out 1075 ms 4988 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #3
0 / 63.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 249 ms 300 KB Output is correct
5 Correct 172 ms 300 KB Output is correct
6 Correct 200 ms 316 KB Output is correct
7 Correct 187 ms 204 KB Output is correct
8 Correct 187 ms 308 KB Output is correct
9 Correct 192 ms 204 KB Output is correct
10 Correct 188 ms 304 KB Output is correct
11 Correct 187 ms 204 KB Output is correct
12 Correct 192 ms 304 KB Output is correct
13 Correct 201 ms 304 KB Output is correct
14 Correct 204 ms 304 KB Output is correct
15 Correct 203 ms 308 KB Output is correct
16 Correct 191 ms 308 KB Output is correct
17 Correct 185 ms 204 KB Output is correct
18 Correct 231 ms 204 KB Output is correct
19 Correct 197 ms 304 KB Output is correct
20 Correct 244 ms 332 KB Output is correct
21 Correct 192 ms 308 KB Output is correct
22 Correct 200 ms 308 KB Output is correct
23 Correct 241 ms 204 KB Output is correct
24 Correct 197 ms 324 KB Output is correct
25 Correct 199 ms 320 KB Output is correct
26 Correct 192 ms 204 KB Output is correct
27 Correct 213 ms 308 KB Output is correct
28 Correct 206 ms 204 KB Output is correct
29 Correct 199 ms 308 KB Output is correct
30 Correct 246 ms 324 KB Output is correct
31 Correct 218 ms 432 KB Output is correct
32 Correct 198 ms 204 KB Output is correct
33 Correct 249 ms 304 KB Output is correct
34 Execution timed out 1075 ms 4988 KB Time limit exceeded
35 Halted 0 ms 0 KB -