oj.uz

Submission #202963

# Submission time Handle Problem Language Result Execution time Memory
202963 2020-02-18T19:41:45 Z MKopchev Temperature (POI11_tem) C++14
74 / 100
 763 ms 36600 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=1e6+42;

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

int tree[4*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

# Verdict Execution time Memory 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

# Verdict Execution time Memory 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

# Verdict Execution time Memory Grader output
1 Correct 9 ms 632 KB Output is correct
2 Correct 9 ms 632 KB Output is correct
3 Correct 10 ms 632 KB Output is correct

Subtask #4
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 316 ms 11236 KB Output is correct
2 Correct 210 ms 12152 KB Output is correct
3 Correct 304 ms 17016 KB Output is correct

Subtask #5
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 569 ms 24708 KB Output is correct
2 Correct 617 ms 26172 KB Output is correct
3 Correct 487 ms 26232 KB Output is correct

Subtask #6
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 652 ms 30200 KB Output is correct
2 Correct 609 ms 26848 KB Output is correct
3 Correct 568 ms 31484 KB Output is correct

Subtask #7
0 / 8.0

# Verdict Execution time Memory Grader output
1 Runtime error 763 ms 33816 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)
2 Halted 0 ms 0 KB -

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 702 ms 31596 KB Output is correct
2 Correct 478 ms 25464 KB Output is correct
3 Correct 623 ms 26744 KB Output is correct

Subtask #9
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 542 ms 20212 KB Output is correct
2 Correct 438 ms 20472 KB Output is correct
3 Correct 311 ms 20604 KB Output is correct

Subtask #10
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 555 ms 19704 KB Output is correct
2 Correct 418 ms 20856 KB Output is correct

Subtask #11
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 29432 KB Output is correct
2 Runtime error 671 ms 36600 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)

Subtask #12
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 597 ms 28536 KB Output is correct
2 Runtime error 595 ms 33508 KB Memory limit exceeded (if you are sure your verdict is not MLE, please contact us)