oj.uz

답안 #475785

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
475785 2021-09-24T04:40:51 Z maomao90 Aesthetic (NOI20_aesthetic) C++17
35 / 100
 1951 ms 40352 KB 
#include <bits/stdc++.h> 
using namespace std;

template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
#define REP(i, s, e) for (int i = s; i < e; i++)
#define RREP(i, s, e) for (int i = s; i >= e; i--)
typedef long long ll;
typedef long double ld;
#define MP make_pair
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
#define MT make_tuple
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;

#ifdef DEBUG
#define debug(args...) printf(args)
#else
#define debug(args...)
#endif

#define INF 1000000005
#define LINF 1000000000000000005
#define MOD 1000000007
#define MAXN 300005

struct edge {
	int v, w, p;
};

int n, m;
vector<edge> adj[MAXN];
int a[MAXN], b[MAXN], w[MAXN], p[MAXN];
ll base;

priority_queue<pll, vector<pll>, greater<pll>> pq;
ll d1[MAXN], dn[MAXN];
void dij(int s, ll* d) {
	REP (i, 1, n + 1) {
		d[i] = LINF;
	}
	d[s] = 0;
	pq.push(MP(0, s));
	while (!pq.empty()) {
		auto [ud, u] = pq.top(); pq.pop();
		if (ud != d[u]) continue;
		for (edge e : adj[u]) {
			if (mnto(d[e.v], ud + e.w)) {
				pq.push(MP(d[e.v], e.v));
			}
		}
	}
}

ll x;
bool res;
int pre[MAXN], top[MAXN], ptr;
void dfs(int u, int p) {
	pre[u] = top[u] = ptr++;
	for (edge e : adj[u]) {
		if (e.v == p) continue;
		if (min(d1[u] + dn[e.v], d1[e.v] + dn[u]) + e.w > x + base) continue;
		if (pre[e.v] == -1) {
			dfs(e.v, u);
			mnto(top[u], top[e.v]);
			if (top[e.v] > pre[u]) {
				if ((min(d1[u] + dn[e.v], d1[e.v] + dn[u])
					   	+ e.w + e.p > x + base) && 
						pre[n] != -1 && 
						pre[n] >= pre[e.v])	{
					res = 1;
				}
			}
		} else {
			mnto(top[u], pre[e.v]);
		}
	}
}

bool isPos(ll x) {
	ptr = 0;
	::x = x;
	res = 0;
	memset(pre, -1, sizeof pre);
	dfs(1, -1);
	return res;
}

int main() {
	scanf("%d%d", &n, &m);
	REP (i, 0, m) {
		scanf("%d%d%d", &a[i], &b[i], &w[i]);
	}
	int mx = 0;
	RREP (i, m - 1, 0) {
		p[i] = mx;
		mxto(mx, w[i]);
	}
	REP (i, 0, m) {
		adj[a[i]].pb({b[i], w[i], p[i]});
		adj[b[i]].pb({a[i], w[i], p[i]});
	}
	dij(1, d1);
	dij(n, dn);
	base = d1[n];
	ll lo = 0, hi = INF, mid;
	while (lo < hi) {
		mid = lo + hi + 1 >> 1;
		if (isPos(mid)) {
			lo = mid;
		} else {
			hi = mid - 1;
		}
	}
	printf("%lld\n", base + lo + 1);
	return 0;
}

Compilation message

Aesthetic.cpp: In function 'int main()':
Aesthetic.cpp:117:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  117 |   mid = lo + hi + 1 >> 1;
      |         ~~~~~~~~^~~
