이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define ls c<<1
#define rs c<<1|1
const int N=250050;
const int M=4*N;
int root=1,mx[M];
int d[N];
int cmb(int i, int j){ return d[i]>d[j]?i:j;}
void Set(int c, int ss, int se, int qi)
{
if(ss==se){ mx[c]=qi;return;}
int mid=ss+se>>1;
if(qi<=mid) Set(ls,ss,mid,qi);
else Set(rs,mid+1,se,qi);
mx[c]=cmb(mx[ls],mx[rs]);
}
int Get(int c, int ss, int se, int qs, int qe)
{
if(qs>qe || qs>se || ss>qe) return 0;
if(qs<=ss && qe>=se) return mx[c];
int mid=ss+se>>1;
return cmb(Get(ls,ss,mid,qs,qe),Get(rs,mid+1,se,qs,qe));
}
set<pair<int,int>> ord;
int main()
{
int n,q,a;
scanf("%i %i",&n,&a);
for(int i=1;i<=n;i++)
{
scanf("%i",&d[i]);
Set(root,1,n,i);
ord.insert({d[i],i});
}
scanf("%i",&q);
while(q--)
{
char t;
scanf("\n%c",&t);
if(t=='F')
{
int b;
scanf("%i",&b);
if(b==a) printf("0\n");
else if(b>a)
{
int val=d[Get(root,1,n,a+1,b)];
int top=a-1,bot=1,mid,ans=a;
while(top>=bot)
{
mid=top+bot>>1;
if(d[Get(root,1,n,mid,a-1)]<val) top=mid-1,ans=mid;
else bot=mid+1;
}
printf("%i\n",b-ans);
}
else
{
int val=d[Get(root,1,n,b,a-1)];
int top=n,bot=a+1,mid,ans=a;
while(top>=bot)
{
mid=top+bot>>1;
if(d[Get(root,1,n,a+1,mid)]<val) bot=mid+1,ans=mid;
else top=mid-1;
}
printf("%i\n",ans-b);
}
}
else
{
int b,e;
scanf("%i %i",&b,&e);
stack<pair<int,int>> bck;
ord.erase({d[b],b});
while(--e)
{
pair<int,int> top=*ord.rbegin();
ord.erase(--ord.end());
top.first++;
d[top.second]++;
bck.push(top);
}
int my=1;
if(ord.size()) my=ord.rbegin()->first+1;
d[b]=my;
Set(root,1,n,b);
ord.insert({d[b],b});
while(bck.size())
{
pair<int,int> top=bck.top();
bck.pop();
ord.insert(top);
}
}
}
return 0;
}
컴파일 시 표준 에러 (stderr) 메시지
cake.cpp: In function 'void Set(int, int, int, int)':
cake.cpp:13:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int mid=ss+se>>1;
~~^~~
cake.cpp: In function 'int Get(int, int, int, int, int)':
cake.cpp:22:12: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
int mid=ss+se>>1;
~~^~~
cake.cpp: In function 'int main()':
cake.cpp:52:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
mid=top+bot>>1;
~~~^~~~
cake.cpp:64:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
mid=top+bot>>1;
~~~^~~~
cake.cpp:29:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i",&n,&a);
~~~~~^~~~~~~~~~~~~~~
cake.cpp:32:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&d[i]);
~~~~~^~~~~~~~~~~~
cake.cpp:36:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&q);
~~~~~^~~~~~~~~
cake.cpp:40:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("\n%c",&t);
~~~~~^~~~~~~~~~~
cake.cpp:44:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i",&b);
~~~~~^~~~~~~~~
cake.cpp:74:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%i %i",&b,&e);
~~~~~^~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |