Submission #1187445

#	Time	Username	Problem	Language	Result	Execution time	Memory
1187445		oguzhan09	Pilot (NOI19_pilot)	C++20	55 / 100	1095 ms	7748 KiB

pilot

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

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);

    long long n, m;
    cin >> n >> m;
    vector<long long> l(n);
    for (int i = 0; i < n; i++) cin >> l[i];

    vector<pair<long long, int>> tests(m);
    for (int i = 0; i < m; i++) {
        long long a;
        cin >> a;
        tests[i] = {a, i};
    }
    sort(tests.begin(), tests.end()); // Testleri sırala

    vector<long long> answers(m);
    set<int> blocked_positions;

    for (int i = 0; i < m; i++) {
        long long T = tests[i].first;
        long long total = 0;
        long long count = 0;

        if (i == 0) {
            for (int j = 0; j < n; j++) {
                if (l[j] <= T) {
                    count++;
                } else {
                    total += count * (count + 1) / 2;
                    blocked_positions.insert(j);
                    count = 0;
                }
            }
            total += count * (count + 1) / 2;
        } else {
            // Yeni T ile birlikte daha fazla pozisyon aktif hale gelir
            for (auto it = blocked_positions.begin(); it != blocked_positions.end(); ) {
                if (l[*it] <= T) {
                    it = blocked_positions.erase(it); // aktif oldu, artık engelli değil
                } else {
                    ++it;
                }
            }

            // Şimdi tüm engelli pozisyonlara göre segmentleri bulup say
            int last = -1;
            for (int pos : blocked_positions) {
                long long len = pos - last - 1;
                if (len > 0)
                    total += len * (len + 1) / 2;
                last = pos;
            }

            // Son segment
            long long len = n - last - 1;
            if (len > 0)
                total += len * (len + 1) / 2;
        }

        answers[tests[i].second] = total;
    }

    for (auto x : answers) cout << x << '\n';

    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