Submission #145569

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
145569	2019-08-20T12:07:22 Z	shashwatchandra	Bob (COCI14_bob)	C++17	24 / 120	630 ms	22884 KB

bob

/*input
5 3
2 2 2
2 2 1
1 1 1
2 1 2
1 2 1
*/
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define pb push_back
#define REP(i,n)for(int i = 0;i < n;i++)
#define RE(i,n) for(int i = 1;i <= n;i++)
#define f first
#define s second
#define pii pair<int,int> 

const int N = 1001;
int a[N][N];
int eq[N][N];
int seg[4*N];
int lazy[4*N];
bool zero[4*N];
int n,m;

#define child 2*node
#define mid (l+r)/2

inline void pushdown(int node,int l,int r,bool wow = 1){
	if(zero[node]){
		seg[node] = 0;
		lazy[node] = 0;
		if(l != r){
			zero[child] = 1;
			zero[child+1] = 1;
			if(wow){
				pushdown(child,l,mid,0);
				pushdown(child+1,mid+1,r,0);
			}
		}
		zero[node] = 0;	
	}
	if(wow and l!= r){
		pushdown(child,l,mid,0);
		pushdown(child+1,mid+1,r,0);
	}
}

void assign(int node,int l,int r,int start,int end){
	pushdown(node,l,r);
	if(start > r or l > end)return;
	if(start <= l and r <= end){
		zero[node] = 1;
		pushdown(node,l,r);
		return;
	}
	assign(child,l,mid,start,end);
	assign(child+1,mid+1,r,start,end);
	seg[node] = seg[child]+seg[child+1];
}

void add(int node,int l,int r,int start,int end){
	pushdown(node,l,r);
	if(lazy[node] != 0){
		seg[node] += (r-l+1)*lazy[node];
		if(l != r){
			lazy[child] += lazy[node];
			lazy[child+1] += lazy[node];
		}
		lazy[node] = 0;
	}
	if(start > r or l > end)return;
	if(start <= l and r <= end){
		lazy[node]++;
		seg[node] += (r-l+1)*lazy[node];
		if(l != r){
			lazy[child] += lazy[node];
			lazy[child+1] += lazy[node];
		}
		lazy[node] = 0;
		return;
	}
	add(child,l,mid,start,end);
	add(child+1,mid+1,r,start,end);
	seg[node] = seg[child]+seg[child+1];
}

void print(int node,int l,int r){
		cout << "FOR : " << node << " " << l << " " << r << endl;
		cout << seg[node] << " " << lazy[node] << " " << zero[node] << endl;
		if(l == r)return;
		print(child,l,mid);
		print(child+1,mid+1,r);
	
}



void solve(){
	cin >> n >> m;
	RE(i,n){
		RE(j,m)cin >> a[i][j];
	}
	RE(i,n){
		int ind = 1;
		RE(j,m){
			if(a[i][j] != a[i][ind]){
				ind = j;
			}
			eq[i][j] = ind;
		}
	}
	int ans = 0;
	RE(col,m){
		RE(row,n){
			if(a[row][col] != a[row-1][col]){
				assign(1,1,m,1,m);
			}
			if(eq[row][col] != 0)assign(1,1,m,1,eq[row][col]-1);
			//for(int i = 1;i < eq[row][col];i++)seg[i] = 0;
			add(1,1,m,eq[row][col],col);
			ans += seg[1];
		}
	}
	cout << ans;
}

signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	solve();
}

Subtask #1

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 ms	760 KB	Output is correct

Subtask #2

12.0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	760 KB	Output is correct

Subtask #3

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	142 ms	8828 KB	Output isn't correct

Subtask #4

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	148 ms	9248 KB	Output isn't correct

Subtask #5

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	140 ms	9400 KB	Output isn't correct

Subtask #6

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	134 ms	9464 KB	Output isn't correct

Subtask #7

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	581 ms	22884 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #8

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	630 ms	20564 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #9

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	608 ms	19364 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #10

0 / 12.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	626 ms	19532 KB	Output isn't correct
2	Halted	0 ms	0 KB	-