oj.uz

Submission #642457

# Submission time Handle Problem Language Result Execution time Memory
642457 2022-09-19T13:38:25 Z jamezzz Sandcastle 2 (JOI22_ho_t5) C++17
100 / 100
 1616 ms 442608 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#ifdef DEBUG
#define getchar_unlocked getchar
#endif
#define sf scanf
#define pf printf
#define pb push_back
#define all(x) x.begin(),x.end()
#define lb(x,v) (lower_bound(all(x),v)-x.begin())
#define disc(x) sort(all(x));x.resize(unique(all(x))-x.begin());
typedef vector<int> vi;

inline int rd(){
	int x=0;
	char ch=getchar_unlocked();
	while(!(ch&16))ch=getchar();//keep reading while current character is whitespace
    while(ch&16){//this will break when ‘\n’ or ‘ ‘ is encountered
		x=(x<<3)+(x<<1)+(ch&15);
		ch=getchar_unlocked();
	}
	return x;
}

#define maxn 50005

int h,w;
map<int,int> cnt;
int dx[4]={-1,1,0,0},dy[4]={0,0,-1,1};//UDLR
vi vals;
vector<vi> a;
vector<vector<vi>> d;
vector<vector<vector<vi>>> sm;

int main(){
	h=rd(),w=rd();
	a.resize(h);
	for(int i=0;i<h;++i){
		a[i].resize(w);
		for(int j=0;j<w;++j){
			a[i][j]=rd();
			vals.pb(a[i][j]);
		}
	}
	disc(vals);
	for(int i=0;i<h;++i){
		for(int j=0;j<w;++j)a[i][j]=lb(vals,a[i][j])+1;
	}
	if(h<w){
		vector<vi> b;
		b.resize(w);
		for(int i=0;i<w;++i)b[i].resize(h);
		for(int i=0;i<h;++i){
			for(int j=0;j<w;++j)b[j][i]=a[i][j];
		}
		swap(h,w);swap(a,b);
	}
	d.resize(h);
	for(int i=0;i<h;++i){
		d[i].resize(w);
		for(int j=0;j<w;++j){
			d[i][j].resize(16);
		}
	}
	for(int i=0;i<h;++i){
		for(int j=0;j<w;++j){
			for(int msk=0;msk<16;++msk){
				bool valid=true;
				vector<int> v={0};
				for(int k=0;k<4;++k){
					if(msk&(1<<k))continue;
					int ni=i+dx[k],nj=j+dy[k];
					if(ni<0||nj<0||ni>=h||nj>=w){
						valid=false;continue;
					}
					v.pb(a[ni][nj]);
				}
				if(!valid){
					d[i][j][msk]=-1;
					continue;
				}
				sort(all(v));
				int id=lb(v,a[i][j])-1;
				d[i][j][msk]=a[i][j]-v[id];
				if(id==v.size()-1)d[i][j][msk]+=h*w+1-a[i][j];
			}
		}
	}
	sm.resize(h);
	for(int i=0;i<h;++i){
		sm[i].resize(w);
		vector<vi> pfx;
		pfx.resize(w);
		for(int j=0;j<w;++j){
			pfx[j].resize(4);
			pfx[j][0]=d[i][j][0];//both open
			pfx[j][1]=d[i][j][1];//top close
			pfx[j][2]=d[i][j][2];//bottom close
			pfx[j][3]=d[i][j][1+2];//both close
			if(j==0)continue;
			for(int k=0;k<4;++k)pfx[j][k]+=pfx[j-1][k];
		}
		for(int j=0;j<w;++j){
			sm[i][j].resize(w);
			for(int k=j;k<w;++k){
				sm[i][j][k].resize(4);
				if(j==k){
					sm[i][j][k][0]=d[i][j][4+8];//both open
					sm[i][j][k][1]=d[i][j][1+4+8];//top close
					sm[i][j][k][2]=d[i][j][2+4+8];//bottom close
					sm[i][j][k][3]=d[i][j][1+2+4+8];//both close
				}
				else{
					sm[i][j][k][0]=d[i][j][4]+d[i][k][8];//both open
					sm[i][j][k][1]=d[i][j][1+4]+d[i][k][1+8];//top close
					sm[i][j][k][2]=d[i][j][2+4]+d[i][k][2+8];//bottom close
					sm[i][j][k][3]=d[i][j][1+2+4]+d[i][k][1+2+8];//both close
					if(j+1==k)continue;
					for(int l=0;l<4;++l)sm[i][j][k][l]+=pfx[k-1][l]-pfx[j][l];
				}
			}
		}
	}
	int ans=0;
	for(int i=0;i<w;++i){
		for(int j=i;j<w;++j){
			int offset=0;
			for(int k=0;k<h;++k){
				if(sm[k][i][j][3]==h*w+1)++ans;
				if(sm[k][i][j][2]!=-1){
					int goal=h*w+1-sm[k][i][j][2];
					if(cnt.find(goal-offset)!=cnt.end())ans+=cnt[goal-offset];
				}
				if(sm[k][i][j][0]!=-1)offset+=sm[k][i][j][0];
				int add=sm[k][i][j][1];
				if(cnt.find(add-offset)==cnt.end())cnt[add-offset]=0;
				++cnt[add-offset];
			}
			cnt.clear();
		}
	}
	pf("%d\n",ans);
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:90:10: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     if(id==v.size()-1)d[i][j][msk]+=h*w+1-a[i][j];
      |        ~~^~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 77 ms 15640 KB Output is correct
3 Correct 115 ms 18136 KB Output is correct
4 Correct 102 ms 16024 KB Output is correct
5 Correct 80 ms 16144 KB Output is correct
6 Correct 97 ms 17648 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 11 ms 2548 KB Output is correct
10 Correct 5 ms 2260 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 8 ms 2644 KB Output is correct
14 Correct 6 ms 1748 KB Output is correct
15 Correct 7 ms 2264 KB Output is correct
16 Correct 9 ms 2260 KB Output is correct

Subtask #4
56.0 / 56.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 11 ms 2548 KB Output is correct
10 Correct 5 ms 2260 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 8 ms 2644 KB Output is correct
14 Correct 6 ms 1748 KB Output is correct
15 Correct 7 ms 2264 KB Output is correct
16 Correct 9 ms 2260 KB Output is correct
17 Correct 11 ms 2432 KB Output is correct
18 Correct 57 ms 15268 KB Output is correct
19 Correct 26 ms 4820 KB Output is correct
20 Correct 41 ms 22820 KB Output is correct
21 Correct 72 ms 23696 KB Output is correct
22 Correct 72 ms 23752 KB Output is correct
23 Correct 67 ms 22988 KB Output is correct
24 Correct 57 ms 16644 KB Output is correct
25 Correct 66 ms 21036 KB Output is correct
26 Correct 69 ms 22252 KB Output is correct
27 Correct 83 ms 21128 KB Output is correct
28 Correct 85 ms 22152 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 4 ms 724 KB Output is correct
8 Correct 3 ms 724 KB Output is correct
9 Correct 11 ms 2548 KB Output is correct
10 Correct 5 ms 2260 KB Output is correct
11 Correct 3 ms 724 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 8 ms 2644 KB Output is correct
14 Correct 6 ms 1748 KB Output is correct
15 Correct 7 ms 2264 KB Output is correct
16 Correct 9 ms 2260 KB Output is correct
17 Correct 11 ms 2432 KB Output is correct
18 Correct 57 ms 15268 KB Output is correct
19 Correct 26 ms 4820 KB Output is correct
20 Correct 41 ms 22820 KB Output is correct
21 Correct 72 ms 23696 KB Output is correct
22 Correct 72 ms 23752 KB Output is correct
23 Correct 67 ms 22988 KB Output is correct
24 Correct 57 ms 16644 KB Output is correct
25 Correct 66 ms 21036 KB Output is correct
26 Correct 69 ms 22252 KB Output is correct
27 Correct 83 ms 21128 KB Output is correct
28 Correct 85 ms 22152 KB Output is correct
29 Correct 80 ms 15636 KB Output is correct
30 Correct 502 ms 106864 KB Output is correct
31 Correct 1495 ms 419628 KB Output is correct
32 Correct 95 ms 15944 KB Output is correct
33 Correct 859 ms 442608 KB Output is correct
34 Correct 1507 ms 442544 KB Output is correct
35 Correct 652 ms 170144 KB Output is correct
36 Correct 1038 ms 254972 KB Output is correct
37 Correct 1611 ms 435004 KB Output is correct
38 Correct 1474 ms 434952 KB Output is correct
39 Correct 1560 ms 435004 KB Output is correct
40 Correct 1532 ms 435008 KB Output is correct
41 Correct 1566 ms 435112 KB Output is correct
42 Correct 1512 ms 434956 KB Output is correct
43 Correct 1616 ms 434992 KB Output is correct
44 Correct 1512 ms 435000 KB Output is correct