Submission #320907

#	Time	Username	Problem	Language	Result	Execution time	Memory
320907		egas	Pilot (NOI19_pilot)	C++14	89 / 100	1098 ms	184676 KiB

pilot

#include <bits/stdc++.h>

using namespace std;

class SparseTable {

private:

    long lookup[1000005][(long)log2l(1000005)+1];

    void buildSparseTable(long arr[], long n) {

        for (long i = 0; i < n; i++)

            lookup[i][0] = arr[i];

        for (long j = 1; (1 << j) <= n; j++) {

            for (long i = 0; (i + (1 << j) - 1) < n; i++) {

                if (lookup[i][j - 1] > lookup[i + (1 << (j - 1))][j - 1])

                    lookup[i][j] = lookup[i][j - 1];

                else

                    lookup[i][j] = lookup[i + (1 << (j - 1))][j - 1];

            }

        }

    }

public:

    SparseTable(vector<long> &a) {

        long num[a.size()];

        for(long i = 0 ; i < a.size() ; i++) {

            num[i]=a[i];

        }

        buildSparseTable(num,a.size());

    }

    long query(long L, long R) {

        L--;

        R--;

        long j = (long)log2(R - L + 1);

        if (lookup[L][j] >= lookup[R - (1 << j) + 1][j])

            return lookup[L][j];

        else

            return lookup[R - (1 << j) + 1][j];

    }

};

int32_t main() {

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    long n;

    cin >> n;

    long m;

    cin >> m;

    vector<long> a(n);

    for(long i = 0 ; i < n ; i++) {

        cin >> a[i];

    }

    vector<long> b(m);

    for(long i = 0 ; i < m ; i++) {

        cin >> b[i];

    }

    vector<long> diff(1000005,0);

    SparseTable ST(a);

    long *last=new long[1000005];

    for(long i = 0 ; i < a.size() ; i++) {

        last[a[i]]=-1;

    }

    for(long i=0; i<n; i++) {

        long ryt=0;

        long l=i;

        long r=a.size()-1;

        while(l<=r) {

            if(l==r) {

                if(ST.query(i+1,l+1)<=a[i]) {

                    ryt=max(ryt,l);

                }

                break;

            }

            long m=(l+r)/2;

            if(ST.query(i+1,m+1)>a[i]) {

                r=m-1;

            } else {

                l=m+1;

                ryt=max(ryt,m);

            }

        }

        ryt=ryt-i+1;

        ryt--;

        long left=1e9;

        l=last[a[i]]+1;

        r=i;

        while(l<=r) {

            if(l==r) {

                if(ST.query(l+1,i+1)<=a[i]) {

                    left=min(left,l);

                }

                break;

            }

            long m=(l+r)/2;

            if(ST.query(m+1,i+1)>a[i]) {

                l=m+1;

            } else {

                r=m-1;

                left=min(left,m);

            }

        }

        left=i-left;

        last[a[i]]=i;

        diff[a[i]]+=((left+1)*(ryt+1));

    }

    for(long i=1; i<diff.size(); i++) {

        diff[i]+=diff[i-1];

    }

    for(long i = 0 ; i < b.size() ; i++) {

        cout << diff[b[i]] << '\n';

    }

    return 0;

}

Compilation message (stderr)

pilot.cpp: In constructor 'SparseTable::SparseTable(std::vector<long int>&)':
pilot.cpp:41:28: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(long i = 0 ; i < a.size() ; i++) {
      |                          ~~^~~~~~~~~~
pilot.cpp: In function 'int32_t main()':
pilot.cpp:107:24: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  107 |     for(long i = 0 ; i < a.size() ; i++) {
      |                      ~~^~~~~~~~~~
pilot.cpp:199:20: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  199 |     for(long i=1; i<diff.size(); i++) {
      |                   ~^~~~~~~~~~~~
pilot.cpp:205:24: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  205 |     for(long i = 0 ; i < b.size() ; i++) {
      |                      ~~^~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 10 / 10
• Subtask 3: 12 / 12
• Subtask 4: 15 / 15
• Subtask 5: 5 / 5
• Subtask 6: 9 / 9
• Subtask 7: 14 / 14
• Subtask 8: 10 / 10
• Subtask 9: 11 / 11
• Subtask 10: 0 / 11