제출 #1028356

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1028356		Swee	Pilot (NOI19_pilot)	C++14	89 / 100	1082 ms	33024 KiB

pilot

#include <iostream>
#include <vector>

using namespace std;

struct mountain {
    int height;
    int index;
};

//vector<long long> count(vector<int> h, vector<int> y) { // i would have written like that, but ive had no idea, how to make it faster
void count(vector<int> h, int q) {
    h.push_back(1000001); // last border

    vector<mountain> border;
    border.push_back({1000002, -1}); // blocker 

    vector<long long> allPlanes(1000001);
    for (int i = 0; i < h.size(); i++) {
        for (;h[i] >= border.back().height; border.pop_back()) { // remove last border
            long long a = (i - border.back().index), b = (border.back().index - border[border.size() - 2].index);
            allPlanes[border.back().height] += a * b; // add possible flights to last border mountain height velocity plane
            // starting before or with last border * ending after or with last border
        }
        border.push_back({h[i], i}); // add border
    }

    for (int i = 2; i < allPlanes.size(); i++) { // partial sum of possible flights
        allPlanes[i] += allPlanes[i - 1];
    }

    /*vector<long long> result;
 
    for (int Y : y) { // filling up queries
        if (Y >= allPlanes.size()) {
            result.push_back(allPlanes.back());
        }else {
            result.push_back(allPlanes[Y]);
        }
    }
 
    return result;*/

    int Y;
    for (int i = 0; i < q; i++) { // filling up queries
        cin >> Y;
        if (Y >= allPlanes.size()) {
            cout << allPlanes.back() << endl;
        }else {
            cout << allPlanes[Y] << endl;
        }
    }

    return;
}

int main() {
    int n, q;
    cin >> n >> q;

    vector<int> h(n);
    for (int i = 0; i < n; i++) {
        cin >> h[i];
    }

    count(h, q);

    /*vector<int> y(q);
    for (int i = 0; i < q; i++) {
        cin >> y[i];
    }

    for (long long r : count(h, y)) {
        cout << r << endl;
    }*/

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

pilot.cpp: In function 'void count(std::vector<int>, int)':
pilot.cpp:19:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |     for (int i = 0; i < h.size(); i++) {
      |                     ~~^~~~~~~~~~
pilot.cpp:28:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |     for (int i = 2; i < allPlanes.size(); i++) { // partial sum of possible flights
      |                     ~~^~~~~~~~~~~~~~~~~~
pilot.cpp:47:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         if (Y >= allPlanes.size()) {
      |             ~~^~~~~~~~~~~~~~~~~~~

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