oj.uz

답안 #154369

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154369 2019-09-21T10:01:36 Z username Bitaro, who Leaps through Time (JOI19_timeleap) C++14
100 / 100
 998 ms 49016 KB 
#include<bits/stdc++.h>
#define ll long long
using namespace std;
#define REP(i,j,k) for(int i=(j);i<(k);++i)
#define mid (l+r>>1)
#define lch (idx*2+1)
#define rch (idx*2+2)
#define endl '\n'
#define IOS cin.tie(0),cout.tie(0),ios_base::sync_with_stdio(false)

struct nd{int l,r;ll c;};
const int maxn=1<<19,inf=2e9;
int n,q;
nd dat[2][maxn<<1];

nd merge(nd a,nd b,int t){
	if(t)swap(a,b);
	if(a.c<0){
		if(b.c<0){
			if(a.r<b.l)return nd{a.r,b.l,0};
			else if(b.r<a.l)return nd{a.l,b.r,a.l-b.r};
			else return nd{max(a.l,b.l),min(a.r,b.r),-1};
		}else{
			int s=max(a.l,min(a.r,b.l));
			return nd{s,b.r,b.c+max(0,s-b.l)};
		}
	}else{
		if(b.c<0){
			int t=max(b.l,min(b.r,a.r));
			return nd{a.l,t,a.c+max(0,a.r-t)};
		}else{
			return nd{a.l,b.r,a.c+b.c+max(0,a.r-b.l)};
		}
	}
}

void mnt(int idx){
	dat[0][idx]=merge(dat[0][lch],dat[0][rch],0);
	dat[1][idx]=merge(dat[1][lch],dat[1][rch],1);
}

void ch(int l,int r,int idx,int p,int s,int e){
	if(l+1==r){
		dat[0][idx]=nd{s-l,e-l-1,-1};
		dat[1][idx]=nd{s+l+1,e+l,-1};
	}else{
		if(p<mid)ch(l,mid,lch,p,s,e);
		else ch(mid,r,rch,p,s,e);
		mnt(idx);
	}
}

nd qr(int l,int r,int idx,int a,int b,int t){
	if(b<=l||r<=a)return nd{-inf,inf,-1};
	else if(a<=l&&r<=b)return dat[t][idx];
	else return merge(qr(l,mid,lch,a,b,t),qr(mid,r,rch,a,b,t),t);
}

main(){
	IOS;
	cin>>n>>q;
	REP(i,1,n){
		int l,r;cin>>l>>r;
		ch(1,n,0,i,l,r);
	}
	REP(_,0,q){
		int t,p,s,e,a,b,c,d;cin>>t;
		if(t==1){
			cin>>p>>s>>e;
			ch(1,n,0,p,s,e);
		}else{
			cin>>a>>b>>c>>d,t=a>c;
			if(t)cout<<merge(nd{d+c,d+c,0},merge(qr(1,n,0,c,a,t),nd{b+a,b+a,0},t),t).c<<endl;
			else cout<<merge(nd{b-a,b-a,0},merge(qr(1,n,0,a,c,t),nd{d-c,d-c,0},t),t).c<<endl;
		}
	}
}

Compilation message

timeleap.cpp: In function 'void ch(int, int, int, int, int, int)':
timeleap.cpp:5:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:47:8: note: in expansion of macro 'mid'
   if(p<mid)ch(l,mid,lch,p,s,e);
        ^~~
timeleap.cpp:5:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:47:17: note: in expansion of macro 'mid'
   if(p<mid)ch(l,mid,lch,p,s,e);
                 ^~~
timeleap.cpp:5:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:48:11: note: in expansion of macro 'mid'
   else ch(mid,r,rch,p,s,e);
           ^~~
timeleap.cpp: In function 'nd qr(int, int, int, int, int, int)':
timeleap.cpp:5:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:56:25: note: in expansion of macro 'mid'
  else return merge(qr(l,mid,lch,a,b,t),qr(mid,r,rch,a,b,t),t);
                         ^~~
timeleap.cpp:5:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:56:43: note: in expansion of macro 'mid'
  else return merge(qr(l,mid,lch,a,b,t),qr(mid,r,rch,a,b,t),t);
                                           ^~~
