oj.uz

Submission #905909

# Submission time Handle Problem Language Result Execution time Memory
905909 2024-01-13T07:03:46 Z Muhammad_Aneeq Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 348 KB 
/*
بسم الله الرحمن الرحيم
Author:
                          (:Muhammad Aneeq:)
*/

#include <iostream>
#include <vector>
using namespace std;
void solve()
{
	int k,n;
	cin>>k>>n;
	int ans=0;
	vector<pair<int,int>>d;
	int z=0;
	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);
			d.push_back({x,y});
		}	
	}
	z/=max(1,int(d.size()));
	for (auto i:d)
		ans+=(abs(i.first-z)+abs(i.second-z))+1;
	cout<<ans<<endl;
}
int main()
{
  ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
        solve();
}

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

Subtask #2
0 / 14.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 344 KB Output isn't correct
4 Halted 0 ms 0 KB -

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 344 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 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 -