oj.uz

답안 #660050

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
660050 2022-11-20T09:29:15 Z aebov Palembang Bridges (APIO15_bridge) C++17
22 / 100
 39 ms 1504 KB 
#include<iostream>
#include<algorithm>
#include<cstring>
#include<iomanip>
#include<map>
#include<utility>
#include<unordered_map>
#include<vector>
#include<set>
#define pii pair<int,int>
#define pll pair<ll, ll>
#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;
ll sm = 0, sm2 = (ll)1e18 + 18;
vector<ll int> cv;
bool cmp(ll int i,ll int j){
//	cout << i << " " << j << endl;	
    return i < j;
}
void sub(){
	vector<pii> vc;
	cerr << "\n entered #sub 2 \n";
	for(int i = 0; i < n; i++){
		cin >> ch >>x >> hc >> y;
		if(ch == hc)sm += abs(x - y);
		else vc.pb({min(x,y), max(x,y)});
	}
	for (int i = 0; i < n; ++i)
        cv.push_back(vc[i].F), cv.push_back(vc[i].S);
    n = vc.size();
    for (int i = 0; i < (n << 1); i ++){
        for (int j = 0; j < (n << 1); j ++){
            ll tmt = 0;
            for (int k = 0; k < n; k ++){
                int tmv1 = abs(vc[k].F - cv[i]) + abs(vc[k].S - cv[i]);
                int tmv2 = abs(vc[k].F - cv[j]) + abs(vc[k].S - cv[j]);
                tmt += min(tmv1, tmv2);
            }
            sm2 = min(sm2, tmt);
        }
	}
	cout << sm + sm2 + vc.size() << endl;
	exit(0);
}
int main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> k >> n;
	vector<int> vc;
	if(k > 2)exit(0);
	if(k == 2) sub();
//	cerr << "\n enteres #sub1 \n";
	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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 340 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 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct

Subtask #2
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 26 ms 1460 KB Output is correct
13 Correct 39 ms 1492 KB Output is correct
14 Correct 28 ms 1492 KB Output is correct
15 Correct 21 ms 856 KB Output is correct
16 Correct 25 ms 1468 KB Output is correct
17 Correct 26 ms 1492 KB Output is correct
18 Correct 33 ms 1504 KB Output is correct
19 Correct 37 ms 1420 KB Output is correct
20 Correct 27 ms 1436 KB Output is correct
21 Correct 31 ms 1492 KB Output is correct

Subtask #3
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 1 ms 340 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -