Submission #1103856

#	Time	Username	Problem	Language	Result	Execution time	Memory
1103856		RiverFlow	Fish 3 (JOI24_fish3)	C++14	0 / 100	2069 ms	10064 KiB

Main

#include <bits/stdc++.h>

#define nl "\n"
#define no "NO"
#define yes "YES"
#define fi first
#define se second
#define vec vector
#define task "main"
#define _mp make_pair
#define ii pair<int, int>
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define evoid(val) return void(std::cout << val)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
#define unq(x) sort(all(x)); x.resize(unique(all(x)) - x.begin())

using namespace std;

template<typename U, typename V> bool maxi(U &a, V b) {
    if (a < b) { a = b; return 1; } return 0;
}
template<typename U, typename V> bool mini(U &a, V b) {
    if (a > b) { a = b; return 1; } return 0;
}

const int N = (int)2e5 + 9;
const int mod = (int)1e9 + 7;

void prepare(); void main_code();

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    if (fopen(task".inp", "r")) {
        freopen(task".inp", "r", stdin);
        freopen(task".out", "w", stdout);
    }
    const bool MULTITEST = 0; prepare();
    int num_test = 1; if (MULTITEST) cin >> num_test;
    while (num_test--) { main_code(); }
}

void prepare() {};

long long a[N], b[N], s[N], c[N];

void main_code() {
    int n, d; cin >> n >> d;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i], b[i] = a[i] % d;
        s[i] = s[i - 1] + b[i];
//        cout << a[i] << ' ' << b[i] << ' ' << s[i] << nl;
    }

    // luong bo them min chinh la sum b[i]
    // if(a[i]<b[i]) -> khong ton tai thoi
    // (b[i]-b[l-1])<=a[i]
    // b[i] - a[i] <= b[l - 1]
    // neu MAX trong doan (l, r) <= b[l - 1] thi con ok
    // luc day ta co the ach sum a[i]/d
    // it nhat
    // xet L, ta co the giam di min(a[l]...a[r])/d
    // xet L+1 -> vi ta da giam di min(a[l]..a[r])/d
    // bay h ta giam them min(a[l+1]...a[r])-min(a[l]...a[r])
    // tai nhung vi tri ma min tang len
    int q; cin >> q;
    FOR(i, 1, n) c[i] = a[i];
    while (q--) {
        int l, r; cin >> l >> r;
        bool ok = 1;
        FOR(i, l, r) a[i] = c[i];
        long long rem = 0;
        FOR(i, l, r) {
            if (rem != b[i]) {
                rem += (b[i] - rem % d + d) % d;
            }
            if (rem > a[i]) {
                ok = 0;
                break ;
            }
            a[i] -= rem;
        }
        if (!ok) {
            cout << -1 << nl;
        } else {
            long long ans = 0;
            long long re = 0;
            long long lst = 0;
            FOR(i, l, r) {
                long long mi=a[i];
                FOR(j, i, r) {
                    mini(mi, a[j]);
                }
                re += mi - lst;
                lst = mi;
                ans += (a[i] - re) / d;
            }
            cout << ans << nl;
        }
    }
}


/*     Let the river flows naturally     */

Compilation message (stderr)

Main.cpp: In function 'int main()':
Main.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(task".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         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