oj.uz

Submission #602892

# Submission time Handle Problem Language Result Execution time Memory
602892 2022-07-23T12:27:35 Z fuad27 Palembang Bridges (APIO15_bridge) C++17
31 / 100
 2000 ms 2536 KB 
/*
 * Created: 2022-07-23 16:00
*/
#ifndef LOCAL
	#pragma GCC optimize("O3,unroll-loops")
	#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#endif

#include <bits/stdc++.h>
using namespace std;

using ll = long long;

#define FOR(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) FOR(i,0,b)
#define FORN(i,a,b) for(int i=int(b)-1;i>=a;i--)
#define per(i,b) FORN(i,0,b)

#define mkp make_pair
#define pb push_back
#define ep emplace_back
#define ff first
#define ss second
#define bg begin()
#define ed end()
#define sz(x) (int)x.size()
#define all(x) (x).bg,(x).ed
#define FIO ios_base::sync_with_stdio(0);\
	cin.tie(0);

template<class t> using vc=vector<t>;;
template<class t> using vvc=vc<vc<t>>;

using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi= vc<int>;
using vll= vc<ll>;


#ifdef LOCAL
#include "/home/fuad/cp/dbg.h"
#else
#define dbg(x...)
#endif

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

void solve() {
	int n, k;
	cin >> k >> n;
	if(k == 1) {
		vc<ll> v;
		ll ans=0;
		rep(i,n) {
			char a, b;
			int c, d;
			cin >> a >> c >> b >> d;
			if(a == b) {
				ans+=abs(c-d);
			}
			else {
				v.pb(c);
				v.pb(d);
			}
		}
		sort(all(v));
		int mid = v[v.size()/2];
		for(int i:v) {
			ans+=abs(i-mid);
		}
		cout << ans +v.size()/2<< "\n";
	}
	else {
		vc<ll> v;
		ll ans=0;
		vc<pll> vv;
		rep(i,n) {
			char a, b;
			int c, d;
			cin >> a >> c >> b >> d;
			if(a == b) {
				ans+=abs(c-d);
			}
			else {
				v.pb(c);
				v.pb(d);
				vv.pb(mkp(c,d));
			}
		}
		sort(all(v));
		ll ans2=1e18;
		if(v.size() == 0)ans2=0;
		for(int i:v) {
			for(int j:v) {
				ll res=0;
				for(auto c:vv) {
					res+=min(abs(c.ff-i)+abs(c.ss-i), abs(c.ff-j)+abs(c.ss-j))+1;
				}
				ans2=min(ans2,res);
			}
		}
		cout<<ans+ans2<<"\n";
	}
}

int main () {
	FIO;
	int t=1;
	// cin >> t;
	while(t--)
		solve();
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 1 ms 288 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 276 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 18 ms 2512 KB Output is correct
13 Correct 40 ms 2448 KB Output is correct
14 Correct 29 ms 2512 KB Output is correct
15 Correct 22 ms 1492 KB Output is correct
16 Correct 28 ms 2404 KB Output is correct
17 Correct 28 ms 2512 KB Output is correct
18 Correct 34 ms 2524 KB Output is correct
19 Correct 37 ms 2468 KB Output is correct
20 Correct 29 ms 2536 KB Output is correct
21 Correct 33 ms 2512 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 5 ms 212 KB Output is correct
4 Correct 6 ms 328 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 8 ms 332 KB Output is correct
8 Correct 8 ms 332 KB Output is correct
9 Correct 8 ms 328 KB Output is correct
10 Correct 8 ms 212 KB Output is correct
11 Correct 9 ms 212 KB Output is correct
12 Correct 7 ms 212 KB Output is correct

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 5 ms 212 KB Output is correct
4 Correct 6 ms 336 KB Output is correct
5 Correct 2 ms 212 KB Output is correct
6 Correct 0 ms 328 KB Output is correct
7 Correct 7 ms 212 KB Output is correct
8 Correct 9 ms 324 KB Output is correct
9 Correct 7 ms 328 KB Output is correct
10 Correct 7 ms 340 KB Output is correct
11 Correct 8 ms 328 KB Output is correct
12 Correct 9 ms 336 KB Output is correct
13 Execution timed out 2079 ms 340 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 6 ms 212 KB Output is correct
4 Correct 6 ms 212 KB Output is correct
5 Correct 2 ms 328 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 10 ms 332 KB Output is correct
8 Correct 7 ms 212 KB Output is correct
9 Correct 7 ms 212 KB Output is correct
10 Correct 8 ms 336 KB Output is correct
11 Correct 7 ms 212 KB Output is correct
12 Correct 7 ms 212 KB Output is correct
13 Execution timed out 2068 ms 332 KB Time limit exceeded
14 Halted 0 ms 0 KB -