oj.uz

Submission #1069568

# Submission time Handle Problem Language Result Execution time Memory
1069568 2024-08-22T06:04:42 Z Muhammet Palembang Bridges (APIO15_bridge) C++17
0 / 100
 1 ms 604 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long int
#define sz(x) (int)x.size()
#define ff first
#define ss second

const ll N = 300005;
const ll M = 1e9 + 7;

int T, n, k, s1[N], s2[N];

char c1[N], c2[N];

int main(){
	ios::sync_with_stdio(false); cin.tie(0);

	cin >> k >> n;
	int ans = 0, x = 0;
	for(int i = 1; i <= n; i++){
		cin >> c1[i] >> s1[i] >> c2[i] >> s2[i];
		if(c1[i] == c2[i]){
			ans += abs(s1[i]-s2[i]);
		}
		else {
			if(i == 1){
				x = (s1[i]+s2[i])/2;
			}
			else {
				x = (x+(s1[i]+s2[i])/2)/2;
			}
		}
	}

	for(int i = 1; i <= n; i++){
		if(c1[i] != c2[i]){
			ans += (abs(s1[i]-x));
			ans += (abs(s2[i]-x));
			ans++;
		}
	}

	cout << ans;

	return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 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 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Incorrect 1 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -

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