#include <cstdio> #include <cmath> #include <iostream> #include <algorithm> #include <queue> #include <list> #include <vector> #include <map> #include <set> #include <string> #include <cstring> #include <cassert> #include <limits.h> using namespace std; #define ST first #define ND second #define MP make_pair #define PB push_back typedef long long LL; typedef long double LD; typedef vector<int> VI; typedef pair<int,int> PII; #define REP(i,n) for(int i=0;i<(n);i++) #define FOR(i,a,b) for(VAR(i,a);i<=(b);++i) #define FORD(i,a,b) for(VAR(i,a);i>=(b);--i) #define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a) #define VAR(a,b) __typeof(b) a=(b) #define SIZE(a) ((int)((a).size())) #define ALL(x) (x).begin(),(x).end() #define CLR(x,a) memset(x,a,sizeof(x)) #define ZERO(x) memset(x,0,sizeof(x)) #define S(t,i) scanf("%" ## t, &i) #define SI(i) scanf("%d", &i) const int MAXN=2000+5; int n, m, k; bool mountain[MAXN][MAXN]; int dist[MAXN][MAXN]; int bfs() { int dX[] = {0, 1, 0, -1}; int dY[] = {1, 0, -1, 0}; queue<pair<int,int>> q; q.push(make_pair(1,1)); mountain[1][1] = false; while (mountain[m][n]) { PII p = q.front(); q.pop(); int d = dist[p.first][p.second]; REP(i, 4) { PII newPosition = make_pair(p.first + dY[i], p.second + dX[i]); if (mountain[newPosition.first][newPosition.second]) { dist[newPosition.first][newPosition.second] = d + 1; mountain[newPosition.first][newPosition.second] = false; q.push(newPosition); } } } return dist[m][n]; } int main() { ios_base::sync_with_stdio(0); SI(m); SI(n); SI(k); if (n == 1 && m == 1) { printf("0 %d\n", k); } scanf(" "); FOR(mi, 1, m) { FOR(ni, 1, n) { char c; scanf("%c", &c); mountain[mi][ni] = (c == '.'); } scanf(" "); } long long int d = bfs(); // printf("%lld\n", d); int cnt = 0; long long int minTime = LLONG_MAX; REP(ki, k) { int t1, t2; scanf("%d %d", &t1, &t2); long long int t = (long long int)(m + n - 2) * (long long int)t1 + ((long long int)(t1 + t2) * (d - (m + n - 2)) / 2); if (minTime > t) { cnt = 1; minTime = t; } else if (minTime == t) { cnt++; } } printf("%lld %d\n", minTime, cnt); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 | #include <cstdio> #include <cmath> #include <iostream> #include <algorithm> #include <queue> #include <list> #include <vector> #include <map> #include <set> #include <string> #include <cstring> #include <cassert> #include <limits.h> using namespace std; #define ST first #define ND second #define MP make_pair #define PB push_back typedef long long LL; typedef long double LD; typedef vector<int> VI; typedef pair<int,int> PII; #define REP(i,n) for(int i=0;i<(n);i++) #define FOR(i,a,b) for(VAR(i,a);i<=(b);++i) #define FORD(i,a,b) for(VAR(i,a);i>=(b);--i) #define FORE(a,b) for(VAR(a,(b).begin());a!=(b).end();++a) #define VAR(a,b) __typeof(b) a=(b) #define SIZE(a) ((int)((a).size())) #define ALL(x) (x).begin(),(x).end() #define CLR(x,a) memset(x,a,sizeof(x)) #define ZERO(x) memset(x,0,sizeof(x)) #define S(t,i) scanf("%" ## t, &i) #define SI(i) scanf("%d", &i) const int MAXN=2000+5; int n, m, k; bool mountain[MAXN][MAXN]; int dist[MAXN][MAXN]; int bfs() { int dX[] = {0, 1, 0, -1}; int dY[] = {1, 0, -1, 0}; queue<pair<int,int>> q; q.push(make_pair(1,1)); mountain[1][1] = false; while (mountain[m][n]) { PII p = q.front(); q.pop(); int d = dist[p.first][p.second]; REP(i, 4) { PII newPosition = make_pair(p.first + dY[i], p.second + dX[i]); if (mountain[newPosition.first][newPosition.second]) { dist[newPosition.first][newPosition.second] = d + 1; mountain[newPosition.first][newPosition.second] = false; q.push(newPosition); } } } return dist[m][n]; } int main() { ios_base::sync_with_stdio(0); SI(m); SI(n); SI(k); if (n == 1 && m == 1) { printf("0 %d\n", k); } scanf(" "); FOR(mi, 1, m) { FOR(ni, 1, n) { char c; scanf("%c", &c); mountain[mi][ni] = (c == '.'); } scanf(" "); } long long int d = bfs(); // printf("%lld\n", d); int cnt = 0; long long int minTime = LLONG_MAX; REP(ki, k) { int t1, t2; scanf("%d %d", &t1, &t2); long long int t = (long long int)(m + n - 2) * (long long int)t1 + ((long long int)(t1 + t2) * (d - (m + n - 2)) / 2); if (minTime > t) { cnt = 1; minTime = t; } else if (minTime == t) { cnt++; } } printf("%lld %d\n", minTime, cnt); return 0; } |