Aesthetic.cpp:99:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   99 |  scanf("%d%d", &n, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~
Aesthetic.cpp:101:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  101 |   scanf("%d%d%d", &a[i], &b[i], &w[i]);
      |   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8524 KB Output is correct
2 Correct 6 ms 8524 KB Output is correct
3 Correct 7 ms 8524 KB Output is correct
4 Correct 6 ms 8524 KB Output is correct
5 Correct 7 ms 8564 KB Output is correct
6 Correct 7 ms 8524 KB Output is correct
7 Correct 7 ms 8524 KB Output is correct
8 Correct 6 ms 8568 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8524 KB Output is correct
2 Correct 6 ms 8524 KB Output is correct
3 Correct 7 ms 8524 KB Output is correct
4 Correct 6 ms 8524 KB Output is correct
5 Correct 7 ms 8564 KB Output is correct
6 Correct 7 ms 8524 KB Output is correct
7 Correct 7 ms 8524 KB Output is correct
8 Correct 6 ms 8568 KB Output is correct
9 Correct 6 ms 8652 KB Output is correct
10 Correct 7 ms 8616 KB Output is correct
11 Correct 7 ms 8652 KB Output is correct
12 Correct 8 ms 8652 KB Output is correct
13 Correct 7 ms 8684 KB Output is correct
14 Correct 7 ms 8652 KB Output is correct
15 Correct 7 ms 8652 KB Output is correct
16 Correct 7 ms 8652 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 394 ms 31196 KB Output is correct
2 Correct 437 ms 31236 KB Output is correct
3 Correct 438 ms 31164 KB Output is correct
4 Correct 410 ms 31172 KB Output is correct
5 Correct 436 ms 31252 KB Output is correct
6 Correct 462 ms 31776 KB Output is correct
7 Correct 432 ms 31648 KB Output is correct
8 Correct 410 ms 31728 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 455 ms 31864 KB Output is correct
2 Correct 450 ms 31436 KB Output is correct
3 Correct 391 ms 30912 KB Output is correct
4 Correct 458 ms 31024 KB Output is correct
5 Correct 449 ms 31428 KB Output is correct
6 Correct 465 ms 31300 KB Output is correct
7 Correct 470 ms 31436 KB Output is correct
8 Correct 434 ms 31592 KB Output is correct

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1951 ms 40352 KB Output is correct
2 Correct 706 ms 32404 KB Output is correct
3 Incorrect 979 ms 38940 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1951 ms 40352 KB Output is correct
2 Correct 706 ms 32404 KB Output is correct
3 Incorrect 979 ms 38940 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 8524 KB Output is correct
2 Correct 6 ms 8524 KB Output is correct
3 Correct 7 ms 8524 KB Output is correct
4 Correct 6 ms 8524 KB Output is correct
5 Correct 7 ms 8564 KB Output is correct
6 Correct 7 ms 8524 KB Output is correct
7 Correct 7 ms 8524 KB Output is correct
8 Correct 6 ms 8568 KB Output is correct
9 Correct 6 ms 8652 KB Output is correct
10 Correct 7 ms 8616 KB Output is correct
11 Correct 7 ms 8652 KB Output is correct
12 Correct 8 ms 8652 KB Output is correct
13 Correct 7 ms 8684 KB Output is correct
14 Correct 7 ms 8652 KB Output is correct
15 Correct 7 ms 8652 KB Output is correct
16 Correct 7 ms 8652 KB Output is correct
17 Correct 394 ms 31196 KB Output is correct
18 Correct 437 ms 31236 KB Output is correct
19 Correct 438 ms 31164 KB Output is correct
20 Correct 410 ms 31172 KB Output is correct
21 Correct 436 ms 31252 KB Output is correct
22 Correct 462 ms 31776 KB Output is correct
23 Correct 432 ms 31648 KB Output is correct
24 Correct 410 ms 31728 KB Output is correct
25 Correct 455 ms 31864 KB Output is correct
26 Correct 450 ms 31436 KB Output is correct
27 Correct 391 ms 30912 KB Output is correct
28 Correct 458 ms 31024 KB Output is correct
29 Correct 449 ms 31428 KB Output is correct
30 Correct 465 ms 31300 KB Output is correct
31 Correct 470 ms 31436 KB Output is correct
32 Correct 434 ms 31592 KB Output is correct
33 Correct 1951 ms 40352 KB Output is correct
34 Correct 706 ms 32404 KB Output is correct
35 Incorrect 979 ms 38940 KB Output isn't correct
36 Halted 0 ms 0 KB -