제출 #1165329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1165329		duyngadocton77	Fish 3 (JOI24_fish3)	C++20	0 / 100	250 ms	99760 KiB

Main

#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define task "fish3"

using ll = long long;
using ii = pair<int,int>;
using iii = pair<ii,int>;
const int MAX = (int) 3e5;

int n, D, Q;
int a[MAX + 5];
int cost[MAX + 5];
int prefix[MAX + 5];
ll sum[MAX + 5][25];
int rmq[MAX + 5][25];
int r[MAX + 5], p[MAX + 5], q[MAX + 5];
int sub[MAX + 5];
int pre[MAX + 5];
int s[MAX + 5];

int main() {
    ios::sync_with_stdio(0);
    cin.tie(NULL);cout.tie(NULL);
    if(fopen(task".inp","r")) {
        freopen(task".inp","r",stdin);
        freopen(task".out","w",stdout);
    }
    cin >> n >> D;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    cin >> Q;
    for(int i = 1; i <= n; ++i) r[i] = a[i] % D;
    for(int i = 1; i <= n; ++i) sub[i] = sub[i - 1] + (r[i] < r[i - 1]);
    for(int i = 1; i <= n; ++i) p[i] = a[i] / D + sub[i];
    for(int i = 1; i <= n; ++i) q[i] = a[i] / D;
    for(int i = 1; i <= n; ++i) prefix[i] = prefix[i - 1] + q[i];
    for(int i = 1; i <= n; ++i) s[i] = s[i - 1] + sub[i];
//    for(int i = 1; i <= n; ++i) cout << p[i] << " ";cout << '\n';
    for(int i = 1; i <= n; ++i) {
        int j = i - 1;
        while(j >= 1 && p[j] >= p[i]) j = pre[j];
        pre[i] = j;
        rmq[i][0] = j;
        sum[i][0] = 1LL * q[i] * (i - j) - (1LL * sub[i] * (i - j) - (s[i] - s[j]));
    }
    for(int k = 1; (1 << k) <= n; ++k) {
        for(int i = 1; i <= n; ++i) rmq[i][k] = rmq[rmq[i][k - 1]][k - 1], sum[i][k] = sum[i][k - 1] + sum[rmq[i][k - 1]][k - 1];
    }
    while(Q --) {
        int l, r;
        cin >> l >> r;
        int maxk = log2(r) + 1;
        ll ans = 0;
        int R = r;
        for(int k = maxk; k >= 0; --k) if(rmq[r][k] >= l) ans += sum[r][k], r = rmq[r][k];
        int minn = q[r] - sub[r] + sub[l];
        if(minn < 0) {
            cout << "-1\n";
            continue;
        }
        ans = ans + q[r] * (r - l + 1) - (1LL * sub[r] * (r - l + 1) - (s[r] - s[l - 1]));
        cout << prefix[R] - prefix[l - 1] - ans << "\n";
    }
}

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

Main.cpp: In function 'int main()':
Main.cpp:31:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |         freopen(task".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
Main.cpp:32:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   32 |         freopen(task".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 9
• Subtask 2: 0 / 7
• Subtask 3: 0 / 28
• Subtask 4: 0 / 20
• Subtask 5: 0 / 36