oj.uz

답안 #154365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
154365 2019-09-21T09:53:07 Z username Bitaro, who Leaps through Time (JOI19_timeleap) C++14
100 / 100
 909 ms 57560 KB 
#pragma GCC optimize("O3")
#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;
			int 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:6:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:48:8: note: in expansion of macro 'mid'
   if(p<mid)ch(l,mid,lch,p,s,e);
        ^~~
timeleap.cpp:6:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:48:17: note: in expansion of macro 'mid'
   if(p<mid)ch(l,mid,lch,p,s,e);
                 ^~~
timeleap.cpp:6:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:49: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:6:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:57: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:6:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
 #define mid (l+r>>1)
              ~^~
timeleap.cpp:57: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:60: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 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 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 376 KB Output is correct
11 Correct 4 ms 504 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 476 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 4 ms 504 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 532 KB Output is correct
21 Correct 4 ms 504 KB Output is correct
22 Correct 4 ms 632 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 508 KB Output is correct
26 Correct 4 ms 568 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 508 KB Output is correct
32 Correct 4 ms 420 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 508 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 814 ms 56496 KB Output is correct
2 Correct 751 ms 32504 KB Output is correct
3 Correct 761 ms 32460 KB Output is correct
4 Correct 761 ms 32616 KB Output is correct
5 Correct 808 ms 57420 KB Output is correct
6 Correct 824 ms 57320 KB Output is correct
7 Correct 814 ms 57468 KB Output is correct
8 Correct 836 ms 57328 KB Output is correct
9 Correct 789 ms 32768 KB Output is correct
10 Correct 858 ms 57452 KB Output is correct
11 Correct 805 ms 57416 KB Output is correct
12 Correct 847 ms 57464 KB Output is correct
13 Correct 831 ms 57560 KB Output is correct
14 Correct 2 ms 380 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 376 KB Output is correct
4 Correct 2 ms 248 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 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 376 KB Output is correct
11 Correct 4 ms 504 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 476 KB Output is correct
15 Correct 4 ms 632 KB Output is correct
16 Correct 4 ms 504 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 532 KB Output is correct
21 Correct 4 ms 504 KB Output is correct
22 Correct 4 ms 632 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 508 KB Output is correct
26 Correct 4 ms 568 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 508 KB Output is correct
32 Correct 4 ms 420 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 508 KB Output is correct
40 Correct 4 ms 504 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 814 ms 56496 KB Output is correct
43 Correct 751 ms 32504 KB Output is correct
44 Correct 761 ms 32460 KB Output is correct
45 Correct 761 ms 32616 KB Output is correct
46 Correct 808 ms 57420 KB Output is correct
47 Correct 824 ms 57320 KB Output is correct
48 Correct 814 ms 57468 KB Output is correct
49 Correct 836 ms 57328 KB Output is correct
50 Correct 789 ms 32768 KB Output is correct
51 Correct 858 ms 57452 KB Output is correct
52 Correct 805 ms 57416 KB Output is correct
53 Correct 847 ms 57464 KB Output is correct
54 Correct 831 ms 57560 KB Output is correct
55 Correct 2 ms 380 KB Output is correct
56 Correct 789 ms 55560 KB Output is correct
57 Correct 755 ms 30980 KB Output is correct
58 Correct 795 ms 55524 KB Output is correct
59 Correct 801 ms 55484 KB Output is correct
60 Correct 860 ms 30908 KB Output is correct
61 Correct 805 ms 55376 KB Output is correct
62 Correct 829 ms 55304 KB Output is correct
63 Correct 808 ms 55408 KB Output is correct
64 Correct 854 ms 55332 KB Output is correct
65 Correct 860 ms 55340 KB Output is correct
66 Correct 909 ms 55500 KB Output is correct
67 Correct 822 ms 55544 KB Output is correct
68 Correct 840 ms 47196 KB Output is correct
69 Correct 817 ms 55512 KB Output is correct
70 Correct 740 ms 30980 KB Output is correct
71 Correct 740 ms 30804 KB Output is correct
72 Correct 745 ms 42056 KB Output is correct
73 Correct 814 ms 55288 KB Output is correct
74 Correct 839 ms 55372 KB Output is correct
75 Correct 848 ms 55488 KB Output is correct
76 Correct 828 ms 55376 KB Output is correct
77 Correct 2 ms 376 KB Output is correct