oj.uz

Submission #914712

# Submission time Handle Problem Language Result Execution time Memory
914712 2024-01-22T15:05:08 Z 8pete8 Palembang Bridges (APIO15_bridge) C++17
22 / 100
 33 ms 4492 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<limits.h>
#include<cmath>
#include<set>
#include<algorithm>
#include<bitset> 
#include<stack>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,int>
#define pppiiii pair<pii,pii>
#define ppii pair<int,pii>
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
#define int long long
const ll mod=998244353,mxn=3*8e4+5,lg=30,inf=1e18,minf=-1e9,Mxn=100000;
int32_t main(){
	fastio
	int k,n;cin>>k>>n;
	if(k!=1)return 0;
	int ans=0;
	vector<int>v;
	pair<char,int>a,b;
	for(int i=0;i<n;i++){
		cin>>a.f>>a.s>>b.f>>b.s;
		if(a.f==b.f)ans+=abs(a.s-b.s);
		else v.pb(b.s),v.pb(a.s),ans++;
	}
	sort(all(v));
	for(auto i:v)ans+=abs(v[v.size()/2]-i);
	cout<<ans;
}

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 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 940 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 468 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 456 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 344 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 508 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 16 ms 3288 KB Output is correct
13 Correct 32 ms 4408 KB Output is correct
14 Correct 24 ms 3544 KB Output is correct
15 Correct 18 ms 2820 KB Output is correct
16 Correct 19 ms 3800 KB Output is correct
17 Correct 23 ms 4308 KB Output is correct
18 Correct 26 ms 4056 KB Output is correct
19 Correct 32 ms 4492 KB Output is correct
20 Correct 21 ms 3800 KB Output is correct
21 Correct 33 ms 4056 KB Output is correct

Subtask #3
0 / 9.0

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