oj.uz

답안 #922585

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922585 2024-02-05T17:16:56 Z tvladm2009 전선 연결 (IOI17_wiring) C++14
0 / 100
 0 ms 436 KB 
#include "wiring.h"
#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";

ll min_total_length(vector<int> r, vector<int> b) {
	vector<int> pos[2];
	pos[0] = r;
	pos[1] = b;
	vector<pair<int, int>> v;
	for (auto x: r) {
		v.pb(mp(x, 0));
	}
	for (auto x: b) {
		v.pb(mp(x, 1));
	}
	sort(all(v));
	vector<ll> dp(sz(v), 1e18);
	map<int, int> mem;
	mem[0] = -1;
	int pr = 0;
	vector<ll> sum[2];
	sum[0].resize(sz(v));
	sum[1].resize(sz(v));
	for (int i = 0; i < sz(v); i++) {
		if (i > 0) {
			sum[0][i] = sum[0][i - 1];
			sum[1][i] = sum[1][i - 1];
		}
		sum[v[i].second][i] += v[i].first;
		if (v[i].second == 1) {
			pr++;
		} else {
			pr--;
		}
		int op = v[i].second ^ 1;
		int ind = lower_bound(all(pos[op]), v[i].first) - pos[op].begin();
		ll close = 1e18;
		for (int d : {ind, ind - 1}) {
			if (0 <= d && d < sz(pos[d])) {
				chkmin(close, (ll)abs(pos[op][d] - v[i].first));
			}
		}
		dp[i] = (i == 0 ? 0 : dp[i - 1]) + close;
		if (mem.count(pr)) {
			int l = mem[pr] + 1;
			ll offset = sum[v[i].second][i] - ((l - 1 >= 0) ? sum[v[i].second][l - 1] : 0);
			offset -= sum[1 - v[i].second][i] - ((l - 1 >= 0) ? sum[1 - v[i].second][l - 1] : 0);
			chkmin(dp[i], offset + ((l - i >= 0) ? dp[l - 1] : 0));
		}
		mem[pr] = i;
	}
	return dp.back();
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '25859', found: '15548'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '904', found: '326'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '316', found: '188'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 436 KB 3rd lines differ - on the 1st token, expected: '27', found: '1'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '25859', found: '15548'
2 Halted 0 ms 0 KB -