oj.uz

답안 #120162

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
120162 2019-06-23T16:01:58 Z KLPP Two Antennas (JOI19_antennas) C++14
35 / 100
 3000 ms 43664 KB 
#include<bits/stdc++.h>

using namespace std;
typedef long long int lld;
typedef pair<lld,lld> pii;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
int n;
lld h[1000000];
lld a[1000000];
lld b[1000000];
lld answer[3000][3000];
lld Max(lld a, lld b){
  if(a==-1)return b;
  if(b==-1)return a;
  return max(a,b);
}
lld Min(lld a, lld b){
  if(a==-1)return b;
  if(b==-1)return a;
  return min(a,b);
}
class ST{
  lld tree1[1000000];
  lld tree2[1000000];
public:
  void build(int a, int b, int node){
    tree1[node]=-1;
    tree2[node]=-1;
    if(a==b)return;
    int mid=(a+b)/2;
    build(a,mid,2*node);
    build(mid+1,b,2*node+1);
  }
  void update(int a, int b, int node, int pos, lld val){
    if(pos<a || b<pos)return;
    if(a==b){
      tree1[node]=val;
      tree2[node]=val;
      return;
    }
    int mid=(a+b)/2;
    update(a,mid,2*node,pos,val);
    update(mid+1,b,2*node+1,pos,val);
    tree1[node]=Max(tree1[2*node],tree1[2*node+1]);
    tree2[node]=Min(tree2[2*node],tree2[2*node+1]);
  }
  lld QMax(int a, int b, int node, int x, int y){
    if(b<x || y<a)return -1;
    if(x<=a && b<=y)return tree1[node];
    int mid=(a+b)/2;
    return Max(QMax(a,mid,2*node,x,y),QMax(mid+1,b,2*node+1,x,y));
  }
  lld QMin(int a, int b, int node, int x, int y){
    if(b<x || y<a)return -1;
    if(x<=a && b<=y)return tree2[node];
    int mid=(a+b)/2;
    return Min(QMin(a,mid,2*node,x,y),QMin(mid+1,b,2*node+1,x,y));
  }
};
int main(){
  scanf("%d",&n);
  rep(i,0,n){
    scanf("%lld %lld %lld",&h[i],&a[i],&b[i]);
  }
  if(n<=2000){
    ST *S=new ST();
    rep(i,1,n+1){
      S->build(1,n,1);
      vector<pii> v;
      rep(j,i,n+1){
	v.push_back(pii(j+a[j-1],j));
	v.push_back(pii(j+b[j-1]+1,-j));
      }
      sort(v.begin(),v.end());
      int ptr=0;
      lld ans=-1;
      //cout<<i<<endl;
      rep(j,i,n+1){
	while(ptr<v.size() && v[ptr].first<=j){
	  //cout<<"U"<<v[ptr].second<<" "<<v[ptr].first<<endl;
	  if(v[ptr].second>0){
	    S->update(1,n,1,v[ptr].second,h[v[ptr].second-1]);
	  }else{
	    S->update(1,n,1,-v[ptr].second,-1);
	  }
	  ptr++;
	}
	lld m,M;
      
      
	m=S->QMin(1,n,1,j-b[j-1],j-a[j-1]);
	M=S->QMax(1,n,1,j-b[j-1],j-a[j-1]);
	//cout<<m<<" "<<M<<endl;
	if(m!=-1)ans=max(ans,h[j-1]-m);
	if(M!=-1)ans=max(ans,M-h[j-1]);
	answer[i][j]=ans;
	//cout<<"A"<<answer[i][j]<<" "<<i<<" "<<j<<endl;
      }
    }
    int q;
    scanf("%d",&q);
    while(q--){
      //cout<<"A"<<endl;
      int l,r;
      scanf("%d %d",&l,&r);
      printf("%lld\n",answer[l][r]);
    }
    return 0;
  }
  ST *S=new ST();
  int q;
  scanf("%d",&q);
  while(q--){
    int l,r;
    scanf("%d %d",&l,&r);
    S->build(1,n,1);
    vector<pii> v;
    rep(i,l,r+1){
      v.push_back(pii(i+a[i-1],i));
      v.push_back(pii(i+b[i-1]+1,-i));
    }
    sort(v.begin(),v.end());
    int ptr=0;
    lld ans=-1;
    rep(i,l,r+1){
      while(ptr<v.size() && v[ptr].first<=i){
	if(v[ptr].second>0){
	  S->update(1,n,1,v[ptr].second,h[v[ptr].second-1]);
	}else{
	  S->update(1,n,1,-v[ptr].second,-1);
	}
	ptr++;
      }
      lld m,M;
      
      
      m=S->QMin(1,n,1,i-b[i-1],i-a[i-1]);
      M=S->QMax(1,n,1,i-b[i-1],i-a[i-1]);
      //cout<<m<<" "<<M<<endl;
      if(m!=-1)ans=max(ans,h[i-1]-m);
      if(M!=-1)ans=max(ans,M-h[i-1]);
    }
    printf("%lld\n",ans);
  }
  return 0;
}

