oj.uz

Submission #386931

# Submission time Handle Problem Language Result Execution time Memory
386931 2021-04-07T16:20:04 Z FatihSolak Nuclearia (CEOI15_nuclearia) C++17
42 / 100
 1000 ms 237548 KB 
#include <bits/stdc++.h>
using namespace std;
int main(){
    #ifdef Local
    freopen("in.txt","r",stdin);
    freopen("out.txt","w",stdout);
    #endif
    bool swp = 0;
    int w,h;
    scanf("%d %d",&w,&h);
    if(w < h){
        swp = 1;
        swap(w,h);
    }
    long long arr[h+5][2*h+w+5];
    long long pre[h+5][2*h+w+5];
    for(int i=0;i<h+5;i++){
        for(int j = 0;j<2*h+w+5;j++){
            arr[i][j] = pre[i][j] = 0;
        }
    }    
    int n;
    scanf("%d ",&n);
    for(int i=0;i<n;i++){
        int x,y,a,b;
        scanf("%d %d %d %d",&x,&y,&a,&b);
        if(swp)swap(x,y);
        x += 2*h;
        for(int i=1;i<=h;i++){
            int dif = abs(y-i);
            if(dif * b >= a)continue;

            arr[i][max(1,x-dif+1)] -= b;
            arr[i][max(1,x-(a/b))] += b;
            arr[i][max(1,x-(a/b))] += a - b*(x - max(1,x-(a/b)) + 1);
            arr[i][max(1,x-(a/b)) + 1] -= a - b*(x - max(1,x-(a/b)) + 1);

            arr[i][min(w+2*h+1,x+dif+1)] -= b;
            arr[i][min(w+2*h+1,x+(a/b)+1)] += b;
            arr[i][min(w+2*h+1,x+(a/b)+1)] -= a%b;
            arr[i][min(w+2*h+1,x+(a/b)+2)] += a%b;
        }
    }
    for(int i=1;i<=h;i++){
        for(int j=1;j<=w+2*h;j++){
            arr[i][j] += arr[i][j-1];
        }
        for(int j=1;j<=w+2*h;j++){
            arr[i][j] += arr[i][j-1];
            //cout << arr[i][j] << " ";
        }
        //cout << endl;
    }
    for(int i=1;i<=h;i++){
        for(int j=2*h+1;j<=w+2*h;j++){
            pre[i][j] = pre[i-1][j] + pre[i][j-1] - pre[i-1][j-1]+arr[i][j];
        }
    }
    int q;
    scanf("%d",&q);
    while(q--){
        int x1,y1,x2,y2;
        scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
        if(!swp)swap(x1,y1),swap(x2,y2);
        y1 += 2*h;
        y2 += 2*h;
        long double cnt = (x2-x1+1) * (y2 -y1+1);
        long long x = ((pre[x2][y2] - pre[x2][y1-1] - pre[x1 -1][y2] + pre[x1-1][y1-1])/cnt + 0.5);
        printf("%lld\n",x);
    }
}

Compilation message

nuclearia.cpp: In function 'int main()':
nuclearia.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |     scanf("%d %d",&w,&h);
      |     ~~~~~^~~~~~~~~~~~~~~
nuclearia.cpp:23:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   23 |     scanf("%d ",&n);
      |     ~~~~~^~~~~~~~~~
nuclearia.cpp:26:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   26 |         scanf("%d %d %d %d",&x,&y,&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
nuclearia.cpp:60:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   60 |     scanf("%d",&q);
      |     ~~~~~^~~~~~~~~
nuclearia.cpp:63:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   63 |         scanf("%d %d %d %d",&x1,&y1,&x2,&y2);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 163 ms 235116 KB Output is correct
2 Correct 93 ms 2796 KB Output is correct
3 Correct 84 ms 2284 KB Output is correct

Subtask #2
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 160 ms 235116 KB Output is correct
2 Correct 91 ms 2796 KB Output is correct

Subtask #3
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 47724 KB Output is correct
2 Incorrect 87 ms 2796 KB Output isn't correct

Subtask #4
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 49304 KB Output is correct
2 Correct 92 ms 2796 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 297 ms 237316 KB Output is correct
2 Correct 100 ms 3052 KB Output is correct

Subtask #6
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 203 ms 96620 KB Output is correct
2 Correct 101 ms 2924 KB Output is correct

Subtask #7
0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 187 ms 50284 KB Output is correct
2 Incorrect 101 ms 2924 KB Output isn't correct

Subtask #8
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 177 ms 57452 KB Output is correct
2 Incorrect 89 ms 2668 KB Output isn't correct

Subtask #9
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 406 ms 237548 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 409 ms 237548 KB Output is correct

Subtask #11
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 47724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1085 ms 71148 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #13
0 / 12.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1098 ms 41580 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #14
0 / 8.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1101 ms 47724 KB Time limit exceeded
2 Halted 0 ms 0 KB -