Submission #334109

#	Time	Username	Problem	Language	Result	Execution time	Memory
334109		aryan12	Pilot (NOI19_pilot)	C++17	55 / 100	239 ms	3308 KiB

pilot

#include <bits/stdc++.h>
using namespace std;

const long long N = 1e6 + 10;
long long a[N];
long long n, q;

//for 78 points

void Solve1() {
    for(long long i = 1; i <= q; i++) {
        long long x;
        cin >> x;
        long long ans = 0, cnt = 0;
        for(long long j = 1; j <= n; j++) {
            if(a[j] <= x) {
                cnt++;
                ans++;
            }
            else {
                ans += (cnt * (cnt - 1)) / 2;
                cnt = 0;
            }
        }
        ans += (cnt * (cnt - 1)) / 2;
        cout << ans << endl;
    }
}

void Solve2() {
    for(long long i = 1; i <= q; i++) {
        long long x;
        cin >> x;
        long long l = 1, r = n;
        long long mid, ans = 0;
        while(l <= r) {
            mid = (l + r) / 2;
            if(a[mid] <= x) {
                ans = mid;
                l = mid + 1;
            }
            else {
                r = mid - 1;
            }
        }
        cout << ans * (ans - 1) / 2 << endl;
    }
}

void Solve() {
    cin >> n >> q;
    for(long long i = 1; i <= n; i++) {
        cin >> a[i];
    }
    if(n * q <= 1e6) {
        Solve1();
    }
    else {
        Solve2();
    }
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    Solve();
    return 0;
}

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