oj.uz

Submission #244786

# Submission time Handle Problem Language Result Execution time Memory
244786 2020-07-05T01:35:53 Z uacoder123 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 245496 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(const ii& a,const 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);
  set<ii> s;
  for(lli i=0;i<5220000;++i)
    dis[i]=1000000000;
  // s.push(mp(0,so));
  s.insert(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();
    ii v=*(s.begin());
    s.erase(s.begin());
    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])
      {
       s.erase(mp(dis[al[v.S][i]%10000000],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)); 
       s.insert(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=160;
    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:39:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if(s.size()>rn*n+n)
        ~~~~~~~~^~~~~~~
skyscraper.cpp:58: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:131:37: warning: 'from' may be used uninitialized in this function [-Wmaybe-uninitialized]
     else cout<<dij(rn*n+from,rn*n+to)<<endl;
                                     ^
skyscraper.cpp:131:37: warning: 'to' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 143352 KB Output is correct
2 Correct 88 ms 143352 KB Output is correct
3 Correct 95 ms 143352 KB Output is correct
4 Correct 86 ms 143352 KB Output is correct
5 Correct 89 ms 143356 KB Output is correct
6 Correct 97 ms 143320 KB Output is correct
7 Correct 86 ms 143352 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 87 ms 143480 KB Output is correct
2 Correct 86 ms 143352 KB Output is correct
3 Correct 86 ms 143352 KB Output is correct
4 Correct 88 ms 143352 KB Output is correct
5 Correct 85 ms 143352 KB Output is correct
6 Correct 88 ms 143352 KB Output is correct
7 Correct 86 ms 143352 KB Output is correct
8 Correct 88 ms 143480 KB Output is correct
9 Correct 94 ms 143352 KB Output is correct
10 Correct 87 ms 143480 KB Output is correct
11 Correct 89 ms 143608 KB Output is correct
12 Correct 86 ms 143352 KB Output is correct
13 Correct 89 ms 143352 KB Output is correct
14 Correct 101 ms 143612 KB Output is correct
15 Correct 94 ms 143832 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 84 ms 143352 KB Output is correct
2 Correct 86 ms 143352 KB Output is correct
3 Correct 87 ms 143480 KB Output is correct
4 Correct 86 ms 143352 KB Output is correct
5 Correct 86 ms 143432 KB Output is correct
6 Correct 88 ms 143352 KB Output is correct
7 Correct 87 ms 143352 KB Output is correct
8 Correct 100 ms 143352 KB Output is correct
9 Correct 85 ms 143352 KB Output is correct
10 Correct 87 ms 143480 KB Output is correct
11 Correct 88 ms 143608 KB Output is correct
12 Correct 97 ms 143352 KB Output is correct
13 Correct 90 ms 143352 KB Output is correct
14 Correct 91 ms 143624 KB Output is correct
15 Correct 103 ms 143736 KB Output is correct
16 Correct 89 ms 143480 KB Output is correct
17 Correct 97 ms 143864 KB Output is correct
18 Correct 90 ms 143480 KB Output is correct
19 Correct 89 ms 143644 KB Output is correct
20 Correct 88 ms 143736 KB Output is correct
21 Correct 91 ms 143480 KB Output is correct
22 Correct 89 ms 143480 KB Output is correct
23 Correct 99 ms 143608 KB Output is correct
24 Correct 101 ms 143864 KB Output is correct
25 Correct 92 ms 143608 KB Output is correct
26 Correct 92 ms 143608 KB Output is correct
27 Correct 99 ms 143608 KB Output is correct
28 Correct 105 ms 144200 KB Output is correct
29 Correct 106 ms 144992 KB Output is correct
30 Correct 90 ms 143736 KB Output is correct
31 Correct 108 ms 144252 KB Output is correct
32 Correct 96 ms 144052 KB Output is correct
33 Correct 124 ms 146680 KB Output is correct
34 Correct 139 ms 147324 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 97 ms 143352 KB Output is correct
2 Correct 88 ms 143352 KB Output is correct
3 Correct 95 ms 143352 KB Output is correct
4 Correct 88 ms 143352 KB Output is correct
5 Correct 93 ms 143480 KB Output is correct
6 Correct 93 ms 143352 KB Output is correct
7 Correct 92 ms 143276 KB Output is correct
8 Correct 94 ms 143352 KB Output is correct
9 Correct 87 ms 143352 KB Output is correct
10 Correct 96 ms 143480 KB Output is correct
11 Correct 88 ms 143608 KB Output is correct
12 Correct 90 ms 143436 KB Output is correct
13 Correct 93 ms 143328 KB Output is correct
14 Correct 87 ms 143608 KB Output is correct
15 Correct 104 ms 143736 KB Output is correct
16 Correct 90 ms 143352 KB Output is correct
17 Correct 107 ms 143864 KB Output is correct
18 Correct 104 ms 143480 KB Output is correct
19 Correct 97 ms 143540 KB Output is correct
20 Correct 92 ms 143736 KB Output is correct
21 Correct 96 ms 143480 KB Output is correct
22 Correct 101 ms 143480 KB Output is correct
23 Correct 92 ms 143540 KB Output is correct
24 Correct 96 ms 143736 KB Output is correct
25 Correct 94 ms 143608 KB Output is correct
26 Correct 93 ms 143608 KB Output is correct
27 Correct 91 ms 143608 KB Output is correct
28 Correct 94 ms 144120 KB Output is correct
29 Correct 104 ms 145144 KB Output is correct
30 Correct 102 ms 143736 KB Output is correct
31 Correct 109 ms 144248 KB Output is correct
32 Correct 96 ms 144120 KB Output is correct
33 Correct 125 ms 146680 KB Output is correct
34 Correct 133 ms 147320 KB Output is correct
35 Correct 146 ms 147192 KB Output is correct
36 Correct 97 ms 144120 KB Output is correct
37 Correct 159 ms 148344 KB Output is correct
38 Correct 159 ms 148472 KB Output is correct
39 Correct 156 ms 148344 KB Output is correct
40 Correct 154 ms 148344 KB Output is correct
41 Correct 161 ms 148344 KB Output is correct
42 Correct 101 ms 143608 KB Output is correct
43 Correct 96 ms 143736 KB Output is correct
44 Correct 113 ms 143736 KB Output is correct
45 Correct 221 ms 154616 KB Output is correct
46 Correct 231 ms 156024 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 85 ms 143352 KB Output is correct
2 Correct 87 ms 143284 KB Output is correct
3 Correct 91 ms 143352 KB Output is correct
4 Correct 87 ms 143352 KB Output is correct
5 Correct 97 ms 143352 KB Output is correct
6 Correct 89 ms 143352 KB Output is correct
7 Correct 85 ms 143352 KB Output is correct
8 Correct 86 ms 143328 KB Output is correct
9 Correct 89 ms 143352 KB Output is correct
10 Correct 91 ms 143608 KB Output is correct
11 Correct 99 ms 143608 KB Output is correct
12 Correct 86 ms 143356 KB Output is correct
13 Correct 87 ms 143480 KB Output is correct
14 Correct 96 ms 143608 KB Output is correct
15 Correct 92 ms 143736 KB Output is correct
16 Correct 87 ms 143356 KB Output is correct
17 Correct 94 ms 143864 KB Output is correct
18 Correct 101 ms 143480 KB Output is correct
19 Correct 94 ms 143480 KB Output is correct
20 Correct 91 ms 143740 KB Output is correct
21 Correct 86 ms 143480 KB Output is correct
22 Correct 87 ms 143608 KB Output is correct
23 Correct 90 ms 143568 KB Output is correct
24 Correct 92 ms 143864 KB Output is correct
25 Correct 88 ms 143612 KB Output is correct
26 Correct 100 ms 143608 KB Output is correct
27 Correct 99 ms 143608 KB Output is correct
28 Correct 92 ms 144120 KB Output is correct
29 Correct 103 ms 145016 KB Output is correct
30 Correct 103 ms 143736 KB Output is correct
31 Correct 97 ms 144248 KB Output is correct
32 Correct 96 ms 144120 KB Output is correct
33 Correct 130 ms 146692 KB Output is correct
34 Correct 140 ms 147320 KB Output is correct
35 Correct 134 ms 146984 KB Output is correct
36 Correct 98 ms 143992 KB Output is correct
37 Correct 156 ms 148344 KB Output is correct
38 Correct 151 ms 148344 KB Output is correct
39 Correct 150 ms 148344 KB Output is correct
40 Correct 162 ms 148368 KB Output is correct
41 Correct 153 ms 148344 KB Output is correct
42 Correct 95 ms 143608 KB Output is correct
43 Correct 96 ms 143608 KB Output is correct
44 Correct 105 ms 143736 KB Output is correct
45 Correct 205 ms 154360 KB Output is correct
46 Correct 221 ms 155896 KB Output is correct
47 Correct 315 ms 159864 KB Output is correct
48 Correct 111 ms 146168 KB Output is correct
49 Correct 109 ms 145912 KB Output is correct
50 Correct 113 ms 145336 KB Output is correct
51 Correct 211 ms 152056 KB Output is correct
52 Correct 223 ms 152996 KB Output is correct
53 Correct 130 ms 147960 KB Output is correct
54 Correct 77 ms 122872 KB Output is correct
55 Correct 93 ms 144120 KB Output is correct
56 Correct 135 ms 148472 KB Output is correct
57 Correct 267 ms 157304 KB Output is correct
58 Correct 110 ms 145400 KB Output is correct
59 Correct 134 ms 146424 KB Output is correct
60 Correct 129 ms 146936 KB Output is correct
61 Correct 130 ms 146424 KB Output is correct
62 Correct 194 ms 156368 KB Output is correct
63 Correct 204 ms 157688 KB Output is correct
64 Correct 199 ms 160760 KB Output is correct
65 Correct 507 ms 180600 KB Output is correct
66 Execution timed out 1109 ms 245496 KB Time limit exceeded
67 Halted 0 ms 0 KB -