Submission #403467

#	Time	Username	Problem	Language	Result	Execution time	Memory
403467		errorgorn	조개 줍기 (KOI17_shell)	C++17	46 / 100	2088 ms	18884 KiB

shell

//雪花飄飄北風嘯嘯
//天地一片蒼茫

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll,ll>
#define iii pair<ii,ll>
#define fi first
#define se second
#define endl '\n'
#define debug(x) cout << #x << " is " << x << endl

#define pub push_back
#define pob pop_back
#define puf push_front
#define pof pop_front
#define lb lower_bound
#define ub upper_bound

#define rep(x,start,end) for(auto x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()

#define indexed_set tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>
//change less to less_equal for non distinct pbds, but erase will bug

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());

int n;
int arr[1505][1505];
int brr[1505][1505];
ll ans=0;

void dfs(int i,int j){
	if (i!=n){
		int temp=max(brr[i][j],brr[i+1][j-1])+arr[i+1][j];
		if (brr[i+1][j]!=temp){
			ans-=brr[i+1][j];
			ans+=temp;
			brr[i+1][j]=temp;
			dfs(i+1,j);
		}
	}
	if (j!=n){
		int temp=max(brr[i][j],brr[i-1][j+1])+arr[i][j+1];
		if (brr[i][j+1]!=temp){
			ans-=brr[i][j+1];
			ans+=temp;
			brr[i][j+1]=temp;
			dfs(i,j+1);
		}
	}
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin.exceptions(ios::badbit | ios::failbit);
	
	cin>>n;
	rep(x,1,n+1) rep(y,1,n+1) cin>>arr[x][y];
	rep(x,1,n+1) rep(y,1,n+1) {
		brr[x][y]=max(brr[x-1][y],brr[x][y-1])+arr[x][y];
		ans+=brr[x][y];
	}
	cout<<ans<<endl;
	
	char c;
	int a,b;
	
	rep(x,0,n){
		cin>>c>>a>>b;
		
		if (c=='U'){
			arr[a][b]++;
			brr[a][b]++;
			ans++;
		}
		else{
			arr[a][b]--;
			brr[a][b]--;
			ans--;
		}
		
		dfs(a,b);
		
		cout<<ans<<endl;
	}
}

• Subtask 1: 12 / 12
• Subtask 2: 34 / 34
• Subtask 3: 0 / 54