oj.uz

답안 #320930

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320930 2020-11-10T09:20:06 Z egas Pilot (NOI19_pilot) C++17
89 / 100
 1000 ms 192996 KB 
#include <bits/stdc++.h>
 
using namespace std;

long LOG[1000005];
long POWW[31];
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 = LOG[R - L + 1];
 
        if (lookup[L][j] >= lookup[R - POWW[j] + 1][j])
 
            return lookup[L][j];
 
        else
 
            return lookup[R - POWW[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];
 
    }
    
    for(int i=0;i<1000005;i++){
    	LOG[i]=(long)log2l(i);	
    }
 	for(int i=0;i<31;i++){
 		POWW[i]=powl(2,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

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

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15972 KB Output is correct
2 Correct 61 ms 15972 KB Output is correct
3 Correct 59 ms 15972 KB Output is correct
4 Correct 59 ms 16100 KB Output is correct
5 Correct 59 ms 15972 KB Output is correct
6 Correct 60 ms 15972 KB Output is correct
7 Correct 61 ms 15972 KB Output is correct
8 Correct 58 ms 16120 KB Output is correct
9 Correct 58 ms 15972 KB Output is correct
10 Correct 58 ms 15972 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15972 KB Output is correct
2 Correct 61 ms 15972 KB Output is correct
3 Correct 59 ms 15972 KB Output is correct
4 Correct 59 ms 16100 KB Output is correct
5 Correct 59 ms 15972 KB Output is correct
6 Correct 60 ms 15972 KB Output is correct
7 Correct 61 ms 15972 KB Output is correct
8 Correct 58 ms 16120 KB Output is correct
9 Correct 58 ms 15972 KB Output is correct
10 Correct 58 ms 15972 KB Output is correct
11 Correct 63 ms 15972 KB Output is correct
12 Correct 61 ms 16228 KB Output is correct
13 Correct 58 ms 16100 KB Output is correct
14 Correct 60 ms 16300 KB Output is correct
15 Correct 64 ms 15972 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15972 KB Output is correct
2 Correct 61 ms 15972 KB Output is correct
3 Correct 59 ms 15972 KB Output is correct
4 Correct 59 ms 16100 KB Output is correct
5 Correct 59 ms 15972 KB Output is correct
6 Correct 60 ms 15972 KB Output is correct
7 Correct 61 ms 15972 KB Output is correct
8 Correct 58 ms 16120 KB Output is correct
9 Correct 58 ms 15972 KB Output is correct
10 Correct 58 ms 15972 KB Output is correct
11 Correct 63 ms 15972 KB Output is correct
12 Correct 61 ms 16228 KB Output is correct
13 Correct 58 ms 16100 KB Output is correct
14 Correct 60 ms 16300 KB Output is correct
15 Correct 64 ms 15972 KB Output is correct
16 Correct 60 ms 16100 KB Output is correct
17 Correct 60 ms 16740 KB Output is correct
18 Correct 67 ms 16008 KB Output is correct
19 Correct 60 ms 16740 KB Output is correct
20 Correct 60 ms 16100 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15972 KB Output is correct
2 Correct 61 ms 15972 KB Output is correct
3 Correct 59 ms 15972 KB Output is correct
4 Correct 59 ms 16100 KB Output is correct
5 Correct 59 ms 15972 KB Output is correct
6 Correct 60 ms 15972 KB Output is correct
7 Correct 61 ms 15972 KB Output is correct
8 Correct 58 ms 16120 KB Output is correct
9 Correct 58 ms 15972 KB Output is correct
10 Correct 58 ms 15972 KB Output is correct
11 Correct 63 ms 15972 KB Output is correct
12 Correct 61 ms 16228 KB Output is correct
13 Correct 58 ms 16100 KB Output is correct
14 Correct 60 ms 16300 KB Output is correct
15 Correct 64 ms 15972 KB Output is correct
16 Correct 60 ms 16100 KB Output is correct
17 Correct 60 ms 16740 KB Output is correct
18 Correct 67 ms 16008 KB Output is correct
19 Correct 60 ms 16740 KB Output is correct
20 Correct 60 ms 16100 KB Output is correct
21 Correct 59 ms 16228 KB Output is correct
22 Correct 63 ms 19428 KB Output is correct
23 Correct 61 ms 16228 KB Output is correct
24 Correct 61 ms 19296 KB Output is correct
25 Correct 59 ms 16372 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 133 ms 33892 KB Output is correct
2 Correct 150 ms 41316 KB Output is correct
3 Correct 131 ms 33252 KB Output is correct
4 Correct 141 ms 39780 KB Output is correct
5 Correct 126 ms 33124 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 142 ms 35556 KB Output is correct
2 Correct 141 ms 35684 KB Output is correct
3 Correct 148 ms 35448 KB Output is correct
4 Correct 153 ms 36324 KB Output is correct
5 Correct 143 ms 35300 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 149 ms 42852 KB Output is correct
2 Correct 151 ms 42724 KB Output is correct
3 Correct 151 ms 42340 KB Output is correct
4 Correct 153 ms 43876 KB Output is correct
5 Correct 150 ms 42980 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15972 KB Output is correct
2 Correct 61 ms 15972 KB Output is correct
3 Correct 59 ms 15972 KB Output is correct
4 Correct 59 ms 16100 KB Output is correct
5 Correct 59 ms 15972 KB Output is correct
6 Correct 60 ms 15972 KB Output is correct
7 Correct 61 ms 15972 KB Output is correct
8 Correct 58 ms 16120 KB Output is correct
9 Correct 58 ms 15972 KB Output is correct
10 Correct 58 ms 15972 KB Output is correct
11 Correct 133 ms 33892 KB Output is correct
12 Correct 150 ms 41316 KB Output is correct
13 Correct 131 ms 33252 KB Output is correct
14 Correct 141 ms 39780 KB Output is correct
15 Correct 126 ms 33124 KB Output is correct
16 Correct 128 ms 32996 KB Output is correct
17 Correct 156 ms 41188 KB Output is correct
18 Correct 147 ms 41592 KB Output is correct
19 Correct 126 ms 32868 KB Output is correct
20 Correct 149 ms 40932 KB Output is correct
21 Correct 128 ms 32868 KB Output is correct
22 Correct 140 ms 40292 KB Output is correct
23 Correct 136 ms 34276 KB Output is correct
24 Correct 145 ms 40068 KB Output is correct
25 Correct 133 ms 33764 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15972 KB Output is correct
2 Correct 61 ms 15972 KB Output is correct
3 Correct 59 ms 15972 KB Output is correct
4 Correct 59 ms 16100 KB Output is correct
5 Correct 59 ms 15972 KB Output is correct
6 Correct 60 ms 15972 KB Output is correct
7 Correct 61 ms 15972 KB Output is correct
8 Correct 58 ms 16120 KB Output is correct
9 Correct 58 ms 15972 KB Output is correct
10 Correct 58 ms 15972 KB Output is correct
11 Correct 63 ms 15972 KB Output is correct
12 Correct 61 ms 16228 KB Output is correct
13 Correct 58 ms 16100 KB Output is correct
14 Correct 60 ms 16300 KB Output is correct
15 Correct 64 ms 15972 KB Output is correct
16 Correct 60 ms 16100 KB Output is correct
17 Correct 60 ms 16740 KB Output is correct
18 Correct 67 ms 16008 KB Output is correct
19 Correct 60 ms 16740 KB Output is correct
20 Correct 60 ms 16100 KB Output is correct
21 Correct 59 ms 16228 KB Output is correct
22 Correct 63 ms 19428 KB Output is correct
23 Correct 61 ms 16228 KB Output is correct
24 Correct 61 ms 19296 KB Output is correct
25 Correct 59 ms 16372 KB Output is correct
26 Correct 133 ms 33892 KB Output is correct
27 Correct 150 ms 41316 KB Output is correct
28 Correct 131 ms 33252 KB Output is correct
29 Correct 141 ms 39780 KB Output is correct
30 Correct 126 ms 33124 KB Output is correct
31 Correct 142 ms 35556 KB Output is correct
32 Correct 141 ms 35684 KB Output is correct
33 Correct 148 ms 35448 KB Output is correct
34 Correct 153 ms 36324 KB Output is correct
35 Correct 143 ms 35300 KB Output is correct
36 Correct 149 ms 42852 KB Output is correct
37 Correct 151 ms 42724 KB Output is correct
38 Correct 151 ms 42340 KB Output is correct
39 Correct 153 ms 43876 KB Output is correct
40 Correct 150 ms 42980 KB Output is correct
41 Correct 128 ms 32996 KB Output is correct
42 Correct 156 ms 41188 KB Output is correct
43 Correct 147 ms 41592 KB Output is correct
44 Correct 126 ms 32868 KB Output is correct
45 Correct 149 ms 40932 KB Output is correct
46 Correct 128 ms 32868 KB Output is correct
47 Correct 140 ms 40292 KB Output is correct
48 Correct 136 ms 34276 KB Output is correct
49 Correct 145 ms 40068 KB Output is correct
50 Correct 133 ms 33764 KB Output is correct
51 Correct 161 ms 36068 KB Output is correct
52 Correct 173 ms 42724 KB Output is correct
53 Correct 166 ms 36456 KB Output is correct
54 Correct 169 ms 42724 KB Output is correct
55 Correct 155 ms 36452 KB Output is correct

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 15972 KB Output is correct
2 Correct 61 ms 15972 KB Output is correct
3 Correct 59 ms 15972 KB Output is correct
4 Correct 59 ms 16100 KB Output is correct
5 Correct 59 ms 15972 KB Output is correct
6 Correct 60 ms 15972 KB Output is correct
7 Correct 61 ms 15972 KB Output is correct
8 Correct 58 ms 16120 KB Output is correct
9 Correct 58 ms 15972 KB Output is correct
10 Correct 58 ms 15972 KB Output is correct
11 Correct 63 ms 15972 KB Output is correct
12 Correct 61 ms 16228 KB Output is correct
13 Correct 58 ms 16100 KB Output is correct
14 Correct 60 ms 16300 KB Output is correct
15 Correct 64 ms 15972 KB Output is correct
16 Correct 60 ms 16100 KB Output is correct
17 Correct 60 ms 16740 KB Output is correct
18 Correct 67 ms 16008 KB Output is correct
19 Correct 60 ms 16740 KB Output is correct
20 Correct 60 ms 16100 KB Output is correct
21 Correct 59 ms 16228 KB Output is correct
22 Correct 63 ms 19428 KB Output is correct
23 Correct 61 ms 16228 KB Output is correct
24 Correct 61 ms 19296 KB Output is correct
25 Correct 59 ms 16372 KB Output is correct
26 Correct 133 ms 33892 KB Output is correct
27 Correct 150 ms 41316 KB Output is correct
28 Correct 131 ms 33252 KB Output is correct
29 Correct 141 ms 39780 KB Output is correct
30 Correct 126 ms 33124 KB Output is correct
31 Correct 142 ms 35556 KB Output is correct
32 Correct 141 ms 35684 KB Output is correct
33 Correct 148 ms 35448 KB Output is correct
34 Correct 153 ms 36324 KB Output is correct
35 Correct 143 ms 35300 KB Output is correct
36 Correct 149 ms 42852 KB Output is correct
37 Correct 151 ms 42724 KB Output is correct
38 Correct 151 ms 42340 KB Output is correct
39 Correct 153 ms 43876 KB Output is correct
40 Correct 150 ms 42980 KB Output is correct
41 Correct 128 ms 32996 KB Output is correct
42 Correct 156 ms 41188 KB Output is correct
43 Correct 147 ms 41592 KB Output is correct
44 Correct 126 ms 32868 KB Output is correct
45 Correct 149 ms 40932 KB Output is correct
46 Correct 128 ms 32868 KB Output is correct
47 Correct 140 ms 40292 KB Output is correct
48 Correct 136 ms 34276 KB Output is correct
49 Correct 145 ms 40068 KB Output is correct
50 Correct 133 ms 33764 KB Output is correct
51 Correct 161 ms 36068 KB Output is correct
52 Correct 173 ms 42724 KB Output is correct
53 Correct 166 ms 36456 KB Output is correct
54 Correct 169 ms 42724 KB Output is correct
55 Correct 155 ms 36452 KB Output is correct
56 Execution timed out 1091 ms 192996 KB Time limit exceeded
57 Halted 0 ms 0 KB -