oj.uz

답안 #154366

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154366 2019-09-21T09:55:40 Z username Bitaro, who Leaps through Time (JOI19_timeleap) C++14
100 / 100
 1094 ms 59784 KB 
#include<bits/stdc++.h>
#define int 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,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(0ll,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(0ll,a.r-t)};
		}else{
			return nd{a.l,b.r,a.c+b.c+max(0ll,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(long long int, long long int, long long int, long long int, long long int, long long 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(long long int, long long int, long long int, long long int, long long int, long long 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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 528 KB Output is correct
4 Correct 2 ms 352 KB Output is correct
5 Correct 2 ms 368 KB Output is correct
6 Correct 3 ms 380 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 508 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 4 ms 632 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 504 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 4 ms 528 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 4 ms 504 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 504 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 4 ms 504 KB Output is correct
32 Correct 4 ms 504 KB Output is correct
33 Correct 4 ms 504 KB Output is correct
34 Correct 4 ms 504 KB Output is correct
35 Correct 4 ms 504 KB Output is correct
36 Correct 4 ms 504 KB Output is correct
37 Correct 4 ms 504 KB Output is correct
38 Correct 4 ms 504 KB Output is correct
39 Correct 4 ms 632 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 2 ms 376 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 962 ms 59464 KB Output is correct
2 Correct 937 ms 35164 KB Output is correct
3 Correct 906 ms 35064 KB Output is correct
4 Correct 925 ms 34860 KB Output is correct
5 Correct 1020 ms 59304 KB Output is correct
6 Correct 969 ms 59524 KB Output is correct
7 Correct 986 ms 59640 KB Output is correct
8 Correct 971 ms 59784 KB Output is correct
9 Correct 915 ms 35064 KB Output is correct
10 Correct 964 ms 59784 KB Output is correct
11 Correct 945 ms 59640 KB Output is correct
12 Correct 1002 ms 59664 KB Output is correct
13 Correct 1084 ms 59732 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 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 528 KB Output is correct
4 Correct 2 ms 352 KB Output is correct
5 Correct 2 ms 368 KB Output is correct
6 Correct 3 ms 380 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 508 KB Output is correct
11 Correct 4 ms 504 KB Output is correct
12 Correct 4 ms 632 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 504 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 5 ms 504 KB Output is correct
19 Correct 4 ms 528 KB Output is correct
20 Correct 4 ms 504 KB Output is correct
21 Correct 4 ms 504 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 504 KB Output is correct
27 Correct 4 ms 504 KB Output is correct
28 Correct 4 ms 504 KB Output is correct
29 Correct 4 ms 504 KB Output is correct
30 Correct 4 ms 504 KB Output is correct
31 Correct 4 ms 504 KB Output is correct
32 Correct 4 ms 504 KB Output is correct
33 Correct 4 ms 504 KB Output is correct
34 Correct 4 ms 504 KB Output is correct
35 Correct 4 ms 504 KB Output is correct
36 Correct 4 ms 504 KB Output is correct
37 Correct 4 ms 504 KB Output is correct
38 Correct 4 ms 504 KB Output is correct
39 Correct 4 ms 632 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 962 ms 59464 KB Output is correct
43 Correct 937 ms 35164 KB Output is correct
44 Correct 906 ms 35064 KB Output is correct
45 Correct 925 ms 34860 KB Output is correct
46 Correct 1020 ms 59304 KB Output is correct
47 Correct 969 ms 59524 KB Output is correct
48 Correct 986 ms 59640 KB Output is correct
49 Correct 971 ms 59784 KB Output is correct
50 Correct 915 ms 35064 KB Output is correct
51 Correct 964 ms 59784 KB Output is correct
52 Correct 945 ms 59640 KB Output is correct
53 Correct 1002 ms 59664 KB Output is correct
54 Correct 1084 ms 59732 KB Output is correct
55 Correct 2 ms 376 KB Output is correct
56 Correct 938 ms 57108 KB Output is correct
57 Correct 874 ms 32852 KB Output is correct
58 Correct 937 ms 57464 KB Output is correct
59 Correct 936 ms 57404 KB Output is correct
60 Correct 876 ms 32888 KB Output is correct
61 Correct 943 ms 57324 KB Output is correct
62 Correct 949 ms 56992 KB Output is correct
63 Correct 928 ms 57060 KB Output is correct
64 Correct 952 ms 57160 KB Output is correct
65 Correct 902 ms 57016 KB Output is correct
66 Correct 931 ms 57064 KB Output is correct
67 Correct 1094 ms 57384 KB Output is correct
68 Correct 983 ms 49400 KB Output is correct
69 Correct 1014 ms 57332 KB Output is correct
70 Correct 895 ms 32672 KB Output is correct
71 Correct 932 ms 32572 KB Output is correct
72 Correct 937 ms 43360 KB Output is correct
73 Correct 938 ms 57176 KB Output is correct
74 Correct 943 ms 57288 KB Output is correct
75 Correct 959 ms 57336 KB Output is correct
76 Correct 963 ms 57240 KB Output is correct
77 Correct 2 ms 376 KB Output is correct