timeleap.cpp: At global scope:
timeleap.cpp:59:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(){
      ^

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 4 ms 508 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 4 ms 504 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 4 ms 476 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 4 ms 500 KB Output is correct
22 Correct 4 ms 504 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 4 ms 504 KB Output is correct
25 Correct 4 ms 504 KB Output is correct
26 Correct 4 ms 508 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 516 KB Output is correct
31 Correct 4 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 4 ms 636 KB Output is correct
34 Correct 3 ms 508 KB Output is correct
35 Correct 4 ms 504 KB Output is correct
36 Correct 4 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 4 ms 504 KB Output is correct
39 Correct 4 ms 504 KB Output is correct
40 Correct 3 ms 508 KB Output is correct
41 Correct 2 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 767 ms 47956 KB Output is correct
2 Correct 764 ms 32120 KB Output is correct
3 Correct 735 ms 31996 KB Output is correct
4 Correct 725 ms 32128 KB Output is correct
5 Correct 775 ms 48708 KB Output is correct
6 Correct 771 ms 48648 KB Output is correct
7 Correct 805 ms 48656 KB Output is correct
8 Correct 998 ms 48504 KB Output is correct
9 Correct 764 ms 32248 KB Output is correct
10 Correct 817 ms 48376 KB Output is correct
11 Correct 821 ms 48464 KB Output is correct
12 Correct 802 ms 48792 KB Output is correct
13 Correct 811 ms 49016 KB Output is correct
14 Correct 2 ms 376 KB Output is correct

Subtask #3
66.0 / 66.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 504 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 380 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 4 ms 508 KB Output is correct
12 Correct 4 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 4 ms 504 KB Output is correct
15 Correct 4 ms 504 KB Output is correct
16 Correct 4 ms 476 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 4 ms 504 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 4 ms 500 KB Output is correct
22 Correct 4 ms 504 KB Output is correct
23 Correct 4 ms 504 KB Output is correct
24 Correct 4 ms 504 KB Output is correct
25 Correct 4 ms 504 KB Output is correct
26 Correct 4 ms 508 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 4 ms 604 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 516 KB Output is correct
31 Correct 4 ms 504 KB Output is correct
32 Correct 3 ms 504 KB Output is correct
33 Correct 4 ms 636 KB Output is correct
34 Correct 3 ms 508 KB Output is correct
35 Correct 4 ms 504 KB Output is correct
36 Correct 4 ms 504 KB Output is correct
37 Correct 3 ms 504 KB Output is correct
38 Correct 4 ms 504 KB Output is correct
39 Correct 4 ms 504 KB Output is correct
40 Correct 3 ms 508 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 767 ms 47956 KB Output is correct
43 Correct 764 ms 32120 KB Output is correct
44 Correct 735 ms 31996 KB Output is correct
45 Correct 725 ms 32128 KB Output is correct
46 Correct 775 ms 48708 KB Output is correct
47 Correct 771 ms 48648 KB Output is correct
48 Correct 805 ms 48656 KB Output is correct
49 Correct 998 ms 48504 KB Output is correct
50 Correct 764 ms 32248 KB Output is correct
51 Correct 817 ms 48376 KB Output is correct
52 Correct 821 ms 48464 KB Output is correct
53 Correct 802 ms 48792 KB Output is correct
54 Correct 811 ms 49016 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 721 ms 47044 KB Output is correct
57 Correct 682 ms 30608 KB Output is correct
58 Correct 726 ms 46952 KB Output is correct
59 Correct 742 ms 46996 KB Output is correct
60 Correct 693 ms 30696 KB Output is correct
61 Correct 739 ms 47096 KB Output is correct
62 Correct 762 ms 47008 KB Output is correct
63 Correct 742 ms 46636 KB Output is correct
64 Correct 749 ms 46712 KB Output is correct
65 Correct 757 ms 46776 KB Output is correct
66 Correct 737 ms 47080 KB Output is correct
67 Correct 758 ms 47124 KB Output is correct
68 Correct 704 ms 47196 KB Output is correct
69 Correct 745 ms 47164 KB Output is correct
70 Correct 727 ms 30920 KB Output is correct
71 Correct 695 ms 30644 KB Output is correct
72 Correct 703 ms 41952 KB Output is correct
73 Correct 732 ms 47184 KB Output is correct
74 Correct 778 ms 47172 KB Output is correct
75 Correct 775 ms 47088 KB Output is correct
76 Correct 750 ms 47196 KB Output is correct
77 Correct 2 ms 376 KB Output is correct