Ten Point Round #16

Problem A. 社團旅遊的策略

出題者：ColtenOuO

首殺：Darren0724 - 01:03

出題者：ColtenOuO

首殺：Penguin07 - 05:12

	#include <bits/stdc++.h>

	using namespace std;

	#define MAXN 1005
	#define MAXM 105

	int n, m;
	int d[MAXM], pre[MAXM];
	int id[MAXN], t[MAXN], s[MAXN], c[MAXN];
	int p[MAXN][MAXM], ans[MAXN][MAXM];
	const int speed[4] = {0, 3, 2, 1}, stop[4] = {0, 6, 4, 2};

	int main() {
	cin >> n >> m;
	for (int i = 2; i <= m; i++) {
	cin >> d[i];
	pre[i] = pre[i - 1] + d[i];
	}
	for (int i = 0; i < n; i++) {
	cin >> id[i] >> t[i] >> s[i] >> c[i];
	for (int j = 1; j <= m; j++)
	ans[i][j] = -1;

	ans[i][1] = s[i];
	int tmp = s[i], now = 1;
	for (int j = 0; j < c[i]; j++) {
	cin >> p[i][j];
	ans[i][p[i][j]] = tmp + (pre[p[i][j]] - pre[now]) / speed[t[i]];
	tmp = ans[i][p[i][j]] + stop[t[i]];
	now = p[i][j];
	}
	}
	for (int i = 0; i < n; i++) {
	cout << id[i] << " ";
	for (int j = 1; j <= m; j++) {
	if (ans[i][j] < 0) cout << "-- ";
	else cout << ans[i][j] << " ";
	}
	cout << endl;
	}
	// system("pause");
	return 0;
	}