oj.uz

Submission #979690

# Submission time Handle Problem Language Result Execution time Memory
979690 2024-05-11T10:00:42 Z tamir1 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 31 ms 4996 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll ans,n,k,i,j,x,y,l,m,a[200005],z,mn=1e18;
array<ll,2> b[200005];
char s,t;
int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> k >> n;
	for(i=1;i<=n;i++){
		cin >> s >> x >> t >> y;
		if(s==t) ans+=abs(x-y);
		else{
			ans++;
			l++;
			a[l]=x;
			l++;
			a[l]=y;
			m++;
			b[m][0]=x;
			b[m][1]=y;
		}
	}
	sort(a+1,a+l+1);
	x=a[(l+1)/2];
	//cout << x << " ";
	if(k==1){
	for(i=1;i<=l;i++){
		ans+=abs(x-a[i]);
	}
	cout << ans;
	return 0;}
	for(i=1;i<l;i++){
		for(j=i+1;j<=l;j++){
			z=0;
			for(ll g=1;g<=m;g++){
				z+=min(abs(a[i]-b[g][0])+abs(a[i]-b[g][1]),abs(a[j]-b[g][0])+abs(a[j]-b[g][1]));
			}
			mn=min(mn,z);
		}
	}
	cout << ans+mn;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2524 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2396 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 14 ms 4952 KB Output is correct
13 Correct 31 ms 4956 KB Output is correct
14 Correct 22 ms 4956 KB Output is correct
15 Correct 18 ms 4700 KB Output is correct
16 Correct 21 ms 4952 KB Output is correct
17 Correct 22 ms 4996 KB Output is correct
18 Correct 25 ms 4952 KB Output is correct
19 Correct 29 ms 4956 KB Output is correct
20 Correct 20 ms 4956 KB Output is correct
21 Correct 28 ms 4952 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -