oj.uz

답안 #320938

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
320938 2020-11-10T09:58:57 Z egas Pilot (NOI19_pilot) C++14
89 / 100
 1000 ms 201308 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];
    long * frnt = new long[1000005];
    for (long i = 0; i < a.size(); i++) {
        last[a[i]] = -1;
        frnt[a[i]] = n;
    }
    
    for (long i = 0; i < n; i++) {
        long ryt = 0;
        long l = i;
        long r = a.size() - 1;
        if(i-1>=0 and a[i-1]>a[i]){
        	r=frnt[i-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);
            }
        }
        frnt[i]=ryt;
        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:29:28: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |         for (long i = 0; i < a.size(); i++) {
      |                          ~~^~~~~~~~~~
pilot.cpp: In function 'int32_t main()':
pilot.cpp:78:24: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |     for (long i = 0; i < a.size(); i++) {
      |                      ~~^~~~~~~~~~
pilot.cpp:133:24: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  133 |     for (long i = 1; i < diff.size(); i++) {
      |                      ~~^~~~~~~~~~~~~
pilot.cpp:137:24: warning: comparison of integer expressions of different signedness: 'long int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  137 |     for (long i = 0; i < b.size(); i++) {
      |                      ~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 15972 KB Output is correct
2 Correct 62 ms 16100 KB Output is correct
3 Correct 60 ms 16100 KB Output is correct
4 Correct 59 ms 15972 KB Output is correct
5 Correct 64 ms 16020 KB Output is correct
6 Correct 64 ms 15972 KB Output is correct
7 Correct 58 ms 16100 KB Output is correct
8 Correct 59 ms 16100 KB Output is correct
9 Correct 58 ms 16100 KB Output is correct
10 Correct 65 ms 15972 KB Output is correct
11 Correct 64 ms 15972 KB Output is correct
12 Correct 65 ms 16228 KB Output is correct
13 Correct 59 ms 15972 KB Output is correct
14 Correct 59 ms 16356 KB Output is correct
15 Correct 59 ms 15972 KB Output is correct
16 Correct 58 ms 16100 KB Output is correct
17 Correct 59 ms 17636 KB Output is correct
18 Correct 63 ms 16100 KB Output is correct
19 Correct 61 ms 17532 KB Output is correct
20 Correct 59 ms 16100 KB Output is correct
21 Correct 60 ms 16228 KB Output is correct
22 Correct 63 ms 22500 KB Output is correct
23 Correct 59 ms 16228 KB Output is correct
24 Correct 62 ms 22372 KB Output is correct
25 Correct 59 ms 16232 KB Output is correct

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 125 ms 34148 KB Output is correct
2 Correct 154 ms 49264 KB Output is correct
3 Correct 123 ms 34148 KB Output is correct
4 Correct 144 ms 47844 KB Output is correct
5 Correct 127 ms 33892 KB Output is correct

Subtask #6
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 153 ms 35300 KB Output is correct
2 Correct 140 ms 35428 KB Output is correct
3 Correct 141 ms 34916 KB Output is correct
4 Correct 142 ms 35940 KB Output is correct
5 Correct 144 ms 34916 KB Output is correct

Subtask #7
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 156 ms 49784 KB Output is correct
2 Correct 157 ms 49252 KB Output is correct
3 Correct 153 ms 48996 KB Output is correct
4 Correct 170 ms 50532 KB Output is correct
5 Correct 153 ms 49636 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 15972 KB Output is correct
2 Correct 62 ms 16100 KB Output is correct
3 Correct 60 ms 16100 KB Output is correct
4 Correct 59 ms 15972 KB Output is correct
5 Correct 64 ms 16020 KB Output is correct
6 Correct 64 ms 15972 KB Output is correct
7 Correct 58 ms 16100 KB Output is correct
8 Correct 59 ms 16100 KB Output is correct
9 Correct 58 ms 16100 KB Output is correct
10 Correct 65 ms 15972 KB Output is correct
11 Correct 125 ms 34148 KB Output is correct
12 Correct 154 ms 49264 KB Output is correct
13 Correct 123 ms 34148 KB Output is correct
14 Correct 144 ms 47844 KB Output is correct
15 Correct 127 ms 33892 KB Output is correct
16 Correct 124 ms 33892 KB Output is correct
17 Correct 146 ms 49124 KB Output is correct
18 Correct 159 ms 49508 KB Output is correct
19 Correct 125 ms 33764 KB Output is correct
20 Correct 145 ms 48996 KB Output is correct
21 Correct 121 ms 33760 KB Output is correct
22 Correct 140 ms 48228 KB Output is correct
23 Correct 129 ms 35300 KB Output is correct
24 Correct 141 ms 47972 KB Output is correct
25 Correct 129 ms 34664 KB Output is correct

Subtask #9
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 15972 KB Output is correct
2 Correct 62 ms 16100 KB Output is correct
3 Correct 60 ms 16100 KB Output is correct
4 Correct 59 ms 15972 KB Output is correct
5 Correct 64 ms 16020 KB Output is correct
6 Correct 64 ms 15972 KB Output is correct
7 Correct 58 ms 16100 KB Output is correct
8 Correct 59 ms 16100 KB Output is correct
9 Correct 58 ms 16100 KB Output is correct
10 Correct 65 ms 15972 KB Output is correct
11 Correct 64 ms 15972 KB Output is correct
12 Correct 65 ms 16228 KB Output is correct
13 Correct 59 ms 15972 KB Output is correct
14 Correct 59 ms 16356 KB Output is correct
15 Correct 59 ms 15972 KB Output is correct
16 Correct 58 ms 16100 KB Output is correct
17 Correct 59 ms 17636 KB Output is correct
18 Correct 63 ms 16100 KB Output is correct
19 Correct 61 ms 17532 KB Output is correct
20 Correct 59 ms 16100 KB Output is correct
21 Correct 60 ms 16228 KB Output is correct
22 Correct 63 ms 22500 KB Output is correct
23 Correct 59 ms 16228 KB Output is correct
24 Correct 62 ms 22372 KB Output is correct
25 Correct 59 ms 16232 KB Output is correct
26 Correct 125 ms 34148 KB Output is correct
27 Correct 154 ms 49264 KB Output is correct
28 Correct 123 ms 34148 KB Output is correct
29 Correct 144 ms 47844 KB Output is correct
30 Correct 127 ms 33892 KB Output is correct
31 Correct 153 ms 35300 KB Output is correct
32 Correct 140 ms 35428 KB Output is correct
33 Correct 141 ms 34916 KB Output is correct
34 Correct 142 ms 35940 KB Output is correct
35 Correct 144 ms 34916 KB Output is correct
36 Correct 156 ms 49784 KB Output is correct
37 Correct 157 ms 49252 KB Output is correct
38 Correct 153 ms 48996 KB Output is correct
39 Correct 170 ms 50532 KB Output is correct
40 Correct 153 ms 49636 KB Output is correct
41 Correct 124 ms 33892 KB Output is correct
42 Correct 146 ms 49124 KB Output is correct
43 Correct 159 ms 49508 KB Output is correct
44 Correct 125 ms 33764 KB Output is correct
45 Correct 145 ms 48996 KB Output is correct
46 Correct 121 ms 33760 KB Output is correct
47 Correct 140 ms 48228 KB Output is correct
48 Correct 129 ms 35300 KB Output is correct
49 Correct 141 ms 47972 KB Output is correct
50 Correct 129 ms 34664 KB Output is correct
51 Correct 160 ms 36836 KB Output is correct
52 Correct 180 ms 50532 KB Output is correct
53 Correct 158 ms 37092 KB Output is correct
54 Correct 178 ms 50532 KB Output is correct
55 Correct 156 ms 37220 KB Output is correct

Subtask #10
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 60 ms 15972 KB Output is correct
2 Correct 62 ms 16100 KB Output is correct
3 Correct 60 ms 16100 KB Output is correct
4 Correct 59 ms 15972 KB Output is correct
5 Correct 64 ms 16020 KB Output is correct
6 Correct 64 ms 15972 KB Output is correct
7 Correct 58 ms 16100 KB Output is correct
8 Correct 59 ms 16100 KB Output is correct
9 Correct 58 ms 16100 KB Output is correct
10 Correct 65 ms 15972 KB Output is correct
11 Correct 64 ms 15972 KB Output is correct
12 Correct 65 ms 16228 KB Output is correct
13 Correct 59 ms 15972 KB Output is correct
14 Correct 59 ms 16356 KB Output is correct
15 Correct 59 ms 15972 KB Output is correct
16 Correct 58 ms 16100 KB Output is correct
17 Correct 59 ms 17636 KB Output is correct
18 Correct 63 ms 16100 KB Output is correct
19 Correct 61 ms 17532 KB Output is correct
20 Correct 59 ms 16100 KB Output is correct
21 Correct 60 ms 16228 KB Output is correct
22 Correct 63 ms 22500 KB Output is correct
23 Correct 59 ms 16228 KB Output is correct
24 Correct 62 ms 22372 KB Output is correct
25 Correct 59 ms 16232 KB Output is correct
26 Correct 125 ms 34148 KB Output is correct
27 Correct 154 ms 49264 KB Output is correct
28 Correct 123 ms 34148 KB Output is correct
29 Correct 144 ms 47844 KB Output is correct
30 Correct 127 ms 33892 KB Output is correct
31 Correct 153 ms 35300 KB Output is correct
32 Correct 140 ms 35428 KB Output is correct
33 Correct 141 ms 34916 KB Output is correct
34 Correct 142 ms 35940 KB Output is correct
35 Correct 144 ms 34916 KB Output is correct
36 Correct 156 ms 49784 KB Output is correct
37 Correct 157 ms 49252 KB Output is correct
38 Correct 153 ms 48996 KB Output is correct
39 Correct 170 ms 50532 KB Output is correct
40 Correct 153 ms 49636 KB Output is correct
41 Correct 124 ms 33892 KB Output is correct
42 Correct 146 ms 49124 KB Output is correct
43 Correct 159 ms 49508 KB Output is correct
44 Correct 125 ms 33764 KB Output is correct
45 Correct 145 ms 48996 KB Output is correct
46 Correct 121 ms 33760 KB Output is correct
47 Correct 140 ms 48228 KB Output is correct
48 Correct 129 ms 35300 KB Output is correct
49 Correct 141 ms 47972 KB Output is correct
50 Correct 129 ms 34664 KB Output is correct
51 Correct 160 ms 36836 KB Output is correct
52 Correct 180 ms 50532 KB Output is correct
53 Correct 158 ms 37092 KB Output is correct
54 Correct 178 ms 50532 KB Output is correct
55 Correct 156 ms 37220 KB Output is correct
56 Execution timed out 1100 ms 201308 KB Time limit exceeded
57 Halted 0 ms 0 KB -