oj.uz

답안 #404101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404101 2021-05-13T18:50:05 Z errorgorn 조개 줍기 (KOI17_shell) C++17
100 / 100
 663 ms 34420 KB 
//雪花飄飄北風嘯嘯
//天地一片蒼茫

#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());

struct node{
	int tree[3005];
	int buf=1500;
	
	node (){
		memset(tree,0,sizeof(tree));
	}
	
	void update(int i,int j,int k){
		i+=buf,j+=buf+1;
		
		for (;i<j;i>>=1,j>>=1){
			if (i&1){
				tree[i]+=k;
				i++;
			}
			if (j&1){
				tree[j-1]+=k;
				j--;
			}
		}
	}
	
	int query(int i){
		i+=buf;
		int res=0;
		while (i){
			res+=tree[i];
			i>>=1;
		}
		
		return res;
	}
} *root[1505];

int n;
int arr[1505][1505];

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,0,1505) root[x]=new node();
	
	ll ans=0;
	rep(x,1,n+1) rep(y,1,n+1){
		int temp=max(root[x]->query(y-1),root[x-1]->query(y))+arr[x][y];
		root[x]->update(y,y,temp);
		ans+=temp;
	}
	
	cout<<ans<<endl;
	
	char c;
	int a,b;
	
	rep(x,0,n){
		cin>>c>>a>>b;
		
		if (c=='U'){
			arr[a][b]++;
			
			int l=b,r=b;
			rep(y,a,n+1){
				while (r!=n && root[y]->query(r)+arr[y][r+1]==root[y]->query(r+1)){
					r++;
				}
				while (l<=r && root[y]->query(l)==
					max(root[y-1]->query(l),root[y]->query(l-1))+arr[y][l]){
						
					l++;
				}
				if (r<l) break;
				
				root[y]->update(l,r,1);
				ans+=(r-l+1);
			}
		}
		else{
			arr[a][b]--;
			
			int l=b,r=b;
			rep(y,a,n+1){
				while (r!=n && root[y-1]->query(r+1)+arr[y][r+1]!=root[y]->query(r+1)){
					r++;
				}
				while (l<=r && root[y]->query(l)==
					max(root[y-1]->query(l),root[y]->query(l-1))+arr[y][l]){
						
					l++;
				}
				
				if (r<l) break;
				root[y]->update(l,r,-1);
				ans-=(r-l+1);
			}
		}
		
		cout<<ans<<endl;
	}
}

Subtask #1
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 18380 KB Output is correct
2 Correct 10 ms 18476 KB Output is correct
3 Correct 11 ms 18480 KB Output is correct
4 Correct 11 ms 18444 KB Output is correct
5 Correct 11 ms 18508 KB Output is correct
6 Correct 11 ms 18380 KB Output is correct
7 Correct 10 ms 18380 KB Output is correct
8 Correct 10 ms 18380 KB Output is correct
9 Correct 11 ms 18508 KB Output is correct
10 Correct 10 ms 18508 KB Output is correct

Subtask #2
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 215 ms 26948 KB Output is correct
2 Correct 209 ms 26832 KB Output is correct
3 Correct 213 ms 26868 KB Output is correct
4 Correct 200 ms 26992 KB Output is correct
5 Correct 203 ms 26924 KB Output is correct
6 Correct 209 ms 26820 KB Output is correct
7 Correct 211 ms 26792 KB Output is correct
8 Correct 203 ms 27080 KB Output is correct
9 Correct 204 ms 26896 KB Output is correct
10 Correct 204 ms 26804 KB Output is correct

Subtask #3
54.0 / 54.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 18380 KB Output is correct
2 Correct 10 ms 18476 KB Output is correct
3 Correct 11 ms 18480 KB Output is correct
4 Correct 11 ms 18444 KB Output is correct
5 Correct 11 ms 18508 KB Output is correct
6 Correct 11 ms 18380 KB Output is correct
7 Correct 10 ms 18380 KB Output is correct
8 Correct 10 ms 18380 KB Output is correct
9 Correct 11 ms 18508 KB Output is correct
10 Correct 215 ms 26948 KB Output is correct
11 Correct 209 ms 26832 KB Output is correct
12 Correct 213 ms 26868 KB Output is correct
13 Correct 200 ms 26992 KB Output is correct
14 Correct 203 ms 26924 KB Output is correct
15 Correct 209 ms 26820 KB Output is correct
16 Correct 211 ms 26792 KB Output is correct
17 Correct 203 ms 27080 KB Output is correct
18 Correct 204 ms 26896 KB Output is correct
19 Correct 204 ms 26804 KB Output is correct
20 Correct 10 ms 18508 KB Output is correct
21 Correct 266 ms 26888 KB Output is correct
22 Correct 244 ms 26960 KB Output is correct
23 Correct 247 ms 26944 KB Output is correct
24 Correct 651 ms 26876 KB Output is correct
25 Correct 637 ms 34372 KB Output is correct
26 Correct 635 ms 34396 KB Output is correct
27 Correct 209 ms 31236 KB Output is correct
28 Correct 217 ms 31420 KB Output is correct
29 Correct 255 ms 34316 KB Output is correct
30 Correct 253 ms 34216 KB Output is correct
31 Correct 640 ms 34312 KB Output is correct
32 Correct 663 ms 34420 KB Output is correct
33 Correct 210 ms 31300 KB Output is correct
34 Correct 204 ms 31200 KB Output is correct