oj.uz

Submission #244783

# Submission time Handle Problem Language Result Execution time Memory
244783 2020-07-05T01:24:15 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 370 ms 248952 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<int> al[5220000];
lli dis[5220000],n,rn;
map<ii,int> ma;
int minp=10000000, maxp=-1;
set<int> pset;
bool cmp(ii& a, ii& b)
{
  return (mp(a.F,mp(a.S%n, a.S/n)) > 
  mp(b.F,mp(b.S%n, b.S/n)));
}

lli dij(lli so,lli t)
{
  priority_queue<ii,vector<ii>, decltype(&cmp)> s(&cmp);
  for(lli i=0;i<5220000;++i)
    dis[i]=1000000000;
  s.push(mp(0,so));
  dis[so%10000000]=0;
  while(s.size()!=0)
  {
    if(s.size()>rn*n+n)
        exit(1);
    ii v=(s.top());
    s.pop();
    if(dis[v.S]!=v.F)
      continue;
    if((v.S)%n==t)
      return(v.F);
    dis[v.S]=v.F;
    if(v.S<rn*n)
    {
      al[v.S].pb(v.S%n+rn*n);
      if(v.S%n+v.S/n<=maxp)
        al[v.S].pb(v.S+v.S/n+1*10000000);
      if(v.S%n-v.S/n>=minp)
        al[v.S].pb(v.S-v.S/n+1*10000000);
    }
    for(lli i=0;i<al[v.S].size();++i)
    {
      if((al[v.S][i]%10000000)%n < minp or 
        (al[v.S][i]%10000000)%n > maxp) continue;
      if(al[v.S][i]/10000000+v.F<dis[al[v.S][i]%10000000])
      {
       dis[al[v.S][i]%10000000]=al[v.S][i]/10000000+v.F;
       s.push(mp(dis[al[v.S][i]%10000000],al[v.S][i]%10000000)); 
      }
    }
    if(v.S<rn*n)
    {
    if(v.S%n+v.S/n<=maxp)
        al[v.S].pop_back();
      if(v.S%n-v.S/n>=minp)
        al[v.S].pop_back();
      al[v.S].pop_back();
    }
  }
  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 m, from, to,t1=0;
    int g = -1;
    cin>>n>>m;
    rn=sqrt(n)+1;
    for(lli i=0;i<m;++i)
    {
      lli f,se;
      cin>>f>>se;
      minp = min(minp, f);
      maxp = max(maxp, f);
      pset.insert(f);
      g = (g==-1)?se:__gcd(g, se);
      if(i==0) from = f;
      if(i==1) to = f;
      if(ma.find(mp(f, se))==ma.end()) {
        ma[mp(f, se)] = 1;
      } else continue;
      if(se<rn)
      {
        al[rn*n+f].pb((se)*n+f+0*10000000);
        t1+=2;
      }
      if(se>=rn)
      {
        lli p=f+se;
        while(p<n)
        {
          al[rn*n+f].pb(rn*n+p+((p-f)/se)*10000000);
          p+=se;
          t1++;
        }
        p=f-se;
        while(p>=0)
        {
          al[rn*n+f].pb(rn*n+p+((f-p)/se)*10000000);
          p-=se;
          t1++;
        }
      }
    }
    if(abs(to-from)%g!=0) cout << -1 << endl;
    else cout<<dij(rn*n+from,rn*n+to)<<endl;
  }
  return(0);
}

Compilation message

skyscraper.cpp: In function 'lli dij(lli, lli)':
skyscraper.cpp:37:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size()>rn*n+n)
        ~~~~~~~~^~~~~~~
skyscraper.cpp:54:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(lli i=0;i<al[v.S].size();++i)
                 ~^~~~~~~~~~~~~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:125:37: warning: 'to' may be used uninitialized in this function [-Wmaybe-uninitialized]
     else cout<<dij(rn*n+from,rn*n+to)<<endl;
                                     ^
