# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
268788 |
2020-08-17T02:00:50 Z |
cpp219 |
Portals (BOI14_portals) |
C++14 |
|
46 ms |
34168 KB |
// Solid <candgenesis>
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
const ll N = 1e3 + 1;
const ll inf = 1e9 + 7;
typedef pair<ll,ll> LL;
char a[N][N];
ll n,m,i,j,d[N][N];
LL dp[N][N][4],start,en;
vector<LL> g[N][N];
bool chk(ll x,ll y){
return (x >= 1&&y >= 1&&x <= n&&y <= m);
}
ll dx[4] = {0,0,1,-1};
ll dy[4] = {1,-1,0,0};
LL DFS(ll x,ll y,ll cond){
ll p = x + dx[cond],q = y + dy[cond];
if (a[p][q] == '#') return {x,y};
if (dp[p][q][cond].fs != 0) return dp[p][q][cond];
return dp[p][q][cond] = DFS(p,q,cond);
}
struct Node{
ll val,x,y;
};
bool operator < (Node x,Node y){
return (x.val < y.val)||(x.val == y.val&&x.x < y.x)||(x.val == y.val&&x.x == y.x&&x.y < y.y);
}
void Dij(ll x,ll y){
set<Node> s; d[x][y] = 0;
s.insert({d[x][y],x,y});
while(!s.empty()){
Node t = *s.begin(); s.erase(s.begin());
ll val = t.val;
for (auto i : g[t.x][t.y]){
ll u = i.fs,v = i.sc;
if (a[u][v] == '#') continue;
if (d[u][v] > val + 1){
s.erase({d[u][v],u,v});
d[u][v] = val + 1;
s.insert({d[u][v],u,v});
}
}
}
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
#define task "test"
if (fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
//freopen(task".out", "w", stdout);
}
cin>>n>>m;
for (i = 0;i <= n + 1;i++){
for (j = 0;j <= m + 1;j++){
if (!i||!j||j > m||i > n) a[i][j] = '#';
else{
cin>>a[i][j]; d[i][j] = inf;
if (a[i][j] == 'S') start = {i,j};
if (a[i][j] == 'C') en = {i,j};
for (ll k = 0;k < 4;k++){
ll p = i + dx[k],q = j + dy[k];
if (chk(p,q)) g[i][j].push_back({p,q});
}
}
}
}
for (i = 1;i <= n;i++){
for (j = 1;j <= m;j++){
for (ll k = 0;k < 4;k++){
ll p = i + dx[k],q = j + dy[k];
if (a[p][q] == '#'){
g[i][j].push_back(DFS(i,j,0)); g[i][j].push_back(DFS(i,j,1));
g[i][j].push_back(DFS(i,j,2)); g[i][j].push_back(DFS(i,j,3));
break;
}
}
}
}
//for (auto i : g[4][4]) cout<<i.fs<<" "<<i.sc<<"\n";
Dij(start.fs,start.sc);
cout<<d[en.fs][en.sc];
}
Compilation message
portals.cpp: In function 'int main()':
portals.cpp:54:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
54 | freopen(task".inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
23936 KB |
Output is correct |
2 |
Correct |
17 ms |
23936 KB |
Output is correct |
3 |
Correct |
17 ms |
23936 KB |
Output is correct |
4 |
Correct |
16 ms |
23936 KB |
Output is correct |
5 |
Correct |
17 ms |
23936 KB |
Output is correct |
6 |
Correct |
16 ms |
23936 KB |
Output is correct |
7 |
Correct |
17 ms |
23936 KB |
Output is correct |
8 |
Correct |
17 ms |
23936 KB |
Output is correct |
9 |
Correct |
16 ms |
23936 KB |
Output is correct |
10 |
Incorrect |
16 ms |
23936 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
17 ms |
23936 KB |
Output is correct |
2 |
Correct |
16 ms |
23936 KB |
Output is correct |
3 |
Correct |
16 ms |
23936 KB |
Output is correct |
4 |
Correct |
18 ms |
23936 KB |
Output is correct |
5 |
Correct |
18 ms |
23936 KB |
Output is correct |
6 |
Correct |
18 ms |
23936 KB |
Output is correct |
7 |
Correct |
16 ms |
23936 KB |
Output is correct |
8 |
Correct |
17 ms |
23936 KB |
Output is correct |
9 |
Correct |
20 ms |
24704 KB |
Output is correct |
10 |
Incorrect |
19 ms |
24704 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
18 ms |
24064 KB |
Output is correct |
2 |
Correct |
17 ms |
23936 KB |
Output is correct |
3 |
Correct |
17 ms |
23936 KB |
Output is correct |
4 |
Correct |
16 ms |
23936 KB |
Output is correct |
5 |
Correct |
43 ms |
34168 KB |
Output is correct |
6 |
Correct |
45 ms |
34168 KB |
Output is correct |
7 |
Correct |
46 ms |
34168 KB |
Output is correct |
8 |
Correct |
38 ms |
33532 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
23936 KB |
Output is correct |
2 |
Correct |
17 ms |
23936 KB |
Output is correct |
3 |
Correct |
16 ms |
23936 KB |
Output is correct |
4 |
Correct |
16 ms |
23936 KB |
Output is correct |
5 |
Correct |
16 ms |
23936 KB |
Output is correct |
6 |
Correct |
18 ms |
23936 KB |
Output is correct |
7 |
Correct |
16 ms |
23936 KB |
Output is correct |
8 |
Correct |
18 ms |
23936 KB |
Output is correct |
9 |
Correct |
19 ms |
24704 KB |
Output is correct |
10 |
Incorrect |
20 ms |
24704 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
16 ms |
23936 KB |
Output is correct |
2 |
Correct |
16 ms |
23936 KB |
Output is correct |
3 |
Correct |
16 ms |
23936 KB |
Output is correct |
4 |
Correct |
16 ms |
23936 KB |
Output is correct |
5 |
Correct |
16 ms |
23936 KB |
Output is correct |
6 |
Correct |
16 ms |
23936 KB |
Output is correct |
7 |
Correct |
16 ms |
23936 KB |
Output is correct |
8 |
Correct |
17 ms |
23936 KB |
Output is correct |
9 |
Correct |
18 ms |
24704 KB |
Output is correct |
10 |
Incorrect |
18 ms |
24704 KB |
Output isn't correct |
11 |
Halted |
0 ms |
0 KB |
- |