oj.uz

Submission #915623

# Submission time Handle Problem Language Result Execution time Memory
915623 2024-01-24T11:22:34 Z tvladm2009 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 33 ms 5304 KB 
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
 
int k, n;
 
struct kek {
	char p;
	int s;
	char q;
	int t;
};
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	cin >> k >> n;
	ll add = 0;
	vector<kek> v;
	vector<int> points;
	for (int i = 1; i <= n; i++) {
		char p, q;
		int s, t;
		cin >> p >> s >> q >> t;
		if (p == q) {
			add += abs(s - t);
		} else {
			points.pb(s);
			points.pb(t);
			v.pb({p, s, q, t});
		}
	}
	if (k == 1) {
		sort(all(points));
		
		auto f = [&](int bridge) {
			ll res = 0;
			for (auto i: points) {
				res += abs(i - bridge);
			}
			res += v.size();
			return res;
		};
		
		int med = (sz(points) + 1) / 2;
		cout << f(points[med - 1]) + add << '\n';
	}
	return 0;
}

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 344 KB Output is correct
3 Correct 1 ms 344 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

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 0 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 604 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 468 KB Output is correct
12 Correct 17 ms 3784 KB Output is correct
13 Correct 33 ms 5264 KB Output is correct
14 Correct 24 ms 4368 KB Output is correct
15 Correct 19 ms 3276 KB Output is correct
16 Correct 21 ms 4548 KB Output is correct
17 Correct 23 ms 5304 KB Output is correct
18 Correct 32 ms 5208 KB Output is correct
19 Correct 31 ms 5304 KB Output is correct
20 Correct 22 ms 4804 KB Output is correct
21 Correct 30 ms 5060 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 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 -