skyscraper.cpp:125:37: warning: 'from' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 94 ms 143352 KB Output is correct
2 Correct 87 ms 143352 KB Output is correct
3 Correct 89 ms 143352 KB Output is correct
4 Correct 87 ms 143352 KB Output is correct
5 Correct 92 ms 143352 KB Output is correct
6 Correct 90 ms 143352 KB Output is correct
7 Correct 87 ms 143352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 99 ms 143352 KB Output is correct
2 Correct 94 ms 143320 KB Output is correct
3 Correct 100 ms 143352 KB Output is correct
4 Correct 87 ms 143352 KB Output is correct
5 Correct 88 ms 143352 KB Output is correct
6 Correct 93 ms 143392 KB Output is correct
7 Correct 86 ms 143352 KB Output is correct
8 Correct 88 ms 143352 KB Output is correct
9 Correct 88 ms 143352 KB Output is correct
10 Correct 86 ms 143352 KB Output is correct
11 Correct 88 ms 143480 KB Output is correct
12 Correct 88 ms 143352 KB Output is correct
13 Correct 87 ms 143352 KB Output is correct
14 Correct 88 ms 143480 KB Output is correct
15 Correct 88 ms 143480 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 143352 KB Output is correct
2 Correct 86 ms 143356 KB Output is correct
3 Correct 89 ms 143352 KB Output is correct
4 Correct 87 ms 143352 KB Output is correct
5 Correct 86 ms 143352 KB Output is correct
6 Correct 95 ms 143328 KB Output is correct
7 Correct 88 ms 143352 KB Output is correct
8 Correct 90 ms 143352 KB Output is correct
9 Correct 97 ms 143352 KB Output is correct
10 Correct 87 ms 143480 KB Output is correct
11 Correct 91 ms 143508 KB Output is correct
12 Correct 91 ms 143480 KB Output is correct
13 Correct 91 ms 143384 KB Output is correct
14 Correct 93 ms 143480 KB Output is correct
15 Correct 90 ms 143480 KB Output is correct
16 Correct 88 ms 143352 KB Output is correct
17 Correct 93 ms 143736 KB Output is correct
18 Correct 89 ms 143480 KB Output is correct
19 Correct 90 ms 143456 KB Output is correct
20 Correct 91 ms 143736 KB Output is correct
21 Correct 89 ms 143480 KB Output is correct
22 Correct 87 ms 143480 KB Output is correct
23 Correct 91 ms 143608 KB Output is correct
24 Correct 96 ms 143736 KB Output is correct
25 Correct 90 ms 143608 KB Output is correct
26 Correct 95 ms 143608 KB Output is correct
27 Correct 91 ms 143480 KB Output is correct
28 Correct 100 ms 143992 KB Output is correct
29 Correct 106 ms 145016 KB Output is correct
30 Correct 92 ms 143736 KB Output is correct
31 Correct 108 ms 144248 KB Output is correct
32 Correct 109 ms 143864 KB Output is correct
33 Correct 120 ms 145912 KB Output is correct
34 Correct 122 ms 146244 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 143328 KB Output is correct
2 Correct 87 ms 143352 KB Output is correct
3 Correct 92 ms 143480 KB Output is correct
4 Correct 85 ms 143352 KB Output is correct
5 Correct 85 ms 143480 KB Output is correct
6 Correct 99 ms 143352 KB Output is correct
7 Correct 87 ms 143352 KB Output is correct
8 Correct 86 ms 143352 KB Output is correct
9 Correct 89 ms 143352 KB Output is correct
10 Correct 86 ms 143352 KB Output is correct
11 Correct 90 ms 143480 KB Output is correct
12 Correct 88 ms 143352 KB Output is correct
13 Correct 90 ms 143328 KB Output is correct
14 Correct 94 ms 143480 KB Output is correct
15 Correct 87 ms 143480 KB Output is correct
16 Correct 88 ms 143484 KB Output is correct
17 Correct 90 ms 143736 KB Output is correct
18 Correct 90 ms 143480 KB Output is correct
19 Correct 94 ms 143352 KB Output is correct
20 Correct 90 ms 143736 KB Output is correct
21 Correct 87 ms 143480 KB Output is correct
22 Correct 88 ms 143444 KB Output is correct
23 Correct 87 ms 143608 KB Output is correct
24 Correct 90 ms 143736 KB Output is correct
25 Correct 90 ms 143736 KB Output is correct
26 Correct 89 ms 143608 KB Output is correct
27 Correct 90 ms 143608 KB Output is correct
28 Correct 90 ms 144076 KB Output is correct
29 Correct 108 ms 145016 KB Output is correct
30 Correct 94 ms 143736 KB Output is correct
31 Correct 97 ms 144120 KB Output is correct
32 Correct 92 ms 143796 KB Output is correct
33 Correct 125 ms 145912 KB Output is correct
34 Correct 128 ms 146404 KB Output is correct
35 Correct 120 ms 146296 KB Output is correct
36 Correct 96 ms 143992 KB Output is correct
37 Correct 131 ms 147064 KB Output is correct
38 Correct 135 ms 147448 KB Output is correct
39 Correct 138 ms 147452 KB Output is correct
40 Correct 137 ms 147432 KB Output is correct
41 Correct 139 ms 147468 KB Output is correct
42 Correct 102 ms 143608 KB Output is correct
43 Correct 94 ms 143608 KB Output is correct
44 Correct 94 ms 143736 KB Output is correct
45 Correct 150 ms 149368 KB Output is correct
46 Correct 153 ms 149880 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 143480 KB Output is correct
2 Correct 89 ms 143352 KB Output is correct
3 Correct 91 ms 143352 KB Output is correct
4 Correct 89 ms 143352 KB Output is correct
5 Correct 94 ms 143352 KB Output is correct
6 Correct 86 ms 143484 KB Output is correct
7 Correct 86 ms 143352 KB Output is correct
8 Correct 97 ms 143352 KB Output is correct
9 Correct 85 ms 143352 KB Output is correct
10 Correct 88 ms 143352 KB Output is correct
11 Correct 87 ms 143480 KB Output is correct
12 Correct 86 ms 143324 KB Output is correct
13 Correct 86 ms 143352 KB Output is correct
14 Correct 92 ms 143480 KB Output is correct
15 Correct 88 ms 143480 KB Output is correct
16 Correct 88 ms 143352 KB Output is correct
17 Correct 92 ms 143736 KB Output is correct
18 Correct 90 ms 143480 KB Output is correct
19 Correct 86 ms 143352 KB Output is correct
20 Correct 92 ms 143736 KB Output is correct
21 Correct 86 ms 143484 KB Output is correct
22 Correct 87 ms 143480 KB Output is correct
23 Correct 88 ms 143608 KB Output is correct
24 Correct 90 ms 143736 KB Output is correct
25 Correct 92 ms 143608 KB Output is correct
26 Correct 90 ms 143608 KB Output is correct
27 Correct 89 ms 143480 KB Output is correct
28 Correct 91 ms 143992 KB Output is correct
29 Correct 116 ms 145088 KB Output is correct
30 Correct 92 ms 143688 KB Output is correct
31 Correct 101 ms 144180 KB Output is correct
32 Correct 91 ms 143864 KB Output is correct
33 Correct 114 ms 145916 KB Output is correct
34 Correct 119 ms 146296 KB Output is correct
35 Correct 125 ms 146332 KB Output is correct
36 Correct 93 ms 143992 KB Output is correct
37 Correct 131 ms 147040 KB Output is correct
38 Correct 137 ms 147364 KB Output is correct
39 Correct 143 ms 147448 KB Output is correct
40 Correct 138 ms 147448 KB Output is correct
41 Correct 145 ms 147448 KB Output is correct
42 Correct 105 ms 143608 KB Output is correct
43 Correct 96 ms 143480 KB Output is correct
44 Correct 106 ms 143736 KB Output is correct
45 Correct 155 ms 149496 KB Output is correct
46 Correct 147 ms 149752 KB Output is correct
47 Correct 370 ms 158960 KB Output is correct
48 Correct 121 ms 146300 KB Output is correct
49 Correct 110 ms 145960 KB Output is correct
50 Correct 107 ms 145400 KB Output is correct
51 Runtime error 205 ms 248952 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Halted 0 ms 0 KB -