oj.uz

Submission #886881

# Submission time Handle Problem Language Result Execution time Memory
886881 2023-12-13T06:12:04 Z ndosh Nuclearia (CEOI15_nuclearia) C++17
0 / 100
 157 ms 65104 KB 
#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;
        int ans = sm/d;
        if (d%2){
            if (sm%d > d/2){
                ans++;
            }
        }
        else{
            if (sm%d >= d/2){
                ans++;
            }
        }
        cout << ans;
    }
}

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 13 ms 41808 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 45916 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 2396 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 2.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 84 ms 45608 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 66 ms 25616 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Incorrect 53 ms 4596 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #8
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 55 ms 13460 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #9
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 157 ms 65080 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 143 ms 65104 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 98 ms 8540 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 94 ms 6340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #13
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 96 ms 6356 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 95 ms 8420 KB Output isn't correct
2 Halted 0 ms 0 KB -