oj.uz

답안 #942557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
942557 2024-03-10T21:10:47 Z qin Bulldozer (JOI17_bulldozer) C++17
80 / 100
 663 ms 125948 KB 
//~ #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define fi first
#define se second
#define pn printf("\n")
#define ssize(x) int(x.size())
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define bitcount(x) __builtin_popcount(x)
#define clz(x) __builtin_clz(x)
#define ctz(x) __builtin_ctz(x)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int, ll> pil;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef long double db;
#define int ll
#define vv vector
/*void read(int &a){
		char c = getchar_unlocked(); a = 0;
		while(c<'0' || '9'<c) c = getchar_unlocked();
		while('0'<=c&&c<='9') a = (a<<3)+(a<<1)+c-'0', c = getchar_unlocked();
}*/
int inf = 2e09; ll infll = 2e18; int mod = (1<<23)*119+1;
struct pt{
		int x, y, val;
		pt(){ x = 0, y = 0, val = 0; }
		pt(int X, int Y, int V){ x = X, y = Y, val = V; }
		bool operator <(const pt &a) const{ return x != a.x ? x < a.x : y < a.y; }
};
db eps = 1e-20;
bool equal(db a, db b){ return abs(b-a) < eps; }
struct line{
		db a, b;
		int x1, x2, i, j;
		line(){ a = 0, b = 0, x1 = 0, x2 = 0, i = 0, j = 0; }
		line(int X1, int Y1, int X2, int Y2, int I, int J){
				if(X1 == X2) a = 1e10, b = 0, x1 = min(Y1, Y2), x2 = max(Y1, Y2);
				else a = (Y2-Y1)/db(X2-X1), b = db(Y1)-a*X1, x1 = min(X1, X2), x2 = max(X1, X2);
				i = I, j = J;
		}
		bool operator <(const line &t) const{
				if(!equal(a, t.a)) return a < t.a;
				else if(!equal(b, t.b)) return b < t.b;
				else if(!equal(x1, t.x1)) return x1 < t.x1;
				return x2 < t.x2;
		}
};
int base = 1;
struct seg{
		struct Node{
				ll mx, mn, mx_delta;
				Node(){ mx = -infll, mn = infll, mx_delta = -infll; }
				Node(ll val){ mx = val, mn = val, mx_delta = 0; }
		};
		vv<Node> t;
		void init(int n, vv<ll> &pf){
				while(base < n) base <<= 1;
				t.resize(base<<1);
				for(int i = 1; i <= n; ++i) t[i+base-1] = Node(pf[i]);
				for(int i = base-1; i; --i){
						t[i].mx = max(t[i<<1].mx, t[i<<1|1].mx);
						t[i].mn = min(t[i<<1].mn, t[i<<1|1].mn);
						t[i].mx_delta = max(t[i<<1|1].mx-t[i<<1].mn, max(t[i<<1].mx_delta, t[i<<1|1].mx_delta));
				}
		}
		void update(int i, ll val){ //tutaj ewentualnie mozna dozylowywac
				for(i += base-1, t[i] = Node(val), i >>= 1; i; i >>= 1){
						t[i].mx = max(t[i<<1].mx, t[i<<1|1].mx);
						t[i].mn = min(t[i<<1].mn, t[i<<1|1].mn);
						t[i].mx_delta = max(t[i<<1|1].mx-t[i<<1].mn, max(t[i<<1].mx_delta, t[i<<1|1].mx_delta));
				}
		}
		ll query(){ return max(t[1].mx, t[1].mx_delta); }
};
void answer(){
		int n; scanf("%lld", &n);
		vv<pt> p(n+1);
		for(int i = 1; i <= n; ++i) scanf("%lld%lld%lld", &p[i].x, &p[i].y, &p[i].val);
		sort(1+all(p));
		vv<line> t((n*(n-1))/2);
		for(int i = 1, l = 0; i <= n-1; ++i)
				for(int j = i+1; j <= n; ++j, ++l) t[l] = line(p[i].x, p[i].y, p[j].x, p[j].y, i, j);
		sort(all(t));
		//~ for(line &u : t) cout << setprecision(20) << fixed << u.a << " " << u.b <<"\n";//printf("%f %f %d %d\n", u.a, u.b, u.x1, u.x2);
		
		vv<ll> pf(n+1);
		vv<int> pos(n+1);
		for(int i = 1; i <= n; ++i) pf[i] = pf[i-1]+p[i].val, pos[i] = i;
		seg seg; seg.init(n, pf);
		
		
		ll result = max(0ll, seg.query());
		//~ printf("%lld\n", result);
		//~ for(int i = 1; i <= n; ++i) printf("%lld ", pf[i]);
		//~ pn;
		for(int i = 0; i < ssize(t); ++i){
				int a = t[i].i, b = t[i].j; //assert(abs(pos[a]-pos[b]) == 1);
				if(pos[b] < pos[a]) swap(a, b);
				pf[pos[a]] += p[b].val-p[a].val;
				swap(pos[a], pos[b]);
				seg.update(pos[a], pf[pos[a]]), seg.update(pos[b], pf[pos[b]]);
				
				while(i+1 < ssize(t) && equal(t[i+1].a, t[i].a)){
						++i;
						a = t[i].i, b = t[i].j; //assert(abs(pos[a]-pos[b]) == 1);
						if(pos[b] < pos[a]) swap(a, b);
						pf[pos[a]] += p[b].val-p[a].val;
						swap(pos[a], pos[b]);
						seg.update(pos[a], pf[pos[a]]), seg.update(pos[b], pf[pos[b]]);
				}
				result = max(result, seg.query());
				//~ printf("%lld\n", seg.query());
				//~ for(int j = 1; j <= n; ++j) printf("%lld ", pf[j]);
				//~ pn;
		}
		printf("%lld\n", result);
}
signed main(){
		int T = 1;
		//~ scanf("%d", &T);
		//~ ios_base::sync_with_stdio(0); cin.tie(0); //cin >> T;
		for(++T; --T; ) answer();
		return 0;
}

