oj.uz

답안 #137276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
137276 2019-07-27T11:27:04 Z dndhk Two Antennas (JOI19_antennas) C++14
100 / 100
 688 ms 34160 KB 
#include <bits/stdc++.h>

#define pb push_back
#define all(v) ((v).begin(), (v).end())
#define sortv(v) sort(all(v))
#define sz(v) ((int)(v).size())
#define uniqv(v) (v).erase(unique(all(v)), (v).end())
#define umax(a, b) (a)=max((a), (b))
#define umin(a, b) (a)=min((a), (b))
#define FOR(i,a,b) for(int i = (a); i <= (b); i++)
#define rep(i,n) FOR(i,1,n)
#define rep0(i,n) FOR(i,0,(int)(n)-1)
#define FI first
#define SE second
#define INF 2000000000
#define INFLL 1000000000000000000LL


using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int MAX_N = 200000;

int N, Q;
struct S{
	int h, a, b;
};
vector<S> v;
vector<pair<pii, int> > query;
vector<pii> vt;
bool chk[MAX_N+1];
int ans[MAX_N+1];

struct SEG{
	struct NODE{
		int l, r;
		int mx, mn, lmx, lmn, data;
		bool lazy;
	};
	vector<NODE> seg;
	int SZ;
	void add(){
		seg.pb({-1, -1, 0, INF, 0, INF, -1, 0});
	}
	void Init(int x){
		SZ = x;
		add();
		init(0, 0, SZ-1);
	}
	void init(int idx, int s, int e){
		if(s==e)	return;
		seg[idx].l = seg.size(); add();
		seg[idx].r = seg.size(); add();
		init(seg[idx].l, s, (s+e)/2); init(seg[idx].r, (s+e)/2+1, e);
	}
	void Calc(int idx){
		if(seg[idx].l==-1){
			seg[idx].lazy = false;
			seg[idx].lmn = INF; seg[idx].lmx = 0;
			return;
		}
		seg[seg[idx].l].lazy = true;
		seg[seg[idx].l].lmx = max(seg[seg[idx].l].lmx, seg[idx].lmx); seg[seg[idx].l].lmn = min(seg[seg[idx].l].lmn, seg[idx].lmn);
		seg[seg[idx].l].data = max(seg[seg[idx].l].data, seg[seg[idx].l].lmx - seg[seg[idx].l].mn);
		seg[seg[idx].l].data = max(seg[seg[idx].l].data, seg[seg[idx].l].mx - seg[seg[idx].l].lmn);
		seg[seg[idx].r].lazy = true;
		seg[seg[idx].r].lmx = max(seg[seg[idx].r].lmx, seg[idx].lmx); seg[seg[idx].r].lmn = min(seg[seg[idx].r].lmn, seg[idx].lmn);
		seg[seg[idx].r].data = max(seg[seg[idx].r].data, seg[seg[idx].r].lmx - seg[seg[idx].r].mn);
		seg[seg[idx].r].data = max(seg[seg[idx].r].data, seg[seg[idx].r].mx - seg[seg[idx].r].lmn);
		seg[idx].lazy = false;
		seg[idx].lmn = INF; seg[idx].lmx = 0;
	}
	void Update(int x, int y){
		update(0, 0, SZ-1, x, y);
	}
	void update(int idx, int s, int e, int x, int y){
		if(seg[idx].lazy)	Calc(idx);
		if(s==e){
			if(y==-1){
				seg[idx].mx = 0; seg[idx].mn = INF;
				return;
			}else{
				seg[idx].mx = seg[idx].mn = y;
				return;
			}
		}
		if(x<=(s+e)/2){
			update(seg[idx].l, s, (s+e)/2, x, y);
		}else{
			update(seg[idx].r, (s+e)/2+1, e, x, y);
		}
		seg[idx].mx = max(seg[seg[idx].l].mx, seg[seg[idx].r].mx);
		seg[idx].mn = min(seg[seg[idx].l].mn, seg[seg[idx].r].mn);
	}
	void Lazy(int x, int y, int z){
		lazy(0, 0, SZ-1, x, y, z);
	}
	void lazy(int idx, int s, int e, int x, int y, int z){
		if(seg[idx].lazy)	Calc(idx);
		if(x<=s && e<=y){
			seg[idx].lazy = true;
			seg[idx].lmn = z; seg[idx].lmx = z;
			seg[idx].data = max(seg[idx].data, seg[idx].mx - seg[idx].lmn);
			seg[idx].data = max(seg[idx].data, seg[idx].lmx - seg[idx].mn);
			//cout<<"*"<<s<<" "<<e<<" "<<seg[idx].data<<endl;
			return;
		}
		if(x>e || y<s)	return;
		lazy(seg[idx].l, s, (s+e)/2, x, y, z);
		lazy(seg[idx].r, (s+e)/2+1, e, x, y, z);
		seg[idx].data = max(seg[seg[idx].l].data, seg[seg[idx].r].data);
	}
	int Max(int x, int y){
		return calc_max(0, 0, SZ-1, x, y);
	}
	int calc_max(int idx, int s, int e, int x, int y){
		if(seg[idx].lazy)	Calc(idx);
		if(x<=s && e<=y)	{
			//cout<<"&"<<s<<" "<<e<<" "<<seg[idx].data<<endl;
			return seg[idx].data;
		}
		if(x>e || s>y)	return -1;
		return max(calc_max(seg[idx].l, s, (s+e)/2, x, y), calc_max(seg[idx].r, (s+e)/2+1, e, x, y));
	}
};

