# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
144044 |
2019-08-15T19:21:48 Z |
Ort |
Automobil (COCI17_automobil) |
Python 3 |
|
923 ms |
3812 KB |
def gauss(fr,to,nums):
return ((fr+to)*nums)//2
def val(y,x):
return (y-1)*m + x
n, m, k = map(int,input().split());
def main():
Mr = dict();
Mc = dict();
for i in range(k):
c, x, y = map(str, input().split())
x = int(x); y = int(y);
if(c=='R'):
try: Mr[x]*=y
except KeyError: Mr[x]=y
if(c=='S'):
try: Mc[x]*=y
except KeyError: Mc[x]=y
upd_r = list(Mr.items())
upd_c = list(Mc.items())
upd_r.sort(); upd_c.sort();
sol = 0;
sum_w = 0;
for col, col_up in upd_c:
last_row = 1;
for row, row_up in upd_r:
if(row==last_row):
c = val(row,col);
sol = sol + (c*row_up*col_up);
sum_w = sum_w + c;
last_row = row+1;
continue;
elif(row==last_row+1):
c = val(last_row,col);
sol = sol + (c*col_up);
sum_w = sum_w+c;
last_row = row+1;
else:
cl = val(last_row, col);
ch = val(row-1, col);
sum_range = gauss(cl,ch,row-last_row);
mult_range = sum_range * col_up;
sol = sol + mult_range;
sum_w = sum_w + sum_range;
last_row = row+1;
c = val(row,col);
sol = sol + (c*col_up*row_up);
sum_w = sum_w + c;
last_row = row + 1;
if(last_row>n):
continue;
elif(last_row==n):
c = val(n, col);
sol = sol + (c*col_up);
sum_w = sum_w+c;
else:
cl = val(last_row, col);
ch = val(n, col);
sum_range = gauss(cl,ch,n-last_row+1);
mult_range = sum_range*col_up
sol = sol+mult_range
sum_w = sum_w+sum_range
for row, row_up in upd_r:
last_col = 1;
for col, col_up in upd_c:
if(last_col==col):
last_col = col+1;
continue;
elif(col==last_col+1):
c = val(row, last_col);
sol = sol + (c*row_up);
sum_w = sum_w + c;
last_col = col+1;
continue;
else:
cl = val(row, last_col)
ch = val(row,col-1)
sum_range = gauss(cl,ch,col-last_col)
mult_range = sum_range * row_up
sol = sol + mult_range;
sum_w = sum_w + sum_range
last_col = col+1;
if(last_col>m):
continue;
elif(last_col==m):
c = val(row, m);
sol = sol + (c*row_up);
sum_w = sum_w+c;
else:
cl = val(row,last_col);
ch = val(row,m);
sum_range = gauss(cl,ch,m-last_col+1);
mult_range = sum_range * row_up;
sol = sol + mult_range;
sum_w = sum_w + sum_range;
t = n * m;
total_no_update = (t*(t+1))//2
res = total_no_update - sum_w;
sol = sol+res;
print(sol%1000000007)
main()
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
41 ms |
3684 KB |
Output is correct |
2 |
Correct |
132 ms |
3556 KB |
Output is correct |
3 |
Correct |
35 ms |
3556 KB |
Output is correct |
4 |
Correct |
51 ms |
3556 KB |
Output is correct |
5 |
Correct |
125 ms |
3556 KB |
Output is correct |
6 |
Correct |
64 ms |
3556 KB |
Output is correct |
7 |
Correct |
175 ms |
3684 KB |
Output is correct |
8 |
Correct |
76 ms |
3556 KB |
Output is correct |
9 |
Correct |
142 ms |
3684 KB |
Output is correct |
10 |
Correct |
198 ms |
3812 KB |
Output is correct |
11 |
Correct |
304 ms |
3684 KB |
Output is correct |
12 |
Correct |
848 ms |
3684 KB |
Output is correct |
13 |
Correct |
202 ms |
3556 KB |
Output is correct |
14 |
Correct |
30 ms |
3556 KB |
Output is correct |
15 |
Correct |
606 ms |
3688 KB |
Output is correct |
16 |
Correct |
920 ms |
3692 KB |
Output is correct |
17 |
Correct |
915 ms |
3812 KB |
Output is correct |
18 |
Correct |
917 ms |
3812 KB |
Output is correct |
19 |
Correct |
923 ms |
3812 KB |
Output is correct |
20 |
Correct |
902 ms |
3684 KB |
Output is correct |