Submission #886872

#	Time	Username	Problem	Language	Result	Execution time	Memory
886872		ndosh	Nuclearia (CEOI15_nuclearia)	C++17	0 / 100	177 ms	61236 KiB

nuclearia

#include<bits/stdc++.h>
using namespace std;
#define int long long
int w, h, n, q, p[2500005], s[2500005], pre[2500005];

signed main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    cin >> w >> h >> n;
    for (int i = 1; i <= n; i++){
        int x, y, a, b;
        cin >> x >> y >> a >> b;
        int num =  a/b + 1;
        if (num == 1){
            s[x] += a;
            s[x+1] -= a;
            continue;
        }
        if ((x - num + 1) < (int)1){
            s[1] += a - b*(x-1);
            s[2] -= (a - b*(x-1));
            s[2] += b;
            s[x+1] -= b;
        }
        else{
            s[x-num+1] += a%b;
            s[x-num+2] -= a%b;
            s[x-num+2] += b;
            s[x+1] -= b;
        }
        s[x+1] -= b;
        if (x + num <= w){
            s[x + num] += b - a%b;
            s[x+num+1] += a%b;
        }
    }
    int cur = 0;
    for (int i = 1; i <= w; i++){
        cur += s[i];
        p[i] = p[i-1] + cur;
        pre[i] = pre[i-1] + p[i];
    }
    cin >> q;
    for (int i = 1; i <= q; i++){
        int x, skillissue, y, skillissue2;
        cin >> x >> skillissue >> y >> skillissue2;
        int sm = pre[y] - pre[x-1];
        int d = y-x+1;
        long double ans = (long double)sm/d;
        cout << (int)(round(ans));
    }
}

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