# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
29803 | TAMREF | Portals (BOI14_portals) | C++11 | 333 ms | 15108 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define vc first
#define vp second
#define all(X) X.begin(),X.end()
using namespace std;
typedef pair<int,int> pii;
const int mx=1005, inf=1e8;
int s,e;
int R,C;
int D[mx*mx];
vector<int> rs[mx], cs[mx], rrs[mx], rcs[mx];
char buf[mx][mx+8];
void input(){
scanf("%d %d\n",&R,&C);
for(int i=1;i<=R;i++) scanf("%s",buf[i]+1);
for(int i=0;i<=C+1;i++) buf[0][i]=buf[R+1][i]='#';
for(int j=0;j<=R+1;j++) buf[j][0]=buf[j][C+1]='#';
for(int i=0;i<R+2;i++){
for(int j=0;j<C+2;j++){
if(buf[i][j]=='S') s=i*(C+2)+j;
else if(buf[i][j]=='C') e=i*(C+2)+j;
else if(buf[i][j]=='#'){
rs[i].push_back(j);
cs[j].push_back(i);
}
}
}
for(int i=0;i<R+2;i++){
rrs[i]=rs[i];
reverse(all(rrs[i]));
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |