oj.uz

답안 #465766

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
465766 2021-08-16T18:18:16 Z habibaissa 포탈들 (BOI14_portals) C++17
20 / 100
 8 ms 1044 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
 
int32_t main()
{
    int n,m;
    cin >> n >> m;
    int x,y,xx,yy;
    vector<vector<int> > v;
    v.resize(n);
    for(int i=0; i<n; i++)
    {
        for(int k=0; k<m; k++)
        {
            char p;
            cin >> p;
            if(p=='S')
            {
                x=i;y=k;
            }
            if(p=='C')
            {
                xx=i;yy=k;
                v[i].push_back('.');
                continue;
            }
            v[i].push_back(p);
        }
    }
    vector<vector<int>> t;
    vector<int> poss;
    poss.push_back(1);
    poss.push_back(0);
    t.resize(n+5);
    for(int i=0;i<t.size();i++)
            t[i].resize(m+5,INT_MAX);
        
    queue<pair<pair<int,int>,pair<int,int> > > q;
    q.push(make_pair(make_pair(x,y),make_pair(0,0)));
    while(!q.empty())
    {
        int deb=q.front().first.first;
        int deb2=q.front().first.second;
        int z=q.front().second.first;
        int e=q.front().second.second;
        
        t[deb][deb2]=min(z,t[deb][deb2]);
        //cout << deb << " " << deb2 << " " << t[deb][deb2] << '\n';
        //cout << deb << "        " << deb2 << "       " << t[deb][deb2] << '\n';
        if(deb==xx && deb2==yy)
        {
            q.pop();
            continue;
        }
        q.pop();
        for(int elem:poss)
        {
            for(int elem2:poss)
            {
                if(elem!=elem2)
                {
                    if(deb+elem<n && deb2+elem2<m && v[deb+elem][deb2+elem2]!='#' && z+1<t[deb+elem][deb2+elem2])
                    {
                        t[deb][deb2]=min(z+1,t[deb+elem][deb2+elem2]);
                        q.push({{deb+elem,deb2+elem2},{z+1,0}});
                    }
                    if(deb-elem>=0 && deb2-elem2>=0 && v[deb-elem][deb2-elem2]!='#' && z+1<t[deb-elem][deb2-elem2])
                    {
                        t[deb][deb2]=min(z+1,t[deb-elem][deb2-elem]);
                        q.push({{deb-elem,deb2-elem2},{z+1,0}});
                    }
                }
            }
        }
        if(e==0)
        {
        int k=deb;
        if(deb-1==-1 || v[deb-1][deb2]=='#')
        {
            while( (deb+1<n && v[deb+1][deb2]!='#'))
            {
                deb++;
            }
            if(deb!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
        }deb=k;
        if(deb+1==n || v[deb+1][deb2]=='#')
        {
            
            while( (deb-1>=0 && v[deb-1][deb2]!='#'))
            {
                //cout << deb << " " << deb2 << endl;
                deb--;
            }
            if(deb!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
            
        }
        deb=k;
        k=deb2;
        if(deb2-1==-1 || v[deb][deb2-1]=='#')
        {
            while((deb2+1<m && v[deb][deb2+1]!='#'))
            {
                deb2++;
            }
            if(deb2!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
            
        }deb2=k;
        if(deb2+1==m || v[deb][deb2+1]=='#')
        {
            while( (deb2-1>=0 && v[deb][deb2-1]!='#'))
            {
                deb2--;
            }
            if(deb2!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
        }
        }
        else
        {int k=deb;

            while(deb+1<n && v[deb+1][deb2]!='#')
            {
                deb++;
            }
            if(deb!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
            deb=k;
            while(deb-1>=0 && v[deb-1][deb2]!='#')
            {
                //cout << deb << " " << deb2 << endl;
                deb--;
            }
            if(deb!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
            deb=k;
            k=deb2;
            while(deb2+1<m && v[deb][deb2+1]!='#')
            {
                deb2++;
            }
            if(deb2!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
            deb2=k;
            while(deb2-1>=0 && v[deb][deb2-1]!='#')
            {
                deb2--;
            }
            if(deb2!=k && z+1<t[deb][deb2])
            {
                t[deb][deb2]=min(z+1,t[deb][deb2]);
                q.push({{deb,deb2},{z+1,1}});
            }
        }
   }
    cout << t[xx][yy] << endl;
    
}

Compilation message

portals.cpp: In function 'int32_t main()':
portals.cpp:36:18: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::vector<long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for(int i=0;i<t.size();i++)
      |                 ~^~~~~~~~~
portals.cpp:180:21: warning: 'yy' may be used uninitialized in this function [-Wmaybe-uninitialized]
  180 |     cout << t[xx][yy] << endl;
      |                     ^
portals.cpp:180:17: warning: 'xx' may be used uninitialized in this function [-Wmaybe-uninitialized]
  180 |     cout << t[xx][yy] << endl;
      |                 ^

Subtask #1
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 7 ms 972 KB Output is correct
6 Correct 8 ms 1044 KB Output is correct
7 Correct 8 ms 972 KB Output is correct
8 Correct 6 ms 972 KB Output is correct

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Incorrect 0 ms 204 KB Output isn't correct
8 Halted 0 ms 0 KB -