oj.uz

답안 #103379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103379 2019-03-30T05:36:14 Z RockyB 전선 연결 (IOI17_wiring) C++17
0 / 100
 1000 ms 23628 KB 
/// In The Name Of God
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)4e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
 
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
vector < pair <int, int > > t;
ll dp[N];

ll get(int l, int r) {
	int n, m;
	int id = -1;
	rep(i, l, r - 1) {
		if (t[i].s != t[i + 1].s) {
			n = i - l + 1;
			m = r - i;
			id = i;
			break;
		}
	}
	ll res = 0;
	rep(i, l, id) res += t[id].f - t[i].f;
	rep(i, id + 1, r) res += t[i].f - t[id + 1].f;
	res += max(n, m) * (t[id + 1].f - t[id].f);
	return res;
}
ll calc(int v = 0) {
	if (v == sz(t)) return 0;
	if (~dp[v]) return dp[v];
	ll res = linf;
	{ /// go to the left
		bool ok = 0;
		per(i, v - 1, 0) {
			if (t[i].s != t[v].s) {
				ok = 1;
				res = min(res, calc(v + 1) + get(i, v));
			}
			else if (ok) break;
		}
	}
	{ /// go to the right
		bool ok = 0;
		rep(i, v + 1, sz(t) - 1) {
			if (t[i].s != t[v].s) {
				ok = 1;
				res = min(res, calc(i + 1) + get(v, i));
			}
			else if (ok) break;
		}
	}
	return dp[v] = res;
}
ll min_total_length(vector <int> _r, vector <int> _b) {
	for (auto it : _r) t.pb({it, 0});
	for (auto it : _b) t.pb({it, 1});
	sort(all(t));
	memset(dp, -1, sizeof(dp));
	return calc();
}
 
#ifdef IOI2018
 
namespace read {
 
	void read() {
		int n, m;
		assert(2 == scanf("%d %d", &n, &m));
 
		vector<int> r(n), b(m);
		for(int i = 0; i < n; i++)
			assert(1 == scanf("%d", &r[i]));
		for(int i = 0; i < m; i++)
			assert(1 == scanf("%d", &b[i]));
 
		long long res = min_total_length(r, b);
		printf("%lld\n", res);
		ioi
	}
}
 
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	read :: read();
	ioi
}
 
#endif

Compilation message

wiring.cpp: In function 'll get(int, int)':
wiring.cpp:42:9: warning: 'm' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int n, m;
         ^
wiring.cpp:42:6: warning: 'n' may be used uninitialized in this function [-Wmaybe-uninitialized]
  int n, m;
      ^

Subtask #1
0 / 7.0

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

Subtask #2
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3456 KB Output is correct
2 Correct 11 ms 3456 KB Output is correct
3 Execution timed out 1029 ms 11176 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

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

Subtask #4
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3456 KB Output is correct
2 Execution timed out 1072 ms 23268 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 45.0

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