oj.uz

Submission #720765

# Submission time Handle Problem Language Result Execution time Memory
720765 2023-04-09T09:54:08 Z mseebacher Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h> 
 
using namespace std;
 
// Idee 1 -> Set mit Wert|Index pair
// Idee 2 -> SegTree damit
 
 
void solve(){
	int k; cin >> k;
	int n; cin >> n;
	
	
	vector<int> diff;
	long long sum = 0;
	for(int i = 0;i<n;i++){
		char t1,t2;
		int c1,c2;
		cin >> t1 >> c1 >> t2 >> c2;
		
		if(t1 == t2){
			sum += abs(c2-c1);
		}else{
			diff.push_back(c1);
			diff.push_back(c2);
		}
	}
	if(diff.size() == 0) return;
	sort(diff.begin(),diff.end());
	sum += (diff.size() >> 1);
	int mid = (diff[diff.size()/2]+diff[(diff.size()-1)/2]) >> 1;
	for(int i = 0;i<(int)diff.size();i++){
		sum += abs(diff[i]-mid);
	}
	
	cout << sum << " ";
	
}
 
int main(){
    ios::sync_with_stdio(0);
    cin.tie(nullptr);
    cout << fixed << setprecision(8);
 
    solve();
}

Subtask #1
0 / 8.0

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

Subtask #2
0 / 14.0

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

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 212 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 212 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 212 KB Output isn't correct
2 Halted 0 ms 0 KB -