제출 #1098782

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1098782		gyg	Measures (CEOI22_measures)	C++17	0 / 100	1571 ms	13536 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define arr array 
#define vct vector 
#define pii pair<int, int>
#define fir first 
#define sec second 
const int N = 2e5 + 5, M = 2e5 + 5, INF = 1e18;

int n, m, d;
arr<int, N + M> ps;

arr<int, N + M> ind, rv_ind, vl;
struct Rng {
    int l, r, mn, mx;
    bool operator<(Rng oth) const {
        if (l == oth.l && r == oth.r) assert(false);
        if (l == oth.l) return r < oth.r;
        return l < oth.l;
    }
};

long double gt_ans(int lst) {
    vct<pii> ord;
    for (int i = 1; i <= lst; i++) 
        ord.push_back({ps[i], i});
    sort(ord.begin(), ord.end());

    fill(ind.begin(), ind.end(), 0);
    fill(vl.begin(), vl.end(), 0);
    fill(rv_ind.begin(), rv_ind.end(), 0);
    for (int i = 0; i < ord.size(); i++) {
        ind[ord[i].sec] = i + 1, rv_ind[i + 1] = ord[i].sec;
        vl[i + 1] = ord[i].fir - i * d;
    }

    Rng rng = {0, 0, INF, -INF};
    long double ans = 0;
    for (int i = 1; i <= n + m; i++) {
        if (rv_ind[i] == 0) continue;
        if (vl[i] > rng.mx) {
            if (rng.l != 0) { rng.r = i - 1; }
            rng = {i, 0, vl[i], vl[i]};
        }
        rng.mn = min(rng.mn, vl[i]);
        ans = max(ans, (rng.mx - rng.mn) / (long double) 2);
    }
    return ans;
}

signed main() {
    // freopen("ms.in", "r", stdin);
    cin >> n >> m >> d; 
    for (int i = 1; i <= n + m; i++) cin >> ps[i];

    for (int i = n + 1; i <= n + m; i++) cout << gt_ans(i) << " ";
    cout << endl;
}

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

Main.cpp: In function 'long double gt_ans(long long int)':
Main.cpp:33:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int i = 0; i < ord.size(); i++) {
      |                     ~~^~~~~~~~~~~~

• Subtask 1: 0 / 10
• Subtask 2: 0 / 14
• Subtask 3: 0 / 35
• Subtask 4: 0 / 41