oj.uz

Submission #290281

# Submission time Handle Problem Language Result Execution time Memory
290281 2020-09-03T15:17:50 Z TadijaSebez Virus Experiment (JOI19_virus) C++11
100 / 100
 321 ms 20316 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define x first
#define y second
#define mp make_pair
const int N=805;
const int M=200050;
const int inf=1e9+7;
char s[M];
pii p[N][N];
pii Find(int x,int y){return p[x][y]==mp(x,y)?mp(x,y):p[x][y]=Find(p[x][y].x,p[x][y].y);}
bool done[N][N];
void Union(int x1,int y1,int x2,int y2){
	tie(x1,y1)=Find(x1,y1);
	p[x1][y1]=Find(x2,y2);
}
int mxt[1<<4],U[N][N],tme,was[N][N],ans[N][N],mv[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
void Expand(int x,int y){
	queue<pii> q;
	vector<pii> cells;
	tme++;
	q.push({x,y});was[x][y]=tme;
	while(q.size()){
		int x,y;tie(x,y)=q.front();
		cells.pb(q.front());
		q.pop();
		for(int i=0;i<4;i++){
			int nx=x+mv[i][0];
			int ny=y+mv[i][1];
			if(U[nx][ny]==0||was[nx][ny]==tme)continue;
			int mask=0;
			for(int j=0;j<4;j++)if(was[nx+mv[j][0]][ny+mv[j][1]]==tme)mask|=1<<j;
			if(U[nx][ny]<=mxt[mask]){
				if(Find(x,y)!=Find(nx,ny)){
					tie(nx,ny)=Find(nx,ny);
					if(done[nx][ny]){
						tie(x,y)=Find(x,y);
						done[x][y]=1;
					}else Union(x,y,nx,ny);
					return;
				}
				was[nx][ny]=tme;
				q.push({nx,ny});
			}
		}
	}
	tie(x,y)=Find(x,y);
	done[x][y]=1;
	for(pii p:cells)ans[p.x][p.y]=cells.size();
}
int main(){
	int n,m,k;
	scanf("%i %i %i",&k,&n,&m);
	scanf("%s",s+1);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)scanf("%i",&U[i][j]);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)p[i][j]=mp(i,j);
	for(int i=1;i<=k;i++)s[i+k]=s[i];
	k+=k;
	map<char,int> val;
	val['S']=0;
	val['E']=1;
	val['N']=2;
	val['W']=3;
	for(int i=1;i<=k;i++)s[i]=val[s[i]];
	for(int mask=0;mask<1<<4;mask++){
		for(int i=1,len=0;i<=k;i++){
			if(mask>>s[i]&1)len++;
			else len=0;
			mxt[mask]=max(mxt[mask],len);
		}
		if(mxt[mask]==k)mxt[mask]=inf;
	}
	while(1){
		bool ok=0;
		for(int i=1;i<=n;i++){
			for(int j=1;j<=m;j++){
				if(Find(i,j)==mp(i,j)&&!done[i][j]&&U[i][j]){
					Expand(i,j);
					ok=1;
				}
			}
		}
		if(!ok)break;
	}
	int mn=inf,cnt=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(ans[i][j]){
				if(mn>ans[i][j])mn=ans[i][j],cnt=0;
				if(mn==ans[i][j])cnt++;
			}
		}
	}
	printf("%i\n%i\n",mn,cnt);
	return 0;
}

Compilation message

virus.cpp: In function 'int main()':
virus.cpp:55:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   55 |  scanf("%i %i %i",&k,&n,&m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~
virus.cpp:56:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   56 |  scanf("%s",s+1);
      |  ~~~~~^~~~~~~~~~
virus.cpp:57:49: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   57 |  for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)scanf("%i",&U[i][j]);
      |                                            ~~~~~^~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 222 ms 14840 KB Output is correct
3 Correct 236 ms 17144 KB Output is correct
4 Correct 203 ms 14840 KB Output is correct
5 Correct 236 ms 17400 KB Output is correct
6 Correct 5 ms 9472 KB Output is correct
7 Correct 264 ms 15252 KB Output is correct
8 Correct 96 ms 10232 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 500 KB Output is correct
2 Correct 6 ms 800 KB Output is correct
3 Correct 8 ms 768 KB Output is correct
4 Correct 6 ms 768 KB Output is correct
5 Correct 8 ms 640 KB Output is correct
6 Correct 9 ms 1408 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 9 ms 1280 KB Output is correct
9 Correct 2 ms 896 KB Output is correct
10 Correct 7 ms 768 KB Output is correct
11 Correct 2 ms 1024 KB Output is correct
12 Correct 2 ms 1152 KB Output is correct
13 Correct 9 ms 1280 KB Output is correct
14 Correct 8 ms 1152 KB Output is correct
15 Correct 9 ms 1152 KB Output is correct
16 Correct 9 ms 1328 KB Output is correct
17 Correct 6 ms 1280 KB Output is correct
18 Correct 2 ms 1024 KB Output is correct
19 Correct 9 ms 1408 KB Output is correct

Subtask #3
80.0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 640 KB Output is correct
2 Correct 222 ms 14840 KB Output is correct
3 Correct 236 ms 17144 KB Output is correct
4 Correct 203 ms 14840 KB Output is correct
5 Correct 236 ms 17400 KB Output is correct
6 Correct 5 ms 9472 KB Output is correct
7 Correct 264 ms 15252 KB Output is correct
8 Correct 96 ms 10232 KB Output is correct
9 Correct 1 ms 500 KB Output is correct
10 Correct 6 ms 800 KB Output is correct
11 Correct 8 ms 768 KB Output is correct
12 Correct 6 ms 768 KB Output is correct
13 Correct 8 ms 640 KB Output is correct
14 Correct 9 ms 1408 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 9 ms 1280 KB Output is correct
17 Correct 2 ms 896 KB Output is correct
18 Correct 7 ms 768 KB Output is correct
19 Correct 2 ms 1024 KB Output is correct
20 Correct 2 ms 1152 KB Output is correct
21 Correct 9 ms 1280 KB Output is correct
22 Correct 8 ms 1152 KB Output is correct
23 Correct 9 ms 1152 KB Output is correct
24 Correct 9 ms 1328 KB Output is correct
25 Correct 6 ms 1280 KB Output is correct
26 Correct 2 ms 1024 KB Output is correct
27 Correct 9 ms 1408 KB Output is correct
28 Correct 256 ms 20316 KB Output is correct
29 Correct 236 ms 16228 KB Output is correct
30 Correct 210 ms 12024 KB Output is correct
31 Correct 229 ms 14840 KB Output is correct
32 Correct 224 ms 14712 KB Output is correct
33 Correct 207 ms 14968 KB Output is correct
34 Correct 321 ms 20096 KB Output is correct
35 Correct 192 ms 14956 KB Output is correct
36 Correct 269 ms 15224 KB Output is correct
37 Correct 254 ms 18388 KB Output is correct
38 Correct 247 ms 20192 KB Output is correct
39 Correct 244 ms 16184 KB Output is correct
40 Correct 256 ms 16120 KB Output is correct
41 Correct 191 ms 15060 KB Output is correct
42 Correct 213 ms 19176 KB Output is correct
43 Correct 204 ms 15224 KB Output is correct
44 Correct 94 ms 10236 KB Output is correct