SEG Seg;


int main(){
	scanf("%d", &N);
	for(int i=0; i<N; i++){
		int a, b, c;
		scanf("%d%d%d", &a, &b, &c);
		v.pb({a, b, c});
		vt.pb({i+b, i}); vt.pb({i+c+1, i});
	}
	sort(vt.begin(), vt.end());
	scanf("%d", &Q);
	for(int i=1; i<=Q; i++){
		int a, b;
		scanf("%d%d", &a, &b);
		query.pb({{b-1, a-1}, i});
	}
	Seg.Init(N);
	sort(query.begin(), query.end());
	int idx1 = 0, idx2 = 0;
	for(int i=0; i<N; i++){
		while(idx1<vt.size() && vt[idx1].first==i){
			if(chk[vt[idx1].second]){
				chk[vt[idx1].second] = false;
				//cout<<"OUT "<<vt[idx1].second<<endl;
				Seg.Update(vt[idx1].second, -1);

			}else{
				chk[vt[idx1].second] = true;
				//cout<<"IN "<<vt[idx1].second<<" "<<v[vt[idx1].second].h<<endl;
				Seg.Update(vt[idx1].second, v[vt[idx1].second].h);
			}
			idx1++;
		}
		S now = v[i];
		Seg.Lazy(i-now.b, i - now.a, now.h);
		while(idx2<query.size() && query[idx2].first.first==i){
			ans[query[idx2].second] = Seg.Max(query[idx2].first.second, query[idx2].first.first);
			//cout<<"ANSWER "<<query[idx2].second<<" "<<ans[query[idx2].second]<<endl;
			//cout<<query[idx2].first.second<<" "<<query[idx2].first.first<<endl;
			idx2++;
		}
		//cout<<"END"<<endl;
	}
	for(int i=1; i<=Q; i++){
		printf("%d\n", ans[i]);
	}
	return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:151:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(idx1<vt.size() && vt[idx1].first==i){
         ~~~~^~~~~~~~~~
antennas.cpp:166:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(idx2<query.size() && query[idx2].first.first==i){
         ~~~~^~~~~~~~~~~~~
antennas.cpp:133:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
antennas.cpp:136:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d", &a, &b, &c);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:141:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &Q);
  ~~~~~^~~~~~~~~~
antennas.cpp:144:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 94 ms 5212 KB Output is correct
26 Correct 15 ms 1220 KB Output is correct
27 Correct 135 ms 7408 KB Output is correct
28 Correct 142 ms 7400 KB Output is correct
29 Correct 95 ms 5348 KB Output is correct
30 Correct 95 ms 5104 KB Output is correct
31 Correct 116 ms 6588 KB Output is correct
32 Correct 140 ms 7400 KB Output is correct
33 Correct 127 ms 6964 KB Output is correct
34 Correct 71 ms 3868 KB Output is correct
35 Correct 132 ms 7280 KB Output is correct
36 Correct 140 ms 7404 KB Output is correct
37 Correct 76 ms 3928 KB Output is correct
38 Correct 134 ms 6380 KB Output is correct
39 Correct 21 ms 1536 KB Output is correct
40 Correct 134 ms 6432 KB Output is correct
41 Correct 95 ms 4984 KB Output is correct
42 Correct 130 ms 6384 KB Output is correct
43 Correct 45 ms 2628 KB Output is correct
44 Correct 129 ms 6384 KB Output is correct
45 Correct 27 ms 1664 KB Output is correct
46 Correct 133 ms 6444 KB Output is correct
47 Correct 37 ms 2168 KB Output is correct
48 Correct 129 ms 6516 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 351 ms 25832 KB Output is correct
2 Correct 455 ms 26840 KB Output is correct
3 Correct 256 ms 23908 KB Output is correct
4 Correct 391 ms 27084 KB Output is correct
5 Correct 169 ms 13312 KB Output is correct
6 Correct 384 ms 26856 KB Output is correct
7 Correct 324 ms 25576 KB Output is correct
8 Correct 377 ms 26856 KB Output is correct
9 Correct 49 ms 4372 KB Output is correct
10 Correct 391 ms 26940 KB Output is correct
11 Correct 219 ms 14840 KB Output is correct
12 Correct 409 ms 26856 KB Output is correct
13 Correct 257 ms 26856 KB Output is correct
14 Correct 227 ms 26728 KB Output is correct
15 Correct 225 ms 26944 KB Output is correct
16 Correct 201 ms 26856 KB Output is correct
17 Correct 237 ms 26856 KB Output is correct
18 Correct 218 ms 26904 KB Output is correct
19 Correct 227 ms 26888 KB Output is correct
20 Correct 221 ms 26936 KB Output is correct
21 Correct 221 ms 26896 KB Output is correct
22 Correct 227 ms 26828 KB Output is correct
23 Correct 230 ms 26820 KB Output is correct
24 Correct 198 ms 26776 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 94 ms 5212 KB Output is correct
26 Correct 15 ms 1220 KB Output is correct
27 Correct 135 ms 7408 KB Output is correct
28 Correct 142 ms 7400 KB Output is correct
29 Correct 95 ms 5348 KB Output is correct
30 Correct 95 ms 5104 KB Output is correct
31 Correct 116 ms 6588 KB Output is correct
32 Correct 140 ms 7400 KB Output is correct
33 Correct 127 ms 6964 KB Output is correct
34 Correct 71 ms 3868 KB Output is correct
35 Correct 132 ms 7280 KB Output is correct
36 Correct 140 ms 7404 KB Output is correct
37 Correct 76 ms 3928 KB Output is correct
38 Correct 134 ms 6380 KB Output is correct
39 Correct 21 ms 1536 KB Output is correct
40 Correct 134 ms 6432 KB Output is correct
41 Correct 95 ms 4984 KB Output is correct
42 Correct 130 ms 6384 KB Output is correct
43 Correct 45 ms 2628 KB Output is correct
44 Correct 129 ms 6384 KB Output is correct
45 Correct 27 ms 1664 KB Output is correct
46 Correct 133 ms 6444 KB Output is correct
47 Correct 37 ms 2168 KB Output is correct
48 Correct 129 ms 6516 KB Output is correct
49 Correct 351 ms 25832 KB Output is correct
50 Correct 455 ms 26840 KB Output is correct
51 Correct 256 ms 23908 KB Output is correct
52 Correct 391 ms 27084 KB Output is correct
53 Correct 169 ms 13312 KB Output is correct
54 Correct 384 ms 26856 KB Output is correct
55 Correct 324 ms 25576 KB Output is correct
56 Correct 377 ms 26856 KB Output is correct
57 Correct 49 ms 4372 KB Output is correct
58 Correct 391 ms 26940 KB Output is correct
59 Correct 219 ms 14840 KB Output is correct
60 Correct 409 ms 26856 KB Output is correct
61 Correct 257 ms 26856 KB Output is correct
62 Correct 227 ms 26728 KB Output is correct
63 Correct 225 ms 26944 KB Output is correct
64 Correct 201 ms 26856 KB Output is correct
65 Correct 237 ms 26856 KB Output is correct
66 Correct 218 ms 26904 KB Output is correct
67 Correct 227 ms 26888 KB Output is correct
68 Correct 221 ms 26936 KB Output is correct
69 Correct 221 ms 26896 KB Output is correct
70 Correct 227 ms 26828 KB Output is correct
71 Correct 230 ms 26820 KB Output is correct
72 Correct 198 ms 26776 KB Output is correct
73 Correct 622 ms 29672 KB Output is correct
74 Correct 415 ms 31352 KB Output is correct
75 Correct 536 ms 28944 KB Output is correct
76 Correct 688 ms 31884 KB Output is correct
77 Correct 342 ms 18548 KB Output is correct
78 Correct 607 ms 30312 KB Output is correct
79 Correct 620 ms 30592 KB Output is correct
80 Correct 671 ms 31872 KB Output is correct
81 Correct 246 ms 12940 KB Output is correct
82 Correct 510 ms 33904 KB Output is correct
83 Correct 495 ms 24172 KB Output is correct
84 Correct 678 ms 31848 KB Output is correct
85 Correct 397 ms 34160 KB Output is correct
86 Correct 465 ms 31720 KB Output is correct
87 Correct 263 ms 31652 KB Output is correct
88 Correct 437 ms 31708 KB Output is correct
89 Correct 429 ms 30464 KB Output is correct
90 Correct 467 ms 31724 KB Output is correct
91 Correct 324 ms 32752 KB Output is correct
92 Correct 458 ms 31724 KB Output is correct
93 Correct 265 ms 31856 KB Output is correct
94 Correct 456 ms 31844 KB Output is correct
95 Correct 294 ms 32496 KB Output is correct
96 Correct 433 ms 31832 KB Output is correct