結果

問題 No.468 役に立つ競技プログラミング実践編
ユーザー naimonon77
提出日時 2019-01-01 21:23:18
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 4,866 bytes
コンパイル時間 2,438 ms
コンパイル使用メモリ 196,536 KB
実行使用メモリ 50,764 KB
最終ジャッジ日時 2024-11-08 02:39:07
合計ジャッジ時間 7,988 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 21 TLE * 1 -- * 9
other AC * 3 -- * 3
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define NOMINMAX
#define TEST_MODE true

#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES

#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (a)-1; i >= (int)b; --i)
#define range(i, a, b, c) for (int i = a;             \
                                   c > 0 ? i < b : i > b; \
                                   i += c)
#define chmax(a, b) (a = (a) < (b) ? (b) : (a))
#define chmin(a, b) (a = (a) > (b) ? (b) : (a))
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(a) begin(a), end(a)
#define ifnot(a) if (not(a))
#define int long long

#ifdef LOCAL_ENV

#if TEST_MODE == true
const bool test = true;
#define dump(x) cerr << #x << " : " << (x) << " "
#define dumpl(x) dump(x) << endl
#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

#else
const bool test = false;
#define dump(x) 
#define dumpl(x)
#endif

int dx[] = { 1, 0, -1, 0 };
int dy[] = { 0, 1, 0, -1 };
const int INF = (int)1 << 60;
const int undefined = INF;
const ll INFL = (ll)1 << 60;
ll mod_n = (int)1e9 + 7;
const double eps = 1e-10;
typedef long double Real;
// return -1, 0, 1
int sgn(const Real &r) { return (r > eps) - (r < -eps); }
int sgn(const Real &a, const Real &b) { return sgn(a - b); }

//.....................
const int MAX = (int)2e5 + 5;

vector<string> split(const string &str, char sep)
{
	vector<string> v;
	stringstream ss(str);
	string buffer;
	while (getline(ss, buffer, sep))
	{
		v.push_back(buffer);
	}
	return v;
}

string join(const vector<string>& v, const string delim = 0) {
	string s;
	if (!v.empty()) {
		s += v[0];
		for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
			if (delim != "") s += delim;
			s += v[i];
		}
	}
	return s;
}

string operator * (const string& s, const int& n) {
	string res = "";
	rep(i, n) res += s;
	return res;
}

template <class InputIterator>
int sum(InputIterator begin, InputIterator end)
{
	return accumulate(begin, end, 0ll);
}

template<typename T>
T gcd(T a, T b)
{
	T c;
	while (a != 0) {
		c = a; a = b%a;  b = c;
	}
	return b;
}

template<typename T>
T bit_count(T N) {
	T cnt = 0;
	while (N) {
		if (N & 1) cnt++;
		N >>= 1;
	}
	return cnt;
}

template<typename T>
void print_vec(ostream& ostream, vector<T> a) {
	rep(i, a.size() - 1) ostream << a[i] << " ";
	ostream << a.back() << endl;
}

ll pow_n(ll x, ll n) {
	ll res = 1;
	while (n > 0) {
		if (n & 1) res = res * x;
		x = x * x;
		n >>= 1;
	}
	return res;
}

class Solver {
public:
	int H, W;

	bool grid_ng(int y, int x) {
		return y < 0 || y >= H || x < 0 || x >= W;
	}

	struct Point {
		int x, y, v;
		Point(int x_, int y_) : x(x_), y(y_) {}
		bool operator < (const Point& r) const {
			if (y != r.y) return y < r.y;
			return x < r.x;
		}
	};

	struct Job {
		int id, next, time;
	};
	
	struct Pre_info {
		int id;
		int time;
		Pre_info(int id_, int time_) : id(id_), time(time_) {}
	};
	
	struct Human {
		vector<Job> jobs;
		int id;
		int cnt = 0;
		int time = 0;
		vector<Pre_info> pre;
	};

	int N, M;
	vector<Job> jobs;
	vector<Human> humans;

	void solve() {
		cin >> N >> M;
		humans.resize(N);
		jobs.resize(M);
		rep(i, M) {
			auto& job = jobs[i];
			//cerr << "!" << endl;
			cin >> job.id >> job.next >> job.time;
			humans[job.id].jobs.push_back(job);
			humans[job.next].cnt += 1;
		}
		vector<Human> cur, next;
		rep(i, humans.size()) humans[i].id = i;
		for (auto& human : humans) {
			if (human.cnt == 0) cur.push_back(human);
		}
		int res = 0;
		while (not cur.empty()) {
			next.clear();
			rep(i, cur.size()) {
				rep(j, cur[i].jobs.size()) {
					auto& job = cur[i].jobs[j];
					auto& next_human = humans[job.next];
					int next_time = cur[i].time + job.time;
					if (next_human.time <= next_time) {
						next_human.time = cur[i].time + job.time;
						next_human.pre.push_back(Pre_info(cur[i].id, next_time));
					}
					chmax(res, next_human.time);
					next_human.cnt -= 1;
					if (next_human.cnt == 0) {
						next.push_back(next_human);
					}
				}
			}
			cur = next;
		}
		cur.push_back(humans[N - 1]);
		set<int> visited;
		while (not cur.empty()) {
			next.clear();
			rep(i, cur.size()) {
				visited.insert(cur[i].id);
				auto pre = cur[i].pre;
				rep(j, pre.size()) { 
					if (pre[j].time == cur[i].time) {
						next.push_back(humans[pre[j].id]);
					}
				}
			}
			cur = next;
		}
		cout << res << " ";
		cout << N - visited.size() << "/" << N << endl;
	}
};

signed main()
{
	srand((unsigned int)time(NULL));
	cout << fixed << setprecision(20);
	auto ptr = new Solver();
	ptr->solve();
	delete ptr;
	//while (true) {
	//	if (cin.eof() == true) break;
	//	auto ptr = new Solver();
	//	ptr->solve();
	//	delete ptr;
	//}
	return 0;
}
0