oj.uz

Submission #106892

# Submission time Handle Problem Language Result Execution time Memory
106892 2019-04-20T20:28:00 Z wilwxk Portals (BOI14_portals) C++11
70 / 100
 1000 ms 181240 KB 
#include <bits/stdc++.h>
using namespace std;

const int MAXN=1e6+5;
const int MAXNN=1e3+3;
vector<int> g[MAXN], pes[MAXN];
set<pair<int, int> > s;
priority_queue< pair<int, int> > pq;
int ori[MAXNN][MAXNN];
int parede[5][MAXNN][MAXNN];
int dist[MAXN];
int n, nn, mm, star, chegada;

int quem(int i, int j) {
	return (i-1)*mm+j;
}
void liga(int a, int b, int c, int k) {
	if(a==b) return;
	g[a].push_back(b); if(k) g[b].push_back(a);
	pes[a].push_back(c); if(k) pes[b].push_back(c);
}

void dijkstra(int star) {
	for(int i=1; i<=n; i++) {
		dist[i]=1e9+9; if(i==star) dist[i]=0; 
		// s.insert({dist[i], i});
		pq.push({-dist[i], i});
	}
	while(!pq.empty()) {
		int cur=pq.top().second;
		if(cur==chegada) return;
		// s.erase(s.begin());
		pq.pop();
		for(int i=0; i<g[cur].size(); i++) {
			int viz=g[cur][i]; int peso=pes[cur][i];
			if(dist[viz]>dist[cur]+peso) {
				dist[viz]=dist[cur]+peso;
				pq.push({-dist[viz], viz});
			}
		}
	}
}

int main() {
	scanf("%d %d", &nn, &mm);
	for(int i=1; i<=nn; i++) {
		char cc[MAXNN]; scanf(" %s", &cc[1]);
		for(int j=1; j<=mm; j++) {
			char c=cc[j];
			if(c=='#') ori[i][j]=1;
			else ori[i][j]=0;
			if(c=='S') star=quem(i, j);
			if(c=='C') chegada=quem(i, j);
		}
	}

	for(int i=1; i<=nn; i++) {
		int ult=1;
		for(int j=1; j<=mm; j++) {
			if(ori[i][j]!=0) { ult=j+1; continue; }
			parede[1][i][j]=ult;

			if(i-1>=1&&ori[i-1][j]==0) liga(quem(i-1, j), quem(i, j), 1, 1);
			if(i+1<=nn&&ori[i+1][j]==0) liga(quem(i+1, j), quem(i, j), 1, 1);
			if(j-1>=1&&ori[i][j-1]==0) liga(quem(i, j-1), quem(i, j), 1, 1);
			if(j+1<=mm&&ori[i][j+1]==0) liga(quem(i, j+1), quem(i, j), 1, 1);
		}
		ult=mm;
		for(int j=mm; j>=1; j--) {
			if(ori[i][j]!=0) { ult=j-1; continue; }
			parede[2][i][j]=ult;
		}
	}

	for(int j=1; j<=mm; j++) {
		int ult=1;
		for(int i=1; i<=nn; i++) {
			if(ori[i][j]!=0) { ult=i+1; continue; }
			parede[3][i][j]=ult;
		}
		ult=nn;
		for(int i=nn; i>=1; i--) {
			if(ori[i][j]!=0) { ult=i-1; continue; }
			parede[4][i][j]=ult;
		}
	}

	for(int i=1; i<=nn; i++) {
		for(int j=1; j<=mm; j++) {
			if(ori[i][j]!=0) continue;
			int aa=abs(parede[1][i][j]-j);
			int bb=abs(parede[2][i][j]-j);
			int cc=abs(parede[3][i][j]-i);
			int dd=abs(parede[4][i][j]-i);
			int melhor=min(min(aa, bb), min(cc, dd))+1;

			int cur=quem(i, j);
			liga(cur, quem(i, parede[1][i][j]), min(melhor, aa), 0);
			liga(cur, quem(i, parede[2][i][j]), min(melhor, bb), 0);
			liga(cur, quem(parede[3][i][j], j), min(melhor, cc), 0);
			liga(cur, quem(parede[4][i][j], j), min(melhor, dd), 0);
		}
	}
	// for(int i=1; i<=nn; i++) { for(int j=1; j<=mm; j++) printf("%d ", parede[3][i][j]); printf("\n"); }

	n=nn*mm;
	dijkstra(star);
	// for(int i=1; i<=n; i++) printf("%d > %d\n", i, dist[i]);

	printf("%d\n", dist[chegada]);

}

Compilation message

portals.cpp: In function 'void dijkstra(int)':
portals.cpp:34:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0; i<g[cur].size(); i++) {
                ~^~~~~~~~~~~~~~
portals.cpp: In function 'int main()':
portals.cpp:45:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &nn, &mm);
  ~~~~~^~~~~~~~~~~~~~~~~~~
