oj.uz

Submission #660004

# Submission time Handle Problem Language Result Execution time Memory
660004 2022-11-20T08:31:45 Z aebov Palembang Bridges (APIO15_bridge) C++17
22 / 100
 38 ms 1492 KB 
#include<iostream>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<map>
#include<unordered_map>
#include<vector>
#include<set>
#define F first
#define S second
#define ll long long
#define pb push_back
using namespace std;

const int N = (int)1e5 + 5, mod = (ll)1e9 + 7;
int n, k, x, y;
char ch, hc;
vector<int> vc;
ll sm = 0;

int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> k >> n;
	if(k != 1)exit(0);
	for(int i = 1; i <= n; i ++){
		cin >> ch >> x >> hc >> y;
		if(ch == hc) sm += abs(x - y);
		else sm ++, vc.pb(x), vc.pb(y);
	}
	sort(vc.begin(), vc.end());
	int pos = vc[(vc.size() - 1) / 2];
	for(auto x : vc)sm += abs(x - pos);
	cout << sm << endl;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 224 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 20 ms 1492 KB Output is correct
13 Correct 38 ms 1492 KB Output is correct
14 Correct 26 ms 1380 KB Output is correct
15 Correct 22 ms 940 KB Output is correct
16 Correct 28 ms 1420 KB Output is correct
17 Correct 25 ms 1392 KB Output is correct
18 Correct 32 ms 1492 KB Output is correct
19 Correct 37 ms 1428 KB Output is correct
20 Correct 31 ms 1488 KB Output is correct
21 Correct 32 ms 1424 KB Output is correct

Subtask #3
0 / 9.0

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