oj.uz

Submission #894886

# Submission time Handle Problem Language Result Execution time Memory
894886 2023-12-29T07:20:39 Z adkjt Pilot (NOI19_pilot) C++14
26 / 100
 72 ms 71980 KB 
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
vector<int> g[1111111];
set<pair<int,int>> s;
int a[1111111];
long long ans[1111111],ind[1111111];
int main()
{
    int n,q,hmx=0;
    scanf("%d %d",&n,&q);
    for(int i=1;i<=n;i++)
        ind[i]=ind[i-1]+i;
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        hmx=max(hmx,a[i]);
        g[a[i]].push_back(i);
    }
    //s.insert({0,0});
    for(int i=1;i<=hmx;i++)
    {
        ans[i]=ans[i-1];
        //printf("Y");
        for(auto x:g[i])
        {
            //printf("OO");
              if(s.empty()){
                ans[i]+=1,s.insert({x,x});
                continue;
            }
            int cnt=1,rch=0,lch=0;
            auto it=s.lower_bound({x,x});
            if(it==s.end()) rch=1;
            auto itr=--it;
            it++;

            pair<int,int> left=*itr,right=*it;
            /*for(auto p=s.begin();p!=s.end();p++)
                printf("%d,%d ",(*p).f,(*p).s);*/
            //printf("\n%d %d %d %d %d\n%d %d\n",x,left.f,left.s,right.f,right.s,lch,rch);

            if(!rch&&left.s==x-1&&right.f==x+1)
            {
                  ans[i]-=ind[left.s-left.f+1];
                  ans[i]-=ind[right.s-right.f+1];
                  ans[i]+=ind[right.s-left.f+1];
                  s.erase(it);
                  s.erase(itr);
                  s.insert({left.f,right.s});
            }
            else if(!rch&&right.f==x+1)
            {
                ans[i]-=ind[right.s-right.f+1];
                ans[i]+=ind[right.s-x+1];
                s.erase(it);
                s.insert({x,right.s});
            }
            else if(left.s==x-1)
            {
                ans[i]-=ind[left.s-left.f+1];
                ans[i]+=ind[x-left.f+1];
                s.erase(itr);
                s.insert({left.f,x});
            }
            else
            ans[i]+=1,s.insert({x,x});

            //printf("LL");
        }
    }
    for(int i=1;i<=q;i++)
    {
        int qu;
        scanf("%d",&qu);
        if(qu>hmx) qu=hmx;
        printf("%lld\n",ans[qu]);
    }
   /* for(int i=1;i<=hmx;i++)
        printf("%lld ",ind[i]);*/
    return 0;
}

Compilation message

pilot.cpp: In function 'int main()':
pilot.cpp:33:17: warning: unused variable 'cnt' [-Wunused-variable]
   33 |             int cnt=1,rch=0,lch=0;
      |                 ^~~
pilot.cpp:33:29: warning: unused variable 'lch' [-Wunused-variable]
   33 |             int cnt=1,rch=0,lch=0;
      |                             ^~~
pilot.cpp:12:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     scanf("%d %d",&n,&q);
      |     ~~~~~^~~~~~~~~~~~~~~
pilot.cpp:17:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   17 |         scanf("%d",&a[i]);
      |         ~~~~~^~~~~~~~~~~~
pilot.cpp:76:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   76 |         scanf("%d",&qu);
      |         ~~~~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29528 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 10 ms 37504 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Correct 10 ms 37308 KB Output is correct
6 Correct 6 ms 29532 KB Output is correct
7 Correct 10 ms 37316 KB Output is correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 9 ms 35416 KB Output is correct
10 Correct 6 ms 29532 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29528 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 10 ms 37504 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Correct 10 ms 37308 KB Output is correct
6 Correct 6 ms 29532 KB Output is correct
7 Correct 10 ms 37316 KB Output is correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 9 ms 35416 KB Output is correct
10 Correct 6 ms 29532 KB Output is correct
11 Runtime error 27 ms 59740 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29528 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 10 ms 37504 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Correct 10 ms 37308 KB Output is correct
6 Correct 6 ms 29532 KB Output is correct
7 Correct 10 ms 37316 KB Output is correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 9 ms 35416 KB Output is correct
10 Correct 6 ms 29532 KB Output is correct
11 Runtime error 27 ms 59740 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #4
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29528 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 10 ms 37504 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Correct 10 ms 37308 KB Output is correct
6 Correct 6 ms 29532 KB Output is correct
7 Correct 10 ms 37316 KB Output is correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 9 ms 35416 KB Output is correct
10 Correct 6 ms 29532 KB Output is correct
11 Runtime error 27 ms 59740 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Runtime error 72 ms 71980 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 42 ms 37460 KB Output is correct
2 Correct 44 ms 37468 KB Output is correct
3 Correct 41 ms 37456 KB Output is correct
4 Correct 42 ms 37712 KB Output is correct
5 Correct 42 ms 37388 KB Output is correct

Subtask #7
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 44832 KB Output is correct
2 Correct 51 ms 44628 KB Output is correct
3 Correct 51 ms 44628 KB Output is correct
4 Correct 52 ms 44880 KB Output is correct
5 Correct 55 ms 44908 KB Output is correct

Subtask #8
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29528 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 10 ms 37504 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Correct 10 ms 37308 KB Output is correct
6 Correct 6 ms 29532 KB Output is correct
7 Correct 10 ms 37316 KB Output is correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 9 ms 35416 KB Output is correct
10 Correct 6 ms 29532 KB Output is correct
11 Runtime error 72 ms 71980 KB Execution killed with signal 11
12 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29528 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 10 ms 37504 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Correct 10 ms 37308 KB Output is correct
6 Correct 6 ms 29532 KB Output is correct
7 Correct 10 ms 37316 KB Output is correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 9 ms 35416 KB Output is correct
10 Correct 6 ms 29532 KB Output is correct
11 Runtime error 27 ms 59740 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29528 KB Output is correct
2 Correct 9 ms 35420 KB Output is correct
3 Correct 10 ms 37504 KB Output is correct
4 Correct 6 ms 29532 KB Output is correct
5 Correct 10 ms 37308 KB Output is correct
6 Correct 6 ms 29532 KB Output is correct
7 Correct 10 ms 37316 KB Output is correct
8 Correct 6 ms 29532 KB Output is correct
9 Correct 9 ms 35416 KB Output is correct
10 Correct 6 ms 29532 KB Output is correct
11 Runtime error 27 ms 59740 KB Execution killed with signal 6
12 Halted 0 ms 0 KB -