제출 #753108

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
753108		minhnhatnoe	Pilot (NOI19_pilot)	C++14	89 / 100	1054 ms	47056 KiB

pilot

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

ll cresult = 0;
set<pair<int, int>> s;
ll calcpair(ll len){
    return len*(len+1)/2;
}
ll calcpair(pair<int, int> se){
    return calcpair(se.second - se.first + 1);
}
void insert(int pos){
    cresult += calcpair(1);
    set<pair<int, int>>::iterator it1, it2;
    it2 = s.emplace(pos, pos).first;
    if (it2 != s.begin()){
        it1 = prev(it2);
        if (it1->second+1 == it2->first){
            cresult -= calcpair(*it1) + calcpair(*it2);
            pair<int, int> nxt(it1->first, it2->second);
            s.erase(it1), s.erase(it2);
            it1 = s.insert(nxt).first;
            cresult += calcpair(nxt);
        }
        else it1 = it2;
    }
    else it1 = it2;
    it2 = next(it1);

    if (it2 != s.end()){
        if (it1->second+1 == it2->first){
            cresult -= calcpair(*it1) + calcpair(*it2);
            pair<int, int> nxt(it1->first, it2->second);
            s.erase(it1), s.erase(it2);
            it1 = s.insert(nxt).first;
            cresult += calcpair(nxt);
        }
    }
}
signed main(){
    cin.tie(0)->sync_with_stdio(0);
    int n, q; cin >> n >> q;
    vector<pair<int, int>> a(n), b(q);
    for (int i=0; i<n; i++){
        cin >> a[i].first;
        a[i].second = i;
    }
    for (int i=0; i<q; i++){
        cin >> b[i].first;
        b[i].second = i;
    }
    vector<ll> result(q);
    sort(a.begin(), a.end()), sort(b.begin(), b.end());
    for (int i=0, aptr=0; i<q; i++){
        while (aptr < a.size() && a[aptr].first <= b[i].first){
            insert(a[aptr++].second);
        }
        result[b[i].second] = cresult;
    }
    for (int i=0; i<q; i++){
        cout << result[i] << "\n";
    }
}

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

pilot.cpp: In function 'int main()':
pilot.cpp:56:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |         while (aptr < a.size() && a[aptr].first <= b[i].first){
      |                ~~~~~^~~~~~~~~~

• 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