제출 #403358

#제출 시각아이디문제언어결과실행 시간메모리
403358zaneyu조개 줍기 (KOI17_shell)C++14
12 / 100
2082 ms28156 KiB
/*input
3

3 2 7

4 2 6

5 3 8

U 1 2

D 3 2

U 1 2
*/
#include<bits/stdc++.h>
using namespace std;
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define ll long long
const int maxn=2e3+5;
int dp[maxn][maxn];
int arr[maxn][maxn];
int n;
void calc(){
    ll ans=0;
    REP1(i,n){
        REP1(j,n){
            dp[i][j]=max(dp[i-1][j],dp[i][j-1])+arr[i][j];
            ans+=dp[i][j];
        }
    }
    cout<<ans<<'\n';
}
int main(){
    cin>>n;
    REP1(i,n) REP1(j,n) cin>>arr[i][j];
    calc();
    REP(i,n){
        char c;
        int x,y;
        cin>>c>>x>>y;
        if(c=='U') arr[x][y]++;
        else arr[x][y]--;
        calc();
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...