oj.uz

Submission #905937

# Submission time Handle Problem Language Result Execution time Memory
905937 2024-01-13T07:28:21 Z Muhammad_Aneeq Palembang Bridges (APIO15_bridge) C++17
22 / 100
 44 ms 3540 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define int long long
bool comp(pair<int,int>a,pair<int,int>b)
{
	return (b.second>a.second);
}
void solve()
{
	int k,n;
	cin>>k>>n;
	long long ans=0;
	int z=0;
	vector<int>f;
	for (int i=0;i<n;i++)
	{
		char a,b;
		int x,y;
		cin>>a>>x>>b>>y;
		if (a==b)
			ans+=abs(x-y);
		else
		{
			z+=abs(x-y);
			f.push_back(x);
			f.push_back(y);
		}	
	}
	sort(begin(f),end(f));
	int pre[f.size()+1]={};
	for (int i=0;i<f.size();i++)
		pre[i+1]=pre[i]+f[i];
	if (f.size())
	{
		long long r=1e15+10;
		for (auto i:f)
		{
			long long t=0;
			int g=lower_bound(begin(f),end(f),i)-begin(f);
			t+=pre[f.size()]-pre[g]-i*(f.size()-g);
			t+=i*(g+1)-pre[g+1];
			r=min(r,t);
		}
		ans+=r;
	}	
	cout<<ans+f.size()/2<<endl;
}
signed main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

Compilation message

bridge.cpp: In function 'void solve()':
bridge.cpp:39:16: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   39 |  for (int i=0;i<f.size();i++)
      |               ~^~~~~~~~~

Subtask #1
8.0 / 8.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 348 KB Output is correct
4 Correct 2 ms 344 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 600 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 19 ms 3540 KB Output is correct
13 Correct 44 ms 3532 KB Output is correct
14 Correct 28 ms 3284 KB Output is correct
15 Correct 24 ms 2264 KB Output is correct
16 Correct 22 ms 3540 KB Output is correct
17 Correct 33 ms 3532 KB Output is correct
18 Correct 36 ms 3532 KB Output is correct
19 Correct 43 ms 3528 KB Output is correct
20 Correct 24 ms 3528 KB Output is correct
21 Correct 38 ms 3540 KB Output is correct

Subtask #3
0 / 9.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 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

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

Subtask #5
0 / 37.0

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