oj.uz

답안 #202968

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
202968 2020-02-18T19:45:54 Z MKopchev Temperature (POI11_tem) C++14
100 / 100
 756 ms 16392 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=(1<<20)+42;

int n;
pair<int,int> inp[nmax];

int tree[2*nmax];
void build(int node,int l,int r)
{
    if(l==r)
    {
        tree[node]=inp[l].first;
        return;
    }
    int av=(l+r)/2;
    build(node*2,l,av);
    build(node*2+1,av+1,r);
    tree[node]=max(tree[node*2],tree[node*2+1]);
}
int query(int node,int l,int r,int lq,int rq)
{
    if(l==lq&&r==rq)return tree[node];
    int av=(l+r)/2,ret=-1e9;
    if(lq<=av)ret=max(ret,query(node*2,l,av,lq,min(av,rq)));
    if(av<rq)ret=max(ret,query(node*2+1,av+1,r,max(av+1,lq),rq));
    return ret;
}
int output;
int main()
{
    scanf("%i",&n);

    int mini,maxi;
    for(int i=1;i<=n;i++)
        scanf("%i%i",&inp[i].first,&inp[i].second);

    build(1,1,n);

    int l=1,r=1;
    while(r<=n)
    {
        if(query(1,1,n,l,r)<=inp[r].second)r++;
        else l++;

        output=max(output,r-l);
    }

    printf("%i\n",output);
    return 0;
}

Compilation message

tem.cpp: In function 'int main()':
tem.cpp:34:9: warning: unused variable 'mini' [-Wunused-variable]
     int mini,maxi;
         ^~~~
tem.cpp:34:14: warning: unused variable 'maxi' [-Wunused-variable]
     int mini,maxi;
              ^~~~
tem.cpp:32:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%i",&n);
     ~~~~~^~~~~~~~~
tem.cpp:36:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%i%i",&inp[i].first,&inp[i].second);
         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct

Subtask #3
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 632 KB Output is correct
2 Correct 9 ms 684 KB Output is correct
3 Correct 11 ms 632 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 361 ms 8312 KB Output is correct
2 Correct 218 ms 8696 KB Output is correct
3 Correct 321 ms 13304 KB Output is correct

Subtask #5
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 573 ms 14320 KB Output is correct
2 Correct 629 ms 14840 KB Output is correct
3 Correct 473 ms 15224 KB Output is correct

Subtask #6
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 669 ms 15200 KB Output is correct
2 Correct 638 ms 15484 KB Output is correct
3 Correct 573 ms 14884 KB Output is correct

Subtask #7
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 756 ms 15572 KB Output is correct
2 Correct 652 ms 15480 KB Output is correct
3 Correct 704 ms 16392 KB Output is correct

Subtask #8
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 725 ms 14968 KB Output is correct
2 Correct 468 ms 15736 KB Output is correct
3 Correct 611 ms 15480 KB Output is correct

Subtask #9
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 555 ms 15480 KB Output is correct
2 Correct 424 ms 15736 KB Output is correct
3 Correct 298 ms 15524 KB Output is correct

Subtask #10
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 560 ms 15120 KB Output is correct
2 Correct 419 ms 15864 KB Output is correct

Subtask #11
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 596 ms 14748 KB Output is correct
2 Correct 656 ms 16120 KB Output is correct

Subtask #12
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 597 ms 14516 KB Output is correct
2 Correct 571 ms 15352 KB Output is correct