oj.uz

답안 #45504

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
45504 2018-04-14T19:10:17 Z dqhungdl Jakarta Skyscrapers (APIO15_skyscraper) C++17
10 / 100
 1000 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;

const int lim=300;
typedef pair<int,int> ii;
int n,m,S,T,d[30005][305];
bool Visited[30005],Free[30005][305];
map<int,int> dd[30005];
map<int,bool> FFree[30005];
vector<int> g[30005];
queue<ii> Q;

int main()
{
    ios_base::sync_with_stdio(false);
    //freopen("TEST.INP","r",stdin);
    cin>>n>>m;
    int pos,step;
    for(int i=1;i<=m;i++)
    {
        cin>>pos>>step;
        g[pos+1].push_back(step);
        if(i==1)
            S=pos+1;
        if(i==2)
            T=pos+1;
    }
    for(int i=0; i<g[S].size(); i++)
    {
        if(g[S][i]<=lim)
            Free[S][g[S][i]]=true;
        else
            FFree[S][g[S][i]]=true;
        Q.push(ii(S,g[S][i]));
    }
    while(Q.size()>0)
    {
        int u=Q.front().first;
        int v=Q.front().second;
        int w;
        if(v<=lim)
            w=d[u][v];
        else
            w=dd[u][v];
        Q.pop();
        if(u==T)
        {
            cout<<w;
            return 0;
        }
        if(Visited[u]==false)
        {
            Visited[u]=true;
            for(int i=0; i<g[u].size(); i++)
            {
                if(u-g[u][i]>=1)
                {
                    if(g[u][i]<=lim&&Free[u-g[u][i]][g[u][i]]==false)
                    {
                        Free[u-g[u][i]][g[u][i]]=true;
                        d[u-g[u][i]][g[u][i]]=w+1;
                    }
                    else
                    if(g[u][i]>lim&&FFree[u-g[u][i]][g[u][i]]==false)
                    {
                        FFree[u-g[u][i]][g[u][i]]=true;
                        dd[u-g[u][i]][g[u][i]]=w+1;
                    }
                    Q.push(ii(u-g[u][i],g[u][i]));
                }
                if(u+g[u][i]<=n)
                {
                    if(g[u][i]<=lim&&Free[u+g[u][i]][g[u][i]]==false)
                    {
                        Free[u+g[u][i]][g[u][i]]=true;
                        d[u+g[u][i]][g[u][i]]=w+1;
                    }
                    else
                    if(g[u][i]>lim&&FFree[u+g[u][i]][g[u][i]]==false)
                    {
                        FFree[u+g[u][i]][g[u][i]]=true;
                        dd[u+g[u][i]][g[u][i]]=w+1;
                    }
                    Q.push(ii(u+g[u][i],g[u][i]));
                }
            }
        }
        if(u-v>=1)
        {
            if(v<=lim&&Free[u-v][v]==false)
            {
                Free[u-v][v]=true;
                d[u-v][v]=w+1;
            }
            else
            if(v>lim&&FFree[u-v][v]==false)
            {
                FFree[u-v][v]=true;
                dd[u-v][v]=w+1;
            }
            Q.push(ii(u-v,v));
        }
        if(u+v<=n)
        {
            if(v<=lim&&Free[u+v][v]==false)
            {
                Free[u+v][v]=true;
                d[u+v][v]=w+1;
            }
            else
            if(v>lim&&FFree[u+v][v]==false)
            {
                FFree[u+v][v]=true;
                dd[u+v][v]=w+1;
            }
            Q.push(ii(u+v,v));
        }
    }
    cout<<-1;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:28:19: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0; i<g[S].size(); i++)
                  ~^~~~~~~~~~~~
skyscraper.cpp:54:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             for(int i=0; i<g[u].size(); i++)
                          ~^~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 3832 KB Output is correct
2 Correct 4 ms 4068 KB Output is correct
3 Correct 4 ms 4068 KB Output is correct
4 Correct 5 ms 4068 KB Output is correct
5 Correct 5 ms 4068 KB Output is correct
6 Correct 5 ms 4068 KB Output is correct
7 Correct 5 ms 4080 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4080 KB Output is correct
2 Correct 4 ms 4148 KB Output is correct
3 Correct 4 ms 4148 KB Output is correct
4 Correct 4 ms 4148 KB Output is correct
5 Correct 4 ms 4148 KB Output is correct
6 Correct 4 ms 4148 KB Output is correct
7 Correct 4 ms 4148 KB Output is correct
8 Correct 4 ms 4148 KB Output is correct
9 Correct 5 ms 4252 KB Output is correct
10 Correct 4 ms 4252 KB Output is correct
11 Correct 5 ms 4348 KB Output is correct
12 Execution timed out 1094 ms 262144 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 262144 KB Output is correct
2 Correct 4 ms 262144 KB Output is correct
3 Correct 4 ms 262144 KB Output is correct
4 Correct 4 ms 262144 KB Output is correct
5 Correct 4 ms 262144 KB Output is correct
6 Correct 5 ms 262144 KB Output is correct
7 Correct 4 ms 262144 KB Output is correct
8 Correct 4 ms 262144 KB Output is correct
9 Correct 4 ms 262144 KB Output is correct
10 Correct 5 ms 262144 KB Output is correct
11 Correct 6 ms 262144 KB Output is correct
12 Execution timed out 1098 ms 262144 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 262144 KB Output is correct
2 Correct 5 ms 262144 KB Output is correct
3 Correct 4 ms 262144 KB Output is correct
4 Correct 4 ms 262144 KB Output is correct
5 Correct 5 ms 262144 KB Output is correct
6 Correct 4 ms 262144 KB Output is correct
7 Correct 5 ms 262144 KB Output is correct
8 Correct 4 ms 262144 KB Output is correct
9 Correct 4 ms 262144 KB Output is correct
10 Correct 4 ms 262144 KB Output is correct
11 Correct 5 ms 262144 KB Output is correct
12 Execution timed out 1112 ms 262144 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 262144 KB Output is correct
2 Correct 5 ms 262144 KB Output is correct
3 Correct 6 ms 262144 KB Output is correct
4 Correct 4 ms 262144 KB Output is correct
5 Correct 5 ms 262144 KB Output is correct
6 Correct 5 ms 262144 KB Output is correct
7 Correct 5 ms 262144 KB Output is correct
8 Correct 5 ms 262144 KB Output is correct
9 Correct 5 ms 262144 KB Output is correct
10 Correct 6 ms 262144 KB Output is correct
11 Correct 5 ms 262144 KB Output is correct
12 Execution timed out 1088 ms 262144 KB Time limit exceeded
13 Halted 0 ms 0 KB -