oj.uz

답안 #1051338

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1051338 2024-08-10T04:47:08 Z pawned 전선 연결 (IOI17_wiring) C++17
0 / 100
 158 ms 4304 KB 
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<ll> vi;

#include "wiring.h"

ll min_total_length(vector<int> r_g, vector<int> b_g) {
	vi r, b;
	for (int x : r_g)
		r.pb(x);
	for (int x : b_g)
		b.pb(x);
	int N = r.size();
	int M = b.size();
	map<int, ll> dp;
	// dp[i][j]: min cost to connect first i red (exclusive)
	// with first j blue (exclusive)
	dp[0] = 0;
	for (int i = 1; i <= N; i++) {
//		cout<<"at "<<i<<endl;
		map<int, ll> newdp;
		// consider only up to previous blue minus 10, next blue plus 10
		auto it = lower_bound(b.begin(), b.end(), i);
		ll lb = max(1, (int)(it - b.begin()) - 10);
		ll rb = min(M, (int)(it - b.begin()) + 10);
		for (int j = lb; j <= rb; j++) {	// only consider up to consec
//			cout<<"j: "<<j<<endl;
			newdp[j] = 1e18;
			if (newdp.find(j - 1) != newdp.end())
				newdp[j] = min(newdp[j], newdp[j - 1] + abs(r[i - 1] - b[j - 1]));
			if (dp.find(j) != dp.end())
				newdp[j] = min(newdp[j], dp[j] + abs(r[i - 1] - b[j - 1]));
			if (dp.find(j - 1) != dp.end())
				newdp[j] = min(newdp[j], dp[j - 1] + abs(r[i - 1] - b[j - 1]));
		}
		dp = newdp;
/*		cout<<"dp: "<<endl;
		for (pair<int, ll> p : dp)
			cout<<p.fi<<": "<<p.se<<endl;*/
	}
	return dp[M];
}

Subtask #1
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 348 KB 3rd lines differ - on the 1st token, expected: '14340', found: '0'
3 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: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 87 ms 4304 KB 3rd lines differ - on the 1st token, expected: '1068938599', found: '0'
4 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Incorrect 158 ms 4304 KB 3rd lines differ - on the 1st token, expected: '373710605', found: '0'
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

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