# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49498 | leejseo | 조개 줍기 (KOI17_shell) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int N, A[1501][1501], DP[1501][1501];
void init(){
scanf("%d", &N);
for (int i=0; i<N; i++){
for (int j=0; j<N; j++){
scanf("%d", &A[i][j]);
}
}
}
long long query(bool tf){
if (tf){
char a;
int i, j;
scanf("%c%d%d", &a, &i, &j);
A[i][j] += (a == 'U'? 1 : -1);
}
long long s;
for (int i=0; i<N; i++){
for (int j=0; j<N; j++){
DP[i][j] = A[i][j] + (i == 0? (j == 0? 0 : DP[i][j-1]) : (j == 0? DP[i-1][j] : max(DP[i-1][j], DP[i][j-1])));
s += DP[i][j]
}
}
return s;
}
int main(void){
init();
printf("%lld\n", query(false));
for (int i=0; i<N; i++) printf("%lld\n", query(true));
}