oj.uz

답안 #1102992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1102992 2024-10-19T10:22:08 Z vjudge1 Travelling Merchant (CCO21_day2problem1) C++17
25 / 25
 116 ms 20408 KB 
#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt")

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); ++i)
#define Fore(i, a, b) for (auto i = (a); i >= (b); --i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define ret(s) return void(cout << s);

const int mod = 1e9 + 7, mod2 = 998244353;
const double PI = acos(-1), eps = 1e-9;
const ull npos = string::npos;
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {if (a >= m) a%=m;if (b >= m) b%=m;return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {if (a >= m) a%=m;if (b >= m) b%=m;ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll bin_pow(ll a, ll b, ll m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;if (a >= m) a%=m; while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; ++i) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; ++i) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; ++i) {if (n % i == 0) {int k = 0; while (n % i == 0) ++k, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
int Log2(int n) {return 31 - __builtin_clz(n);}
ll Log2(ll n) {return 63 - __builtin_clzll(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; if (a < 0) s+='-', a = -a; if (a == 0) s+='0'; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

constexpr int N = 2e5 + 5;
struct edge {
	int u, v, r, p;
	edge(int u = 0, int v = 0, int r = 0, int p = 0): u(u), v(v), r(r), p(p) {}
};
vi g[N];
ll f[N];
int d[N];
bool c[N];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
	int n, m; cin >> n >> m;
	vector<edge> e;
	For(i,0,m){
		int u, v, r, p; cin >> u >> v >> r >> p;
		++d[u];
		e.eb(u, v, r, p);
	}
	queue<int> q;
	FOR(i,1,n){
		if (!d[i]) q.push(i);
	}
	sort(all(e), [](edge &x, edge &y) {return x.r > y.r;});
	For(i,0,m) g[e[i].v].pb(i);
	memset(f, 0x3f, sizeof(f));
	For(k,0,m){
		while (!q.empty()) {
			int v = q.front(); q.pop();
			trav(i,g[v]){
				if (c[i]) continue;
				c[i] = 1;
				auto [u, _, r, p] = e[i];
				f[u] = min(f[u], max(f[v] - p, (ll)r));
				if (--d[u] == 0) q.push(u);
			}
		}
		if (c[k]) continue;
		c[k] = 1;
		auto [u, v, r, p] = e[k];
		f[u] = min(f[u], (ll)r);
		if (--d[u] == 0) q.push(u);
	}
	FOR(i,1,n) cout << (f[i] > 1e18 ? -1: f[i]) << ' ';
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7504 KB Output is correct
2 Correct 4 ms 7504 KB Output is correct
3 Correct 4 ms 7504 KB Output is correct
4 Correct 4 ms 7504 KB Output is correct
5 Correct 3 ms 7504 KB Output is correct
6 Correct 3 ms 7504 KB Output is correct
7 Correct 4 ms 7504 KB Output is correct
8 Correct 4 ms 7504 KB Output is correct
9 Correct 4 ms 7672 KB Output is correct
10 Correct 4 ms 7504 KB Output is correct
11 Correct 4 ms 7672 KB Output is correct
12 Correct 4 ms 7504 KB Output is correct
13 Correct 4 ms 7504 KB Output is correct
14 Correct 4 ms 7504 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 115 ms 16764 KB Output is correct
2 Correct 108 ms 17224 KB Output is correct
3 Correct 62 ms 14040 KB Output is correct
4 Correct 17 ms 9172 KB Output is correct
5 Correct 107 ms 16168 KB Output is correct
6 Correct 89 ms 16384 KB Output is correct
7 Correct 65 ms 13760 KB Output is correct
8 Correct 113 ms 19972 KB Output is correct
9 Correct 114 ms 18832 KB Output is correct
10 Correct 65 ms 13760 KB Output is correct
11 Correct 83 ms 15104 KB Output is correct
12 Correct 46 ms 13932 KB Output is correct
13 Correct 54 ms 13652 KB Output is correct
14 Correct 116 ms 20336 KB Output is correct
15 Correct 107 ms 20408 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7504 KB Output is correct
2 Correct 4 ms 7504 KB Output is correct
3 Correct 4 ms 7504 KB Output is correct
4 Correct 4 ms 7504 KB Output is correct
5 Correct 3 ms 7504 KB Output is correct
6 Correct 3 ms 7504 KB Output is correct
7 Correct 4 ms 7504 KB Output is correct
8 Correct 4 ms 7504 KB Output is correct
9 Correct 4 ms 7672 KB Output is correct
10 Correct 4 ms 7504 KB Output is correct
11 Correct 4 ms 7672 KB Output is correct
12 Correct 4 ms 7504 KB Output is correct
13 Correct 4 ms 7504 KB Output is correct
14 Correct 4 ms 7504 KB Output is correct
15 Correct 115 ms 16764 KB Output is correct
16 Correct 108 ms 17224 KB Output is correct
17 Correct 62 ms 14040 KB Output is correct
18 Correct 17 ms 9172 KB Output is correct
19 Correct 107 ms 16168 KB Output is correct
20 Correct 89 ms 16384 KB Output is correct
21 Correct 65 ms 13760 KB Output is correct
22 Correct 113 ms 19972 KB Output is correct
23 Correct 114 ms 18832 KB Output is correct
24 Correct 65 ms 13760 KB Output is correct
25 Correct 83 ms 15104 KB Output is correct
26 Correct 46 ms 13932 KB Output is correct
27 Correct 54 ms 13652 KB Output is correct
28 Correct 116 ms 20336 KB Output is correct
29 Correct 107 ms 20408 KB Output is correct
30 Correct 110 ms 16824 KB Output is correct
31 Correct 97 ms 16824 KB Output is correct
32 Correct 53 ms 13940 KB Output is correct
33 Correct 16 ms 9428 KB Output is correct
34 Correct 94 ms 16496 KB Output is correct
35 Correct 86 ms 20408 KB Output is correct
36 Correct 63 ms 13992 KB Output is correct
37 Correct 106 ms 19892 KB Output is correct
38 Correct 115 ms 18300 KB Output is correct
39 Correct 64 ms 13760 KB Output is correct
40 Correct 88 ms 17348 KB Output is correct
41 Correct 43 ms 13840 KB Output is correct
42 Correct 40 ms 13920 KB Output is correct
43 Correct 96 ms 20152 KB Output is correct
44 Correct 92 ms 20008 KB Output is correct
45 Correct 102 ms 20288 KB Output is correct
46 Correct 64 ms 16572 KB Output is correct
47 Correct 66 ms 16312 KB Output is correct
48 Correct 69 ms 15860 KB Output is correct
49 Correct 75 ms 19072 KB Output is correct
50 Correct 4 ms 7504 KB Output is correct