portals.cpp:47:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   char cc[MAXNN]; scanf(" %s", &cc[1]);
                   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 47352 KB Output is correct
2 Correct 45 ms 47480 KB Output is correct
3 Correct 50 ms 47480 KB Output is correct
4 Correct 46 ms 47464 KB Output is correct
5 Correct 46 ms 47480 KB Output is correct
6 Correct 53 ms 47536 KB Output is correct
7 Correct 50 ms 47480 KB Output is correct
8 Correct 44 ms 47488 KB Output is correct
9 Correct 45 ms 47360 KB Output is correct
10 Correct 53 ms 47348 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 47352 KB Output is correct
2 Correct 45 ms 47484 KB Output is correct
3 Correct 47 ms 47608 KB Output is correct
4 Correct 46 ms 47488 KB Output is correct
5 Correct 43 ms 47472 KB Output is correct
6 Correct 52 ms 47448 KB Output is correct
7 Correct 45 ms 47480 KB Output is correct
8 Correct 46 ms 47608 KB Output is correct
9 Correct 47 ms 48760 KB Output is correct
10 Correct 53 ms 48760 KB Output is correct
11 Correct 46 ms 48616 KB Output is correct
12 Correct 48 ms 48592 KB Output is correct
13 Correct 47 ms 48632 KB Output is correct
14 Correct 48 ms 47452 KB Output is correct
15 Correct 48 ms 48632 KB Output is correct
16 Correct 46 ms 47480 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 47352 KB Output is correct
2 Correct 41 ms 47416 KB Output is correct
3 Correct 45 ms 47484 KB Output is correct
4 Correct 46 ms 47528 KB Output is correct
5 Correct 72 ms 54408 KB Output is correct
6 Correct 84 ms 54776 KB Output is correct
7 Correct 100 ms 55336 KB Output is correct
8 Correct 85 ms 54780 KB Output is correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 47352 KB Output is correct
2 Correct 45 ms 47452 KB Output is correct
3 Correct 49 ms 47452 KB Output is correct
4 Correct 39 ms 47460 KB Output is correct
5 Correct 42 ms 47480 KB Output is correct
6 Correct 44 ms 47600 KB Output is correct
7 Correct 46 ms 47480 KB Output is correct
8 Correct 44 ms 47608 KB Output is correct
9 Correct 47 ms 48760 KB Output is correct
10 Correct 58 ms 48816 KB Output is correct
11 Correct 45 ms 48504 KB Output is correct
12 Correct 46 ms 48488 KB Output is correct
13 Correct 47 ms 48632 KB Output is correct
14 Correct 72 ms 54492 KB Output is correct
15 Correct 71 ms 54712 KB Output is correct
16 Correct 75 ms 55416 KB Output is correct
17 Correct 73 ms 55668 KB Output is correct
18 Correct 88 ms 56696 KB Output is correct
19 Correct 94 ms 58228 KB Output is correct
20 Correct 76 ms 58296 KB Output is correct
21 Correct 65 ms 54500 KB Output is correct
22 Correct 71 ms 54560 KB Output is correct
23 Correct 68 ms 54768 KB Output is correct
24 Correct 103 ms 58244 KB Output is correct
25 Correct 48 ms 47352 KB Output is correct
26 Correct 49 ms 48632 KB Output is correct
27 Correct 49 ms 47352 KB Output is correct
28 Correct 71 ms 54776 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 47352 KB Output is correct
2 Correct 45 ms 47492 KB Output is correct
3 Correct 40 ms 47608 KB Output is correct
4 Correct 42 ms 47452 KB Output is correct
5 Correct 43 ms 47528 KB Output is correct
6 Correct 43 ms 47524 KB Output is correct
7 Correct 51 ms 47480 KB Output is correct
8 Correct 46 ms 47480 KB Output is correct
9 Correct 46 ms 48760 KB Output is correct
10 Correct 46 ms 48732 KB Output is correct
11 Correct 45 ms 48504 KB Output is correct
12 Correct 46 ms 48504 KB Output is correct
13 Correct 55 ms 48632 KB Output is correct
14 Correct 70 ms 54448 KB Output is correct
15 Correct 71 ms 54788 KB Output is correct
16 Correct 69 ms 55416 KB Output is correct
17 Correct 73 ms 55668 KB Output is correct
18 Correct 78 ms 56696 KB Output is correct
19 Correct 78 ms 58228 KB Output is correct
20 Correct 84 ms 58220 KB Output is correct
21 Correct 86 ms 54516 KB Output is correct
22 Correct 79 ms 54616 KB Output is correct
23 Correct 78 ms 54904 KB Output is correct
24 Execution timed out 1033 ms 181240 KB Time limit exceeded
25 Halted 0 ms 0 KB -