oj.uz

답안 #320908

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320908 2020-11-10T08:24:21 Z egas Pilot (NOI19_pilot) C++14
40 / 100
 149 ms 17768 KB 
#include <bits/stdc++.h>

using namespace std;

class SparseTable {

private:

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

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

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

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

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

            for (int 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<int> &a) {

        int num[a.size()];

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

            num[i]=a[i];

        }

        buildSparseTable(num,a.size());

    }

    int query(int L, int R) {

        L--;

        R--;

        int j = (int)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);

    int n;

    cin >> n;

    int m;

    cin >> m;

    vector<int> a(n);

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

        cin >> a[i];

    }

    vector<int> b(m);

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

        cin >> b[i];

    }

    vector<int> diff(1000005,0);

    SparseTable ST(a);

    int *last=new int[1000005];

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

        last[a[i]]=-1;

    }

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

        int ryt=0;

        int l=i;

        int r=a.size()-1;

        while(l<=r) {

            if(l==r) {

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

                    ryt=max(ryt,l);

                }

                break;

            }

            int 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--;

        int 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;

            }

            int 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(int i=1; i<diff.size(); i++) {

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

    }

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

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

    }

    return 0;

}

Compilation message

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

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4204 KB Output is correct
2 Correct 6 ms 4332 KB Output is correct
3 Correct 6 ms 4332 KB Output is correct
4 Correct 6 ms 4204 KB Output is correct
5 Correct 6 ms 4332 KB Output is correct
6 Correct 6 ms 4332 KB Output is correct
7 Correct 6 ms 4332 KB Output is correct
8 Correct 6 ms 4332 KB Output is correct
9 Correct 7 ms 4332 KB Output is correct
10 Correct 6 ms 4332 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4204 KB Output is correct
2 Correct 6 ms 4332 KB Output is correct
3 Correct 6 ms 4332 KB Output is correct
4 Correct 6 ms 4204 KB Output is correct
5 Correct 6 ms 4332 KB Output is correct
6 Correct 6 ms 4332 KB Output is correct
7 Correct 6 ms 4332 KB Output is correct
8 Correct 6 ms 4332 KB Output is correct
9 Correct 7 ms 4332 KB Output is correct
10 Correct 6 ms 4332 KB Output is correct
11 Correct 6 ms 4332 KB Output is correct
12 Correct 6 ms 4332 KB Output is correct
13 Correct 6 ms 4332 KB Output is correct
14 Correct 6 ms 4332 KB Output is correct
15 Correct 6 ms 4332 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4204 KB Output is correct
2 Correct 6 ms 4332 KB Output is correct
3 Correct 6 ms 4332 KB Output is correct
4 Correct 6 ms 4204 KB Output is correct
5 Correct 6 ms 4332 KB Output is correct
6 Correct 6 ms 4332 KB Output is correct
7 Correct 6 ms 4332 KB Output is correct
8 Correct 6 ms 4332 KB Output is correct
9 Correct 7 ms 4332 KB Output is correct
10 Correct 6 ms 4332 KB Output is correct
11 Correct 6 ms 4332 KB Output is correct
12 Correct 6 ms 4332 KB Output is correct
13 Correct 6 ms 4332 KB Output is correct
14 Correct 6 ms 4332 KB Output is correct
15 Correct 6 ms 4332 KB Output is correct
16 Correct 6 ms 4332 KB Output is correct
17 Correct 6 ms 4972 KB Output is correct
18 Correct 6 ms 4332 KB Output is correct
19 Correct 6 ms 4972 KB Output is correct
20 Correct 7 ms 4332 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4204 KB Output is correct
2 Correct 6 ms 4332 KB Output is correct
3 Correct 6 ms 4332 KB Output is correct
4 Correct 6 ms 4204 KB Output is correct
5 Correct 6 ms 4332 KB Output is correct
6 Correct 6 ms 4332 KB Output is correct
7 Correct 6 ms 4332 KB Output is correct
8 Correct 6 ms 4332 KB Output is correct
9 Correct 7 ms 4332 KB Output is correct
10 Correct 6 ms 4332 KB Output is correct
11 Correct 6 ms 4332 KB Output is correct
12 Correct 6 ms 4332 KB Output is correct
13 Correct 6 ms 4332 KB Output is correct
14 Correct 6 ms 4332 KB Output is correct
15 Correct 6 ms 4332 KB Output is correct
16 Correct 6 ms 4332 KB Output is correct
17 Correct 6 ms 4972 KB Output is correct
18 Correct 6 ms 4332 KB Output is correct
19 Correct 6 ms 4972 KB Output is correct
20 Correct 7 ms 4332 KB Output is correct
21 Correct 7 ms 4460 KB Output is correct
22 Correct 8 ms 6892 KB Output is correct
23 Correct 6 ms 4332 KB Output is correct
24 Correct 8 ms 6892 KB Output is correct
25 Correct 6 ms 4332 KB Output is correct

