# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163190 | TadijaSebez | 방벽 (JOI15_walls) | C++11 | 258 ms | 17412 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mt make_tuple
#define pb push_back
const int N=200050;
const int H=2*N;
int Us[N],usz,l[N],r[N],id[N];
int sgn(int x){ return x?x/abs(x):0;}
int nxt[N],pre[N],fir;
bool was[N];
ll sol[N];
int main()
{
int n,m;
scanf("%i %i",&n,&m);
for(int i=1;i<=n;i++) scanf("%i %i",&l[i],&r[i]),id[i]=i;
sort(id+1,id+1+n,[&](int i, int j){ return r[i]-l[i]<r[j]-l[j];});
while(m--)
{
int x;scanf("%i",&x);
if(!usz) Us[++usz]=x;
else
{
if(Us[usz]==x) continue;
if(usz==1 || sgn(Us[usz]-Us[usz-1])*sgn(x-Us[usz])==-1) Us[++usz]=x;
else Us[usz]=x;
}
}
fir=1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |