oj.uz

답안 #225116

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
225116 2020-04-19T09:34:20 Z tictaccat Pilot (NOI19_pilot) C++14
18 / 100
 113 ms 4712 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int N,Q;
int H[2000000], l[2000000], r[2000000];
LL ans[2000000];
vector<pair<int,int>> QU, M;

LL pairs(LL n) {
    return n*(n-1)/2 + n;
}

int main() {

    cin >> N >> Q;
    for (int i = 0; i < N; i++) {
        cin >> H[i];
        M.emplace_back(H[i],i);
        l[i] = i+1;
        r[i] = i-1;
    }
    for (int i = 0; i < Q; i++) {
        int y; 
        cin >> y;
        QU.emplace_back(y,i);
    }

    sort(QU.begin(), QU.end());
    sort(M.begin(), M.end());
    int k = 0;
    LL cnt = 0;

    for (auto m: M) {
        int h,i;
        tie(h,i) = m;
        while (k < Q && QU[k].first < h) {
            ans[k] = cnt;
            k++;
        }
        cnt += pairs(r[i]-l[i]-1);
        cnt -= pairs(r[i]-i-1);
        cnt -= pairs(i-l[i]-1);
        if (l[i] != -1) {
            l[r[i]] = l[i];
        }
        if (r[i] != N) {
            r[l[i]] = r[i];            
        }
    }

    while (k < Q) {
        ans[k] = cnt;
        k++;
    }

    for (int i = 0; i < Q; i++) cout << ans[i] << "\n";

    return 0;
}

Subtask #1
3.0 / 3.0

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

Subtask #2
0 / 10.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 15.0

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

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 2412 KB Output is correct
2 Correct 62 ms 3052 KB Output is correct
3 Correct 57 ms 2800 KB Output is correct
4 Correct 63 ms 2928 KB Output is correct
5 Correct 59 ms 2800 KB Output is correct

Subtask #6
0 / 9.0

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

Subtask #7
0 / 14.0

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

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 58 ms 2412 KB Output is correct
12 Correct 62 ms 3052 KB Output is correct
13 Correct 57 ms 2800 KB Output is correct
14 Correct 63 ms 2928 KB Output is correct
15 Correct 59 ms 2800 KB Output is correct
16 Correct 56 ms 2808 KB Output is correct
17 Correct 63 ms 3052 KB Output is correct
18 Correct 62 ms 3052 KB Output is correct
19 Correct 55 ms 2800 KB Output is correct
20 Correct 64 ms 2952 KB Output is correct
21 Correct 56 ms 2796 KB Output is correct
22 Correct 62 ms 2928 KB Output is correct
23 Correct 58 ms 2924 KB Output is correct
24 Correct 58 ms 2928 KB Output is correct
25 Correct 58 ms 2924 KB Output is correct

Subtask #9
0 / 11.0

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

Subtask #10
0 / 11.0

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