oj.uz

답안 #244665

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
244665 2020-07-04T13:49:17 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 322 ms 262148 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[8000000];
lli dis[8000000];
set<ii> s;
lli dij(lli so,lli t)
{
  for(lli i=0;i<8000000;++i)
    dis[i]=1000000000;
  s.insert(mp(0,so));
  dis[so]=0;
  while(s.size()!=0)
  {
    ii v=(*s.begin());
    s.erase(s.begin());
    dis[v.S]=v.F;
    for(lli 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)
  {
    lli n,m,rn;
    cin>>n>>m;
    rn=sqrt(n)+1;
    ii dg[m];
    for(lli i=1;i<rn;++i)
    {
      for(lli 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(lli i=0;i<m;++i)
    {
      lli f,se;
      cin>>f>>se;
      dg[i]=mp(f,se);
      if(se<rn)
      {
      al[rn*n+f].pb(mp((se)*n+f,0));
      al[se*n+f].pb(mp(rn*n+f,0));
    }
      if(se>=rn)
      {
        lli p=f+se;
        while(p<n)
        {
          al[rn*n+f].pb(mp(rn*n+p,(p-f)/se));
          p+=se;
        }
        p=f-se;
        while(p>=0)
        {
          al[rn*n+f].pb(mp(rn*n+p,(f-p)/se));
          p-=se;
        }
      }
    }
    cout<<dij(rn*n+dg[0].F,rn*n+dg[1].F)<<endl;
  }
  return(0);
}

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 127 ms 219512 KB Output is correct
2 Correct 128 ms 219512 KB Output is correct
3 Correct 134 ms 219756 KB Output is correct
4 Correct 133 ms 219512 KB Output is correct
5 Correct 132 ms 219512 KB Output is correct
6 Correct 132 ms 219512 KB Output is correct
7 Correct 135 ms 219592 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 146 ms 219512 KB Output is correct
2 Correct 125 ms 219512 KB Output is correct
3 Correct 138 ms 219512 KB Output is correct
4 Correct 128 ms 219552 KB Output is correct
5 Correct 128 ms 219440 KB Output is correct
6 Correct 130 ms 219528 KB Output is correct
7 Correct 143 ms 219512 KB Output is correct
8 Correct 132 ms 219512 KB Output is correct
9 Correct 131 ms 219512 KB Output is correct
10 Correct 131 ms 219512 KB Output is correct
11 Correct 131 ms 219640 KB Output is correct
12 Correct 140 ms 219640 KB Output is correct
13 Correct 137 ms 219640 KB Output is correct
14 Correct 127 ms 219640 KB Output is correct
15 Correct 136 ms 219640 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 138 ms 219512 KB Output is correct
2 Correct 147 ms 219512 KB Output is correct
3 Correct 127 ms 219512 KB Output is correct
4 Correct 131 ms 219512 KB Output is correct
5 Correct 129 ms 219512 KB Output is correct
6 Correct 133 ms 219512 KB Output is correct
7 Correct 145 ms 219512 KB Output is correct
8 Correct 130 ms 219640 KB Output is correct
9 Correct 129 ms 219564 KB Output is correct
10 Correct 133 ms 219512 KB Output is correct
11 Correct 138 ms 219640 KB Output is correct
12 Correct 145 ms 219640 KB Output is correct
13 Correct 144 ms 219644 KB Output is correct
14 Correct 131 ms 219640 KB Output is correct
15 Correct 137 ms 219640 KB Output is correct
16 Correct 132 ms 219640 KB Output is correct
17 Correct 147 ms 220536 KB Output is correct
18 Correct 145 ms 222968 KB Output is correct
19 Correct 141 ms 223608 KB Output is correct
20 Correct 159 ms 223864 KB Output is correct
21 Correct 143 ms 219896 KB Output is correct
22 Correct 148 ms 222984 KB Output is correct
23 Correct 146 ms 222588 KB Output is correct
24 Correct 139 ms 223480 KB Output is correct
25 Correct 140 ms 223608 KB Output is correct
26 Correct 142 ms 223736 KB Output is correct
27 Correct 142 ms 223736 KB Output is correct
28 Correct 139 ms 223740 KB Output is correct
29 Correct 150 ms 223684 KB Output is correct
30 Correct 145 ms 223608 KB Output is correct
31 Correct 146 ms 223880 KB Output is correct
32 Correct 148 ms 223864 KB Output is correct
33 Correct 152 ms 224252 KB Output is correct
34 Correct 168 ms 224248 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 219512 KB Output is correct
2 Correct 130 ms 219512 KB Output is correct
3 Correct 132 ms 219640 KB Output is correct
4 Correct 133 ms 219468 KB Output is correct
5 Correct 138 ms 219512 KB Output is correct
6 Correct 128 ms 219512 KB Output is correct
7 Correct 129 ms 219496 KB Output is correct
8 Correct 126 ms 219512 KB Output is correct
9 Correct 126 ms 219640 KB Output is correct
10 Correct 126 ms 219640 KB Output is correct
11 Correct 128 ms 219640 KB Output is correct
12 Correct 131 ms 219640 KB Output is correct
13 Correct 129 ms 219640 KB Output is correct
14 Correct 129 ms 219640 KB Output is correct
15 Correct 127 ms 219640 KB Output is correct
16 Correct 136 ms 219768 KB Output is correct
17 Correct 145 ms 220536 KB Output is correct
18 Correct 138 ms 222840 KB Output is correct
19 Correct 139 ms 223608 KB Output is correct
20 Correct 142 ms 223864 KB Output is correct
21 Correct 129 ms 219896 KB Output is correct
22 Correct 137 ms 223096 KB Output is correct
23 Correct 139 ms 222456 KB Output is correct
24 Correct 142 ms 223480 KB Output is correct
25 Correct 154 ms 223608 KB Output is correct
26 Correct 141 ms 223736 KB Output is correct
27 Correct 144 ms 223736 KB Output is correct
28 Correct 145 ms 223812 KB Output is correct
29 Correct 152 ms 223736 KB Output is correct
30 Correct 145 ms 223612 KB Output is correct
31 Correct 147 ms 223736 KB Output is correct
32 Correct 147 ms 223864 KB Output is correct
33 Correct 166 ms 224376 KB Output is correct
34 Correct 157 ms 224316 KB Output is correct
35 Correct 156 ms 223096 KB Output is correct
36 Correct 134 ms 221432 KB Output is correct
37 Correct 164 ms 225144 KB Output is correct
38 Correct 167 ms 225272 KB Output is correct
39 Correct 166 ms 225272 KB Output is correct
40 Correct 183 ms 225272 KB Output is correct
41 Correct 162 ms 225220 KB Output is correct
42 Correct 147 ms 224756 KB Output is correct
43 Correct 146 ms 224756 KB Output is correct
44 Correct 154 ms 224724 KB Output is correct
45 Correct 177 ms 228088 KB Output is correct
46 Correct 165 ms 227960 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 140 ms 219512 KB Output is correct
2 Correct 129 ms 219512 KB Output is correct
3 Correct 140 ms 219516 KB Output is correct
4 Correct 127 ms 219512 KB Output is correct
5 Correct 141 ms 219512 KB Output is correct
6 Correct 125 ms 219516 KB Output is correct
7 Correct 127 ms 219512 KB Output is correct
8 Correct 141 ms 219512 KB Output is correct
9 Correct 130 ms 219512 KB Output is correct
10 Correct 132 ms 219640 KB Output is correct
11 Correct 129 ms 219640 KB Output is correct
12 Correct 141 ms 219644 KB Output is correct
13 Correct 141 ms 219640 KB Output is correct
14 Correct 127 ms 219640 KB Output is correct
15 Correct 127 ms 219640 KB Output is correct
16 Correct 128 ms 219640 KB Output is correct
17 Correct 133 ms 220524 KB Output is correct
18 Correct 135 ms 222872 KB Output is correct
19 Correct 139 ms 223608 KB Output is correct
20 Correct 143 ms 223864 KB Output is correct
21 Correct 143 ms 219896 KB Output is correct
22 Correct 138 ms 223096 KB Output is correct
23 Correct 152 ms 222456 KB Output is correct
24 Correct 155 ms 223480 KB Output is correct
25 Correct 144 ms 223736 KB Output is correct
26 Correct 141 ms 223736 KB Output is correct
27 Correct 149 ms 223736 KB Output is correct
28 Correct 144 ms 223736 KB Output is correct
29 Correct 165 ms 223736 KB Output is correct
30 Correct 141 ms 223608 KB Output is correct
31 Correct 148 ms 223712 KB Output is correct
32 Correct 142 ms 223736 KB Output is correct
33 Correct 155 ms 224248 KB Output is correct
34 Correct 168 ms 224248 KB Output is correct
35 Correct 149 ms 223096 KB Output is correct
36 Correct 135 ms 221304 KB Output is correct
37 Correct 182 ms 225272 KB Output is correct
38 Correct 180 ms 225272 KB Output is correct
39 Correct 180 ms 225272 KB Output is correct
40 Correct 168 ms 225272 KB Output is correct
41 Correct 179 ms 225272 KB Output is correct
42 Correct 148 ms 224884 KB Output is correct
43 Correct 149 ms 224884 KB Output is correct
44 Correct 145 ms 224692 KB Output is correct
45 Correct 171 ms 228088 KB Output is correct
46 Correct 179 ms 227960 KB Output is correct
47 Runtime error 322 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
48 Halted 0 ms 0 KB -