Compilation message

bulldozer.cpp: In function 'void answer()':
bulldozer.cpp:79:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |   int n; scanf("%lld", &n);
      |          ~~~~~^~~~~~~~~~~~
bulldozer.cpp:81:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |   for(int i = 1; i <= n; ++i) scanf("%lld%lld%lld", &p[i].x, &p[i].y, &p[i].val);
      |                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 744 KB Output is correct
9 Correct 1 ms 756 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 772 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 772 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 601 ms 125776 KB Output is correct
34 Correct 640 ms 125884 KB Output is correct
35 Correct 593 ms 125780 KB Output is correct
36 Correct 583 ms 125780 KB Output is correct
37 Correct 587 ms 125776 KB Output is correct
38 Correct 617 ms 125780 KB Output is correct
39 Correct 581 ms 125780 KB Output is correct
40 Correct 586 ms 125904 KB Output is correct
41 Correct 585 ms 125780 KB Output is correct
42 Correct 592 ms 125772 KB Output is correct
43 Correct 595 ms 125652 KB Output is correct
44 Correct 572 ms 125776 KB Output is correct
45 Correct 576 ms 125776 KB Output is correct
46 Correct 587 ms 125780 KB Output is correct
47 Correct 624 ms 125776 KB Output is correct
48 Correct 583 ms 125784 KB Output is correct
49 Correct 590 ms 125772 KB Output is correct
50 Correct 588 ms 125780 KB Output is correct
51 Correct 603 ms 125912 KB Output is correct
52 Correct 583 ms 125780 KB Output is correct
53 Correct 579 ms 125648 KB Output is correct
54 Correct 594 ms 125788 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 756 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 1 ms 772 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 600 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 600 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 1 ms 604 KB Output is correct
32 Correct 1 ms 604 KB Output is correct
33 Correct 601 ms 125776 KB Output is correct
34 Correct 640 ms 125884 KB Output is correct
35 Correct 593 ms 125780 KB Output is correct
36 Correct 583 ms 125780 KB Output is correct
37 Correct 587 ms 125776 KB Output is correct
38 Correct 617 ms 125780 KB Output is correct
39 Correct 581 ms 125780 KB Output is correct
40 Correct 586 ms 125904 KB Output is correct
41 Correct 585 ms 125780 KB Output is correct
42 Correct 592 ms 125772 KB Output is correct
43 Correct 595 ms 125652 KB Output is correct
44 Correct 572 ms 125776 KB Output is correct
45 Correct 576 ms 125776 KB Output is correct
46 Correct 587 ms 125780 KB Output is correct
47 Correct 624 ms 125776 KB Output is correct
48 Correct 583 ms 125784 KB Output is correct
49 Correct 590 ms 125772 KB Output is correct
50 Correct 588 ms 125780 KB Output is correct
51 Correct 603 ms 125912 KB Output is correct
52 Correct 583 ms 125780 KB Output is correct
53 Correct 579 ms 125648 KB Output is correct
54 Correct 594 ms 125788 KB Output is correct
55 Correct 598 ms 125780 KB Output is correct
56 Correct 578 ms 125784 KB Output is correct
57 Correct 601 ms 125776 KB Output is correct
58 Correct 594 ms 125660 KB Output is correct
59 Correct 605 ms 125788 KB Output is correct
60 Correct 586 ms 125652 KB Output is correct
61 Correct 596 ms 125652 KB Output is correct
62 Correct 594 ms 125904 KB Output is correct
63 Correct 600 ms 125780 KB Output is correct
64 Correct 584 ms 125784 KB Output is correct
65 Correct 580 ms 125652 KB Output is correct
66 Correct 592 ms 125948 KB Output is correct
67 Correct 595 ms 125776 KB Output is correct
68 Correct 589 ms 125652 KB Output is correct
69 Correct 579 ms 125908 KB Output is correct
70 Correct 601 ms 125600 KB Output is correct
71 Correct 578 ms 125652 KB Output is correct
72 Correct 594 ms 125648 KB Output is correct
73 Correct 618 ms 125656 KB Output is correct
74 Correct 592 ms 125776 KB Output is correct

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 744 KB Output is correct
9 Correct 1 ms 756 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 1 ms 604 KB Output is correct
19 Correct 1 ms 604 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 1 ms 604 KB Output is correct
22 Correct 1 ms 756 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 1 ms 772 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 1 ms 604 KB Output is correct
41 Correct 1 ms 600 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 1 ms 600 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 1 ms 604 KB Output is correct
46 Correct 1 ms 604 KB Output is correct
47 Correct 1 ms 604 KB Output is correct
48 Correct 601 ms 125776 KB Output is correct
49 Correct 640 ms 125884 KB Output is correct
50 Correct 593 ms 125780 KB Output is correct
51 Correct 583 ms 125780 KB Output is correct
52 Correct 587 ms 125776 KB Output is correct
53 Correct 617 ms 125780 KB Output is correct
54 Correct 581 ms 125780 KB Output is correct
55 Correct 586 ms 125904 KB Output is correct
56 Correct 585 ms 125780 KB Output is correct
57 Correct 592 ms 125772 KB Output is correct
58 Correct 595 ms 125652 KB Output is correct
59 Correct 572 ms 125776 KB Output is correct
60 Correct 576 ms 125776 KB Output is correct
61 Correct 587 ms 125780 KB Output is correct
62 Correct 624 ms 125776 KB Output is correct
63 Correct 583 ms 125784 KB Output is correct
64 Correct 590 ms 125772 KB Output is correct
65 Correct 588 ms 125780 KB Output is correct
66 Correct 603 ms 125912 KB Output is correct
67 Correct 583 ms 125780 KB Output is correct
68 Correct 579 ms 125648 KB Output is correct
69 Correct 594 ms 125788 KB Output is correct
70 Correct 598 ms 125780 KB Output is correct
71 Correct 578 ms 125784 KB Output is correct
72 Correct 601 ms 125776 KB Output is correct
73 Correct 594 ms 125660 KB Output is correct
74 Correct 605 ms 125788 KB Output is correct
75 Correct 586 ms 125652 KB Output is correct
76 Correct 596 ms 125652 KB Output is correct
77 Correct 594 ms 125904 KB Output is correct
78 Correct 600 ms 125780 KB Output is correct
79 Correct 584 ms 125784 KB Output is correct
80 Correct 580 ms 125652 KB Output is correct
81 Correct 592 ms 125948 KB Output is correct
82 Correct 595 ms 125776 KB Output is correct
83 Correct 589 ms 125652 KB Output is correct
84 Correct 579 ms 125908 KB Output is correct
85 Correct 601 ms 125600 KB Output is correct
86 Correct 578 ms 125652 KB Output is correct
87 Correct 594 ms 125648 KB Output is correct
88 Correct 618 ms 125656 KB Output is correct
89 Correct 592 ms 125776 KB Output is correct
90 Correct 613 ms 125784 KB Output is correct
91 Correct 587 ms 125784 KB Output is correct
92 Correct 618 ms 125908 KB Output is correct
93 Correct 582 ms 125652 KB Output is correct
94 Correct 589 ms 125648 KB Output is correct
95 Correct 596 ms 125780 KB Output is correct
96 Correct 582 ms 125904 KB Output is correct
97 Correct 584 ms 125672 KB Output is correct
98 Correct 577 ms 125776 KB Output is correct
99 Correct 585 ms 125800 KB Output is correct
100 Correct 639 ms 125664 KB Output is correct
101 Correct 646 ms 125648 KB Output is correct
102 Correct 661 ms 125652 KB Output is correct
103 Correct 663 ms 125780 KB Output is correct
104 Correct 657 ms 125780 KB Output is correct
105 Correct 605 ms 125656 KB Output is correct
106 Correct 602 ms 125776 KB Output is correct
107 Correct 598 ms 125652 KB Output is correct
108 Correct 605 ms 125784 KB Output is correct
109 Correct 609 ms 125780 KB Output is correct
110 Incorrect 653 ms 125780 KB Output isn't correct
111 Halted 0 ms 0 KB -