Compilation message

antennas.cpp: In function 'int main()':
antennas.cpp:80:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(ptr<v.size() && v[ptr].first<=j){
        ~~~^~~~~~~~~
antennas.cpp:127:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
       while(ptr<v.size() && v[ptr].first<=i){
             ~~~^~~~~~~~~
antennas.cpp:62:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&n);
   ~~~~~^~~~~~~~~
antennas.cpp:64:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%lld %lld %lld",&h[i],&a[i],&b[i]);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:102:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&q);
     ~~~~~^~~~~~~~~
antennas.cpp:106:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d %d",&l,&r);
       ~~~~~^~~~~~~~~~~~~~~
antennas.cpp:113:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&q);
   ~~~~~^~~~~~~~~
antennas.cpp:116:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d",&l,&r);
     ~~~~~^~~~~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16512 KB Output is correct
2 Correct 32 ms 17592 KB Output is correct
3 Correct 24 ms 17144 KB Output is correct
4 Correct 31 ms 17656 KB Output is correct
5 Correct 25 ms 17316 KB Output is correct
6 Correct 32 ms 17792 KB Output is correct
7 Correct 29 ms 17656 KB Output is correct
8 Correct 33 ms 17656 KB Output is correct
9 Correct 17 ms 16460 KB Output is correct
10 Correct 32 ms 17664 KB Output is correct
11 Correct 14 ms 16304 KB Output is correct
12 Correct 30 ms 17656 KB Output is correct
13 Correct 23 ms 17408 KB Output is correct
14 Correct 22 ms 17280 KB Output is correct
15 Correct 20 ms 17280 KB Output is correct
16 Correct 22 ms 17280 KB Output is correct
17 Correct 23 ms 17268 KB Output is correct
18 Correct 22 ms 17280 KB Output is correct
19 Correct 24 ms 17356 KB Output is correct
20 Correct 22 ms 17280 KB Output is correct
21 Correct 23 ms 17280 KB Output is correct
22 Correct 20 ms 17408 KB Output is correct
23 Correct 26 ms 17272 KB Output is correct
24 Correct 22 ms 17400 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16512 KB Output is correct
2 Correct 32 ms 17592 KB Output is correct
3 Correct 24 ms 17144 KB Output is correct
4 Correct 31 ms 17656 KB Output is correct
5 Correct 25 ms 17316 KB Output is correct
6 Correct 32 ms 17792 KB Output is correct
7 Correct 29 ms 17656 KB Output is correct
8 Correct 33 ms 17656 KB Output is correct
9 Correct 17 ms 16460 KB Output is correct
10 Correct 32 ms 17664 KB Output is correct
11 Correct 14 ms 16304 KB Output is correct
12 Correct 30 ms 17656 KB Output is correct
13 Correct 23 ms 17408 KB Output is correct
14 Correct 22 ms 17280 KB Output is correct
15 Correct 20 ms 17280 KB Output is correct
16 Correct 22 ms 17280 KB Output is correct
17 Correct 23 ms 17268 KB Output is correct
18 Correct 22 ms 17280 KB Output is correct
19 Correct 24 ms 17356 KB Output is correct
20 Correct 22 ms 17280 KB Output is correct
21 Correct 23 ms 17280 KB Output is correct
22 Correct 20 ms 17408 KB Output is correct
23 Correct 26 ms 17272 KB Output is correct
24 Correct 22 ms 17400 KB Output is correct
25 Correct 275 ms 24420 KB Output is correct
26 Correct 1221 ms 40312 KB Output is correct
27 Correct 928 ms 36872 KB Output is correct
28 Correct 1329 ms 43664 KB Output is correct
29 Correct 324 ms 26032 KB Output is correct
30 Correct 1297 ms 42460 KB Output is correct
31 Correct 89 ms 20260 KB Output is correct
32 Correct 1335 ms 43516 KB Output is correct
33 Correct 521 ms 30192 KB Output is correct
34 Correct 1283 ms 41708 KB Output is correct
35 Correct 762 ms 34168 KB Output is correct
36 Correct 1322 ms 43520 KB Output is correct
37 Correct 617 ms 40640 KB Output is correct
38 Correct 676 ms 41628 KB Output is correct
39 Correct 660 ms 39596 KB Output is correct
40 Correct 756 ms 41540 KB Output is correct
41 Correct 755 ms 41116 KB Output is correct
42 Correct 805 ms 41804 KB Output is correct
43 Correct 688 ms 39976 KB Output is correct
44 Correct 763 ms 41756 KB Output is correct
45 Correct 536 ms 39688 KB Output is correct
46 Correct 700 ms 41592 KB Output is correct
47 Correct 641 ms 39648 KB Output is correct
48 Correct 720 ms 41796 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 292 ms 28516 KB Output is correct
2 Correct 329 ms 29076 KB Output is correct
3 Correct 224 ms 27748 KB Output is correct
4 Correct 319 ms 29028 KB Output is correct
5 Correct 146 ms 22376 KB Output is correct
6 Correct 336 ms 29028 KB Output is correct
7 Correct 291 ms 28388 KB Output is correct
8 Correct 330 ms 29028 KB Output is correct
9 Correct 53 ms 17912 KB Output is correct
10 Correct 322 ms 29248 KB Output is correct
11 Correct 191 ms 23272 KB Output is correct
12 Correct 327 ms 29188 KB Output is correct
13 Correct 183 ms 29032 KB Output is correct
14 Correct 181 ms 29028 KB Output is correct
15 Correct 175 ms 29156 KB Output is correct
16 Correct 175 ms 29156 KB Output is correct
17 Correct 194 ms 29028 KB Output is correct
18 Correct 176 ms 29028 KB Output is correct
19 Correct 174 ms 29028 KB Output is correct
20 Correct 174 ms 29140 KB Output is correct
21 Correct 179 ms 29028 KB Output is correct
22 Correct 171 ms 29156 KB Output is correct
23 Correct 173 ms 29028 KB Output is correct
24 Correct 155 ms 29028 KB Output is correct

