oj.uz

답안 #942550

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
942550 2024-03-10T20:52:29 Z qin Bulldozer (JOI17_bulldozer) C++17
80 / 100
 758 ms 94668 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 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-17;
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("%d", &n);
		vv<pt> p(n+1);
		for(int i = 1; i <= n; ++i) scanf("%d%d%d", &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) 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:78:15: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   78 |   int n; scanf("%d", &n);
      |          ~~~~~^~~~~~~~~~
bulldozer.cpp:80:36: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |   for(int i = 1; i <= n; ++i) scanf("%d%d%d", &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 600 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 680 KB Output is correct
6 Correct 1 ms 688 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 0 ms 348 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 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 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 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 676 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 2 ms 688 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct

Subtask #3
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 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 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 676 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 2 ms 688 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 756 ms 94548 KB Output is correct
34 Correct 717 ms 94588 KB Output is correct
35 Correct 712 ms 94544 KB Output is correct
36 Correct 697 ms 94300 KB Output is correct
37 Correct 721 ms 94292 KB Output is correct
38 Correct 705 ms 94540 KB Output is correct
39 Correct 748 ms 94548 KB Output is correct
40 Correct 704 ms 94492 KB Output is correct
41 Correct 736 ms 94540 KB Output is correct
42 Correct 706 ms 94328 KB Output is correct
43 Correct 728 ms 94452 KB Output is correct
44 Correct 695 ms 94452 KB Output is correct
45 Correct 699 ms 94292 KB Output is correct
46 Correct 729 ms 94328 KB Output is correct
47 Correct 704 ms 94548 KB Output is correct
48 Correct 690 ms 94548 KB Output is correct
49 Correct 702 ms 94452 KB Output is correct
50 Correct 712 ms 94288 KB Output is correct
51 Correct 705 ms 94448 KB Output is correct
52 Correct 716 ms 94332 KB Output is correct
53 Correct 701 ms 94548 KB Output is correct
54 Correct 706 ms 94452 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 600 KB Output is correct
2 Correct 2 ms 600 KB Output is correct
3 Correct 2 ms 604 KB Output is correct
4 Correct 2 ms 600 KB Output is correct
5 Correct 2 ms 604 KB Output is correct
6 Correct 2 ms 604 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 1 ms 348 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 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 600 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 2 ms 600 KB Output is correct
23 Correct 1 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 600 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 2 ms 676 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 1 ms 604 KB Output is correct
30 Correct 2 ms 688 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 756 ms 94548 KB Output is correct
34 Correct 717 ms 94588 KB Output is correct
35 Correct 712 ms 94544 KB Output is correct
36 Correct 697 ms 94300 KB Output is correct
37 Correct 721 ms 94292 KB Output is correct
38 Correct 705 ms 94540 KB Output is correct
39 Correct 748 ms 94548 KB Output is correct
40 Correct 704 ms 94492 KB Output is correct
41 Correct 736 ms 94540 KB Output is correct
42 Correct 706 ms 94328 KB Output is correct
43 Correct 728 ms 94452 KB Output is correct
44 Correct 695 ms 94452 KB Output is correct
45 Correct 699 ms 94292 KB Output is correct
46 Correct 729 ms 94328 KB Output is correct
47 Correct 704 ms 94548 KB Output is correct
48 Correct 690 ms 94548 KB Output is correct
49 Correct 702 ms 94452 KB Output is correct
50 Correct 712 ms 94288 KB Output is correct
51 Correct 705 ms 94448 KB Output is correct
52 Correct 716 ms 94332 KB Output is correct
53 Correct 701 ms 94548 KB Output is correct
54 Correct 706 ms 94452 KB Output is correct
55 Correct 695 ms 94332 KB Output is correct
56 Correct 709 ms 94328 KB Output is correct
57 Correct 728 ms 94328 KB Output is correct
58 Correct 713 ms 94448 KB Output is correct
59 Correct 714 ms 94328 KB Output is correct
60 Correct 717 ms 94544 KB Output is correct
61 Correct 702 ms 94548 KB Output is correct
62 Correct 738 ms 94448 KB Output is correct
63 Correct 744 ms 94336 KB Output is correct
64 Correct 714 ms 94452 KB Output is correct
65 Correct 698 ms 94332 KB Output is correct
66 Correct 702 ms 94668 KB Output is correct
67 Correct 714 ms 94392 KB Output is correct
68 Correct 730 ms 94332 KB Output is correct
69 Correct 706 ms 94536 KB Output is correct
70 Correct 733 ms 94448 KB Output is correct
71 Correct 702 ms 94336 KB Output is correct
72 Correct 730 ms 94568 KB Output is correct
73 Correct 720 ms 94328 KB Output is correct
74 Correct 737 ms 94296 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 600 KB Output is correct
4 Correct 1 ms 604 KB Output is correct
5 Correct 1 ms 680 KB Output is correct
6 Correct 1 ms 688 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 0 ms 348 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 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 2 ms 600 KB Output is correct
17 Correct 2 ms 600 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 600 KB Output is correct
20 Correct 2 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 860 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 1 ms 348 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 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 600 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 2 ms 600 KB Output is correct
37 Correct 2 ms 600 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 600 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 2 ms 676 KB Output is correct
43 Correct 1 ms 604 KB Output is correct
44 Correct 1 ms 604 KB Output is correct
45 Correct 2 ms 688 KB Output is correct
46 Correct 2 ms 604 KB Output is correct
47 Correct 2 ms 604 KB Output is correct
48 Correct 756 ms 94548 KB Output is correct
49 Correct 717 ms 94588 KB Output is correct
50 Correct 712 ms 94544 KB Output is correct
51 Correct 697 ms 94300 KB Output is correct
52 Correct 721 ms 94292 KB Output is correct
53 Correct 705 ms 94540 KB Output is correct
54 Correct 748 ms 94548 KB Output is correct
55 Correct 704 ms 94492 KB Output is correct
56 Correct 736 ms 94540 KB Output is correct
57 Correct 706 ms 94328 KB Output is correct
58 Correct 728 ms 94452 KB Output is correct
59 Correct 695 ms 94452 KB Output is correct
60 Correct 699 ms 94292 KB Output is correct
61 Correct 729 ms 94328 KB Output is correct
62 Correct 704 ms 94548 KB Output is correct
63 Correct 690 ms 94548 KB Output is correct
64 Correct 702 ms 94452 KB Output is correct
65 Correct 712 ms 94288 KB Output is correct
66 Correct 705 ms 94448 KB Output is correct
67 Correct 716 ms 94332 KB Output is correct
68 Correct 701 ms 94548 KB Output is correct
69 Correct 706 ms 94452 KB Output is correct
70 Correct 695 ms 94332 KB Output is correct
71 Correct 709 ms 94328 KB Output is correct
72 Correct 728 ms 94328 KB Output is correct
73 Correct 713 ms 94448 KB Output is correct
74 Correct 714 ms 94328 KB Output is correct
75 Correct 717 ms 94544 KB Output is correct
76 Correct 702 ms 94548 KB Output is correct
77 Correct 738 ms 94448 KB Output is correct
78 Correct 744 ms 94336 KB Output is correct
79 Correct 714 ms 94452 KB Output is correct
80 Correct 698 ms 94332 KB Output is correct
81 Correct 702 ms 94668 KB Output is correct
82 Correct 714 ms 94392 KB Output is correct
83 Correct 730 ms 94332 KB Output is correct
84 Correct 706 ms 94536 KB Output is correct
85 Correct 733 ms 94448 KB Output is correct
86 Correct 702 ms 94336 KB Output is correct
87 Correct 730 ms 94568 KB Output is correct
88 Correct 720 ms 94328 KB Output is correct
89 Correct 737 ms 94296 KB Output is correct
90 Correct 725 ms 94548 KB Output is correct
91 Correct 711 ms 94452 KB Output is correct
92 Correct 720 ms 94452 KB Output is correct
93 Correct 709 ms 94352 KB Output is correct
94 Correct 719 ms 94296 KB Output is correct
95 Correct 710 ms 94332 KB Output is correct
96 Correct 694 ms 94572 KB Output is correct
97 Correct 710 ms 94444 KB Output is correct
98 Correct 714 ms 94548 KB Output is correct
99 Correct 716 ms 94328 KB Output is correct
100 Correct 733 ms 94288 KB Output is correct
101 Correct 736 ms 94332 KB Output is correct
102 Correct 740 ms 94448 KB Output is correct
103 Correct 758 ms 94336 KB Output is correct
104 Correct 739 ms 94448 KB Output is correct
105 Correct 719 ms 94452 KB Output is correct
106 Correct 701 ms 94548 KB Output is correct
107 Correct 696 ms 94300 KB Output is correct
108 Correct 712 ms 94456 KB Output is correct
109 Correct 704 ms 94324 KB Output is correct
110 Correct 716 ms 94544 KB Output is correct
111 Correct 731 ms 94664 KB Output is correct
112 Correct 746 ms 94584 KB Output is correct
113 Correct 734 ms 94628 KB Output is correct
114 Correct 732 ms 94492 KB Output is correct
115 Correct 723 ms 94488 KB Output is correct
116 Correct 733 ms 94492 KB Output is correct
117 Correct 732 ms 94372 KB Output is correct
118 Correct 740 ms 94448 KB Output is correct
119 Correct 725 ms 94548 KB Output is correct
120 Incorrect 1 ms 600 KB Output isn't correct
121 Halted 0 ms 0 KB -