oj.uz

답안 #244624

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244624 2020-07-04T12:46:06 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 108 ms 164860 KB 
#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))
 
typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;
vector<ii> al[6*1000000];
int dis[6000000];
set<ii> s;
int dij(int so,int t)
{
  for(int i=0;i<6000000;++i)
    dis[i]=1000000000;
  s.insert(mp(0,so));
  while(s.size()!=0)
  {
    ii v=(*s.begin());
    s.erase(s.begin());
    dis[v.S]=v.F;
    for(int i=0;i<al[v.S].size();++i)
    {
      if(al[v.S][i].S+v.F<dis[al[v.S][i].F])
      {
       s.erase(mp(dis[al[v.S][i].F],al[v.S][i].F));
       dis[al[v.S][i].F]=al[v.S][i].S+v.F;
       s.insert(mp(dis[al[v.S][i].F],al[v.S][i].F)); 
      }
    }
  }
  if(dis[t]==1000000000)
    return(-1);
  return(dis[t]);
}
int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  lli test=1;
  for(;test>0;--test)
  {
    int n,m,rn;
    cin>>n>>m;
    rn=sqrt(n)+1;
    ii dg[m];
    for(int i=1;i<rn;++i)
    {
      for(int j=0;j<n;++j)
      {
        if(j+i<n)
        {
          al[i*n+j].pb(mp(i*n+j+i,1));
          al[i*n+j+i].pb(mp(i*n+j,1));
        }
        if(j+i<n)
          al[i*n+j].pb(mp(rn*n+j+i,1));
        if(j-i>=0)
          al[i*n+j].pb(mp(rn*n+j-i,1));
      }
    }
    for(int i=0;i<m;++i)
    {
      int f,s;
      cin>>f>>s;
      dg[i]=mp(f,s);
      if(s<rn)
        al[rn*n+f].pb(mp((s)*n+f,0));
      else
      {
        int p=f+s;
        while(p<n)
        {
          al[rn*n+f].pb(mp(rn*n+p,(p-f)/s));
          p+=s;
        }
        p=f-s;
        while(p>=0)
        {
          al[rn*n+f].pb(mp(rn*n+p,(f-p)/s));
          p-=s;
        }
      }
    }
    cout<<dij(dg[0].S*n+dg[0].F,dg[1].S*n+dg[1].F)<<endl;
  }
  return(0);
}

Compilation message

skyscraper.cpp: In function 'int dij(int, int)':
skyscraper.cpp:30:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<al[v.S].size();++i)
                 ~^~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 96 ms 164728 KB Output is correct
2 Correct 104 ms 164600 KB Output is correct
3 Correct 98 ms 164728 KB Output is correct
4 Correct 93 ms 164728 KB Output is correct
5 Correct 104 ms 164716 KB Output is correct
6 Correct 94 ms 164732 KB Output is correct
7 Correct 103 ms 164728 KB Output is correct

Subtask #2
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 164856 KB Output is correct
2 Correct 93 ms 164728 KB Output is correct
3 Correct 92 ms 164728 KB Output is correct
4 Correct 94 ms 164728 KB Output is correct
5 Correct 93 ms 164728 KB Output is correct
6 Correct 96 ms 164728 KB Output is correct
7 Correct 93 ms 164740 KB Output is correct
8 Incorrect 94 ms 164728 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 164672 KB Output is correct
2 Correct 92 ms 164728 KB Output is correct
3 Correct 102 ms 164728 KB Output is correct
4 Correct 92 ms 164728 KB Output is correct
5 Correct 93 ms 164728 KB Output is correct
6 Correct 108 ms 164856 KB Output is correct
7 Correct 92 ms 164728 KB Output is correct
8 Incorrect 93 ms 164860 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 164728 KB Output is correct
2 Correct 98 ms 164856 KB Output is correct
3 Correct 106 ms 164704 KB Output is correct
4 Correct 94 ms 164728 KB Output is correct
5 Correct 93 ms 164860 KB Output is correct
6 Correct 99 ms 164732 KB Output is correct
7 Correct 103 ms 164728 KB Output is correct
8 Incorrect 96 ms 164728 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 164732 KB Output is correct
2 Correct 97 ms 164728 KB Output is correct
3 Correct 96 ms 164732 KB Output is correct
4 Correct 95 ms 164728 KB Output is correct
5 Correct 99 ms 164796 KB Output is correct
6 Correct 95 ms 164728 KB Output is correct
7 Correct 95 ms 164728 KB Output is correct
8 Incorrect 105 ms 164728 KB Output isn't correct
9 Halted 0 ms 0 KB -