Subtask #4
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16512 KB Output is correct
2 Correct 32 ms 17592 KB Output is correct
3 Correct 24 ms 17144 KB Output is correct
4 Correct 31 ms 17656 KB Output is correct
5 Correct 25 ms 17316 KB Output is correct
6 Correct 32 ms 17792 KB Output is correct
7 Correct 29 ms 17656 KB Output is correct
8 Correct 33 ms 17656 KB Output is correct
9 Correct 17 ms 16460 KB Output is correct
10 Correct 32 ms 17664 KB Output is correct
11 Correct 14 ms 16304 KB Output is correct
12 Correct 30 ms 17656 KB Output is correct
13 Correct 23 ms 17408 KB Output is correct
14 Correct 22 ms 17280 KB Output is correct
15 Correct 20 ms 17280 KB Output is correct
16 Correct 22 ms 17280 KB Output is correct
17 Correct 23 ms 17268 KB Output is correct
18 Correct 22 ms 17280 KB Output is correct
19 Correct 24 ms 17356 KB Output is correct
20 Correct 22 ms 17280 KB Output is correct
21 Correct 23 ms 17280 KB Output is correct
22 Correct 20 ms 17408 KB Output is correct
23 Correct 26 ms 17272 KB Output is correct
24 Correct 22 ms 17400 KB Output is correct
25 Correct 275 ms 24420 KB Output is correct
26 Correct 1221 ms 40312 KB Output is correct
27 Correct 928 ms 36872 KB Output is correct
28 Correct 1329 ms 43664 KB Output is correct
29 Correct 324 ms 26032 KB Output is correct
30 Correct 1297 ms 42460 KB Output is correct
31 Correct 89 ms 20260 KB Output is correct
32 Correct 1335 ms 43516 KB Output is correct
33 Correct 521 ms 30192 KB Output is correct
34 Correct 1283 ms 41708 KB Output is correct
35 Correct 762 ms 34168 KB Output is correct
36 Correct 1322 ms 43520 KB Output is correct
37 Correct 617 ms 40640 KB Output is correct
38 Correct 676 ms 41628 KB Output is correct
39 Correct 660 ms 39596 KB Output is correct
40 Correct 756 ms 41540 KB Output is correct
41 Correct 755 ms 41116 KB Output is correct
42 Correct 805 ms 41804 KB Output is correct
43 Correct 688 ms 39976 KB Output is correct
44 Correct 763 ms 41756 KB Output is correct
45 Correct 536 ms 39688 KB Output is correct
46 Correct 700 ms 41592 KB Output is correct
47 Correct 641 ms 39648 KB Output is correct
48 Correct 720 ms 41796 KB Output is correct
49 Correct 292 ms 28516 KB Output is correct
50 Correct 329 ms 29076 KB Output is correct
51 Correct 224 ms 27748 KB Output is correct
52 Correct 319 ms 29028 KB Output is correct
53 Correct 146 ms 22376 KB Output is correct
54 Correct 336 ms 29028 KB Output is correct
55 Correct 291 ms 28388 KB Output is correct
56 Correct 330 ms 29028 KB Output is correct
57 Correct 53 ms 17912 KB Output is correct
58 Correct 322 ms 29248 KB Output is correct
59 Correct 191 ms 23272 KB Output is correct
60 Correct 327 ms 29188 KB Output is correct
61 Correct 183 ms 29032 KB Output is correct
62 Correct 181 ms 29028 KB Output is correct
63 Correct 175 ms 29156 KB Output is correct
64 Correct 175 ms 29156 KB Output is correct
65 Correct 194 ms 29028 KB Output is correct
66 Correct 176 ms 29028 KB Output is correct
67 Correct 174 ms 29028 KB Output is correct
68 Correct 174 ms 29140 KB Output is correct
69 Correct 179 ms 29028 KB Output is correct
70 Correct 171 ms 29156 KB Output is correct
71 Correct 173 ms 29028 KB Output is correct
72 Correct 155 ms 29028 KB Output is correct
73 Execution timed out 3026 ms 37688 KB Time limit exceeded
74 Halted 0 ms 0 KB -