Subtask #5
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 124 ms 13068 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 149 ms 14056 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 137 ms 17768 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4204 KB Output is correct
2 Correct 6 ms 4332 KB Output is correct
3 Correct 6 ms 4332 KB Output is correct
4 Correct 6 ms 4204 KB Output is correct
5 Correct 6 ms 4332 KB Output is correct
6 Correct 6 ms 4332 KB Output is correct
7 Correct 6 ms 4332 KB Output is correct
8 Correct 6 ms 4332 KB Output is correct
9 Correct 7 ms 4332 KB Output is correct
10 Correct 6 ms 4332 KB Output is correct
11 Incorrect 124 ms 13068 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #9
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4204 KB Output is correct
2 Correct 6 ms 4332 KB Output is correct
3 Correct 6 ms 4332 KB Output is correct
4 Correct 6 ms 4204 KB Output is correct
5 Correct 6 ms 4332 KB Output is correct
6 Correct 6 ms 4332 KB Output is correct
7 Correct 6 ms 4332 KB Output is correct
8 Correct 6 ms 4332 KB Output is correct
9 Correct 7 ms 4332 KB Output is correct
10 Correct 6 ms 4332 KB Output is correct
11 Correct 6 ms 4332 KB Output is correct
12 Correct 6 ms 4332 KB Output is correct
13 Correct 6 ms 4332 KB Output is correct
14 Correct 6 ms 4332 KB Output is correct
15 Correct 6 ms 4332 KB Output is correct
16 Correct 6 ms 4332 KB Output is correct
17 Correct 6 ms 4972 KB Output is correct
18 Correct 6 ms 4332 KB Output is correct
19 Correct 6 ms 4972 KB Output is correct
20 Correct 7 ms 4332 KB Output is correct
21 Correct 7 ms 4460 KB Output is correct
22 Correct 8 ms 6892 KB Output is correct
23 Correct 6 ms 4332 KB Output is correct
24 Correct 8 ms 6892 KB Output is correct
25 Correct 6 ms 4332 KB Output is correct
26 Incorrect 124 ms 13068 KB Output isn't correct
27 Halted 0 ms 0 KB -

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 4204 KB Output is correct
2 Correct 6 ms 4332 KB Output is correct
3 Correct 6 ms 4332 KB Output is correct
4 Correct 6 ms 4204 KB Output is correct
5 Correct 6 ms 4332 KB Output is correct
6 Correct 6 ms 4332 KB Output is correct
7 Correct 6 ms 4332 KB Output is correct
8 Correct 6 ms 4332 KB Output is correct
9 Correct 7 ms 4332 KB Output is correct
10 Correct 6 ms 4332 KB Output is correct
11 Correct 6 ms 4332 KB Output is correct
12 Correct 6 ms 4332 KB Output is correct
13 Correct 6 ms 4332 KB Output is correct
14 Correct 6 ms 4332 KB Output is correct
15 Correct 6 ms 4332 KB Output is correct
16 Correct 6 ms 4332 KB Output is correct
17 Correct 6 ms 4972 KB Output is correct
18 Correct 6 ms 4332 KB Output is correct
19 Correct 6 ms 4972 KB Output is correct
20 Correct 7 ms 4332 KB Output is correct
21 Correct 7 ms 4460 KB Output is correct
22 Correct 8 ms 6892 KB Output is correct
23 Correct 6 ms 4332 KB Output is correct
24 Correct 8 ms 6892 KB Output is correct
25 Correct 6 ms 4332 KB Output is correct
26 Incorrect 124 ms 13068 KB Output isn't correct
27 Halted 0 ms 0 KB -