oj.uz

답안 #418935

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
418935 2021-06-06T08:56:15 Z ryansee Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 370 ms 108956 KB 
#include "bits/stdc++.h"
using namespace std;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

long long LLINF = 1e18;
int INF = 1e9+1e6;
#define MAXN (200006)
ll n, mx, P[MAXN], A[MAXN], C[MAXN], ans;
bitset<MAXN> vis;
vector<int> stk, cy;
vector<int> v[MAXN];
void cycle(int x) {
	vis[x]=1;
	stk.eb(x);
	if(!vis[P[x]]) cycle(P[x]);
	else {
		while(1) {
			if(stk.empty()) {
				cy.clear();
				break;
			}
			ll y=stk.back(); stk.pop_back();
			cy.eb(y);
			if(y==P[x]) break;
		}
	}
}
map<ll,ll> *mp[MAXN];
void dfs(int x) {
	mp[x] = new map<ll,ll>;
	for(auto i:v[x]) {
		dfs(i);
		if(mp[x]->size() < mp[i]->size()) mp[x] = mp[i];
	}
	for(auto i:v[x]) if(mp[x] != mp[i]) {
		for(auto j:*mp[i]) (*mp[x])[j.f] += j.s;
	}
	(*mp[x])[mx] += C[x];
	(*mp[x])[A[x]] -= C[x];
	(*mp[x])[A[x]-1] += C[x];
	auto it = mp[x]->find(A[x]);
	while(it->s < 0) {
		auto tmp = next(it);
		assert(tmp != mp[x]->end());
		tmp->s += it->s;
		mp[x]->erase(it);
		it = tmp;
	}
	if(it->s == 0) mp[x]->erase(it);
}
int main() {
	FAST
	cin>>n;
	FOR(i,1,n) cin>>P[i]>>A[i]>>C[i];
	mx = *max_element(A+1, A+n+1) + 1;
	FOR(i,1,n) A[i] = mx - A[i];
	FOR(i,1,n) if(!vis[i]) {
		stk.clear(), cy.clear();
		cycle(i);
		if(cy.size() <= 1) continue;
		sort(all(cy), [](int x,int y){return A[x]>A[y];});
		FOR(i,0,siz(cy)-2) {
			P[cy[i]] = cy[i+1];
		}
		P[cy.back()]=cy.back();
	}
	FOR(i,1,n) if(P[i] ^ i) v[P[i]].eb(i);
	FOR(i,1,n) if(P[i] == i) {
		dfs(i);
		ans += (*mp[i])[mx];
	}
	cout<<ans<<'\n';
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 9 ms 6516 KB Output is correct
6 Correct 8 ms 6092 KB Output is correct
7 Correct 9 ms 5964 KB Output is correct
8 Correct 9 ms 6540 KB Output is correct
9 Correct 8 ms 6092 KB Output is correct
10 Correct 8 ms 5964 KB Output is correct
11 Correct 7 ms 5836 KB Output is correct
12 Correct 8 ms 6308 KB Output is correct
13 Correct 6 ms 6348 KB Output is correct
14 Correct 7 ms 5964 KB Output is correct
15 Correct 7 ms 5928 KB Output is correct
16 Correct 10 ms 7012 KB Output is correct
17 Correct 8 ms 6348 KB Output is correct
18 Correct 6 ms 5756 KB Output is correct
19 Correct 8 ms 6220 KB Output is correct
20 Correct 7 ms 6092 KB Output is correct
21 Correct 6 ms 6092 KB Output is correct
22 Correct 7 ms 6152 KB Output is correct
23 Correct 7 ms 5836 KB Output is correct
24 Correct 9 ms 6220 KB Output is correct
25 Correct 7 ms 6092 KB Output is correct
26 Correct 7 ms 6348 KB Output is correct
27 Correct 8 ms 6260 KB Output is correct
28 Correct 8 ms 6332 KB Output is correct
29 Correct 7 ms 6476 KB Output is correct
30 Correct 8 ms 6476 KB Output is correct
31 Correct 8 ms 6420 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 9 ms 6516 KB Output is correct
6 Correct 8 ms 6092 KB Output is correct
7 Correct 9 ms 5964 KB Output is correct
8 Correct 9 ms 6540 KB Output is correct
9 Correct 8 ms 6092 KB Output is correct
10 Correct 8 ms 5964 KB Output is correct
11 Correct 7 ms 5836 KB Output is correct
12 Correct 8 ms 6308 KB Output is correct
13 Correct 6 ms 6348 KB Output is correct
14 Correct 7 ms 5964 KB Output is correct
15 Correct 7 ms 5928 KB Output is correct
16 Correct 10 ms 7012 KB Output is correct
17 Correct 8 ms 6348 KB Output is correct
18 Correct 6 ms 5756 KB Output is correct
19 Correct 8 ms 6220 KB Output is correct
20 Correct 7 ms 6092 KB Output is correct
21 Correct 6 ms 6092 KB Output is correct
22 Correct 7 ms 6152 KB Output is correct
23 Correct 7 ms 5836 KB Output is correct
24 Correct 9 ms 6220 KB Output is correct
25 Correct 7 ms 6092 KB Output is correct
26 Correct 7 ms 6348 KB Output is correct
27 Correct 8 ms 6260 KB Output is correct
28 Correct 8 ms 6332 KB Output is correct
29 Correct 7 ms 6476 KB Output is correct
30 Correct 8 ms 6476 KB Output is correct
31 Correct 8 ms 6420 KB Output is correct
32 Correct 11 ms 6604 KB Output is correct
33 Correct 366 ms 82776 KB Output is correct
34 Correct 275 ms 57924 KB Output is correct
35 Correct 332 ms 79636 KB Output is correct
36 Correct 277 ms 58220 KB Output is correct
37 Correct 231 ms 39392 KB Output is correct
38 Correct 201 ms 33216 KB Output is correct
39 Correct 204 ms 58232 KB Output is correct
40 Correct 183 ms 58180 KB Output is correct
41 Correct 133 ms 58248 KB Output is correct
42 Correct 196 ms 44228 KB Output is correct
43 Correct 183 ms 44164 KB Output is correct
44 Correct 328 ms 108956 KB Output is correct
45 Correct 306 ms 73312 KB Output is correct
46 Correct 131 ms 33176 KB Output is correct
47 Correct 338 ms 54356 KB Output is correct
48 Correct 178 ms 47392 KB Output is correct
49 Correct 136 ms 47236 KB Output is correct
50 Correct 207 ms 49528 KB Output is correct
51 Correct 135 ms 37100 KB Output is correct
52 Correct 252 ms 54796 KB Output is correct
53 Correct 158 ms 47672 KB Output is correct
54 Correct 144 ms 58136 KB Output is correct
55 Correct 241 ms 56588 KB Output is correct
56 Correct 250 ms 62532 KB Output is correct
57 Correct 203 ms 65592 KB Output is correct
58 Correct 231 ms 62848 KB Output is correct
59 Correct 229 ms 62916 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 9 ms 6516 KB Output is correct
6 Correct 8 ms 6092 KB Output is correct
7 Correct 9 ms 5964 KB Output is correct
8 Correct 9 ms 6540 KB Output is correct
9 Correct 8 ms 6092 KB Output is correct
10 Correct 8 ms 5964 KB Output is correct
11 Correct 7 ms 5836 KB Output is correct
12 Correct 8 ms 6308 KB Output is correct
13 Correct 6 ms 6348 KB Output is correct
14 Correct 7 ms 5964 KB Output is correct
15 Correct 7 ms 5928 KB Output is correct
16 Correct 10 ms 7012 KB Output is correct
17 Correct 8 ms 6348 KB Output is correct
18 Correct 6 ms 5756 KB Output is correct
19 Correct 8 ms 6220 KB Output is correct
20 Correct 7 ms 6092 KB Output is correct
21 Correct 6 ms 6092 KB Output is correct
22 Correct 7 ms 6152 KB Output is correct
23 Correct 7 ms 5836 KB Output is correct
24 Correct 9 ms 6220 KB Output is correct
25 Correct 7 ms 6092 KB Output is correct
26 Correct 7 ms 6348 KB Output is correct
27 Correct 8 ms 6260 KB Output is correct
28 Correct 8 ms 6332 KB Output is correct
29 Correct 7 ms 6476 KB Output is correct
30 Correct 8 ms 6476 KB Output is correct
31 Correct 8 ms 6420 KB Output is correct
32 Correct 11 ms 6604 KB Output is correct
33 Correct 366 ms 82776 KB Output is correct
34 Correct 275 ms 57924 KB Output is correct
35 Correct 332 ms 79636 KB Output is correct
36 Correct 277 ms 58220 KB Output is correct
37 Correct 231 ms 39392 KB Output is correct
38 Correct 201 ms 33216 KB Output is correct
39 Correct 204 ms 58232 KB Output is correct
40 Correct 183 ms 58180 KB Output is correct
41 Correct 133 ms 58248 KB Output is correct
42 Correct 196 ms 44228 KB Output is correct
43 Correct 183 ms 44164 KB Output is correct
44 Correct 328 ms 108956 KB Output is correct
45 Correct 306 ms 73312 KB Output is correct
46 Correct 131 ms 33176 KB Output is correct
47 Correct 338 ms 54356 KB Output is correct
48 Correct 178 ms 47392 KB Output is correct
49 Correct 136 ms 47236 KB Output is correct
50 Correct 207 ms 49528 KB Output is correct
51 Correct 135 ms 37100 KB Output is correct
52 Correct 252 ms 54796 KB Output is correct
53 Correct 158 ms 47672 KB Output is correct
54 Correct 144 ms 58136 KB Output is correct
55 Correct 241 ms 56588 KB Output is correct
56 Correct 250 ms 62532 KB Output is correct
57 Correct 203 ms 65592 KB Output is correct
58 Correct 231 ms 62848 KB Output is correct
59 Correct 229 ms 62916 KB Output is correct
60 Correct 3 ms 4940 KB Output is correct
61 Correct 3 ms 4940 KB Output is correct
62 Correct 3 ms 4940 KB Output is correct
63 Correct 3 ms 4940 KB Output is correct
64 Incorrect 370 ms 67156 KB Output isn't correct
65 Halted 0 ms 0 KB -