oj.uz

Submission #243633

# Submission time Handle Problem Language Result Execution time Memory
243633 2020-07-01T12:53:36 Z NaimSS Jakarta Skyscrapers (APIO15_skyscraper) C++14
22 / 100
 24 ms 25216 KB 
        #include <bits/stdc++.h>
        #define ld long double
        #define endl "\n"
        #define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
        #define pb(x) push_back(x)
        #define mp(a,b) make_pair(a,b)
        #define ms(v,x) memset(v,x,sizeof(v))
        #define all(v) v.begin(),v.end()
        #define ff first
        #define ss second
        #define rep(i, a, b) for(int i = a; i < (b); ++i)
        #define per(i, a, b) for(int i = b-1; i>=a ; i--)
        #define trav(a, x) for(auto& a : x)
        #define allin(a , x) for(auto a : x)
        #define td(v) v.begin(),v.end()
        #define sz(v) (int)v.size()
        //#define int long long
        using namespace std;
        typedef vector<int> vi;
        #define y1 abacaba
        #define left sefude
        #define right sefudermano
        typedef long long ll;
        typedef pair<int,int> pii;
        inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
        ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
        ll exp(ll a,ll b,ll m){
            if(b==0LL) return 1LL;
            if(b==1LL) return mod(a,m);
            ll k = mod(exp(a,b/2,m),m);
            if(b&1LL){
                return mod(a*mod(k*k,m),m);
            }
            else return mod(k*k,m);
        }
         
         
        int n,m;
        const int N = 30100;
        int b[N],p[N];
         
         
        const int sq = 175;
        int vis[N][sq + 15];
         
        int dist[N][sq + 15];
        vi aqui[N];
        int mn[N];
        const int inf = 1e9;
        #define coisa(a,b) pii(a,b)
        #define pwr(x) (x>=sq ? sq + 1 : x)
        #define min(a,b) (a<b ? a : b)
        const int infi  = N * sq ;
        deque<vector<pii>> pq; 

        void djkistra(){
          for(int i=0;i<N;i++){
            mn[i] = inf;
            for(int j=0;j<sq+10;j++)dist[i][j] = inf;
          }
          
          dist[b[0]][pwr(p[0])] =0;
          mn[b[0]] = 0;
          pq.pb(vector<pii>());
          pq[0].pb(coisa(b[0],p[0]));
            
          int cur_d = 0;
          int max_d = 0;
          int out = 0;
          while(true){
            while(cur_d <= max_d and pq[cur_d-out].empty()){
              cur_d++;
              out++;
              pq.pop_front();
            }
            if(cur_d > max_d)break;
            pii c = pq[cur_d-out].back();
            pq[cur_d-out].pop_back();
            if(vis[c.ff][pwr(c.ss)])continue;
            vis[c.ff][pwr(c.ss)]=1;
            int d = dist[c.ff][pwr(c.ss)];
            int id = c.ff;
            int cur = c.ff;
            if(cur == b[1])break;
            if(c.ss < sq){
              aqui[id].pb(c.ss);
            }
         
            for(int x : aqui[id]){
              
                if(x >= sq){
                  int t=0;
                  for(int l = cur-x;l>=0;l-=x){
                    t++;
                    if(mn[l] > d + t){
                      mn[l] = dist[l][sq+1] = d + t;
                      if(mn[l] > max_d)pq.pb(vector<pii>()),max_d++;
                      pq[mn[l] - out].pb(coisa(l,x));
                    }
                  }
                  t=0;
                  for(int l = cur + x;l<n;l+=x){
                    t++;
                    if(mn[l] > d + t){
                      mn[l] = dist[l][sq + 1] = d + t;
                      if(mn[l] > max_d)pq.pb(vector<pii>()),max_d++;
                      pq[mn[l] - out].pb(coisa(l,x));
                    }
                  }
                }else{
                  dist[cur][x] = min(dist[cur][x],d);
                  if(cur - x >=0 and dist[cur-x][x] > d + 1){
                    dist[cur-x][x] = d + 1;
                    if(d+1 > max_d)pq.pb(vector<pii>()),max_d++;
                    if(mn[cur-x] > d+1)mn[cur-x] = d+1;
                    if(!vis[cur-x][x])pq[d+1 - out].pb(coisa(cur - x,x));
                  } 
                  if(cur + x < n and dist[cur + x][x] > d + 1){
                    dist[cur + x][x] = d + 1;
                    if(d+1 > max_d)pq.pb(vector<pii>()),max_d++;
                    if(mn[cur+x] > d+1)mn[cur+x] = d+1;
                    if(!vis[cur+x][x])pq[d+1 - out].pb(coisa(cur + x,x));
                  }
                }
            } 
            aqui[id].clear();
            
         
         
          }  
         
          int res = mn[b[1]];
          if(res == inf)cout<<-1<<endl;
          else cout << res << endl;
        }
         
        int32_t main(){
          fastio;
          cin >> n >> m;
          for(int i=0;i<m;i++){
            cin >> b[i] >> p[i];
            aqui[b[i]].pb(p[i]);
          }
          djkistra();
          // Math -> gcd it all
          // Did u check N=1? Did you switch N,M?
        }

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 23552 KB Output is correct
2 Correct 18 ms 23552 KB Output is correct
3 Correct 18 ms 23552 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 18 ms 23552 KB Output is correct
6 Correct 18 ms 23552 KB Output is correct
7 Correct 18 ms 23552 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23552 KB Output is correct
2 Correct 18 ms 23552 KB Output is correct
3 Correct 18 ms 23552 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 18 ms 23552 KB Output is correct
6 Correct 18 ms 23552 KB Output is correct
7 Correct 18 ms 23552 KB Output is correct
8 Correct 17 ms 23552 KB Output is correct
9 Correct 18 ms 23552 KB Output is correct
10 Correct 18 ms 23680 KB Output is correct
11 Correct 18 ms 23680 KB Output is correct
12 Correct 18 ms 23680 KB Output is correct
13 Correct 18 ms 23680 KB Output is correct
14 Correct 18 ms 23680 KB Output is correct
15 Correct 19 ms 23680 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23552 KB Output is correct
2 Correct 18 ms 23552 KB Output is correct
3 Correct 18 ms 23552 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 18 ms 23552 KB Output is correct
6 Correct 18 ms 23552 KB Output is correct
7 Correct 19 ms 23552 KB Output is correct
8 Correct 18 ms 23552 KB Output is correct
9 Correct 18 ms 23552 KB Output is correct
10 Correct 18 ms 23680 KB Output is correct
11 Correct 18 ms 23680 KB Output is correct
12 Correct 18 ms 23680 KB Output is correct
13 Correct 18 ms 23680 KB Output is correct
14 Correct 18 ms 23680 KB Output is correct
15 Correct 19 ms 23680 KB Output is correct
16 Correct 18 ms 23552 KB Output is correct
17 Correct 19 ms 24192 KB Output is correct
18 Correct 18 ms 23680 KB Output is correct
19 Correct 18 ms 23680 KB Output is correct
20 Correct 19 ms 25088 KB Output is correct
21 Correct 18 ms 23552 KB Output is correct
22 Correct 18 ms 23680 KB Output is correct
23 Correct 19 ms 24832 KB Output is correct
24 Correct 20 ms 25088 KB Output is correct
25 Correct 21 ms 24448 KB Output is correct
26 Correct 20 ms 25088 KB Output is correct
27 Incorrect 20 ms 25088 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 23552 KB Output is correct
2 Correct 19 ms 23552 KB Output is correct
3 Correct 19 ms 23552 KB Output is correct
4 Correct 20 ms 23552 KB Output is correct
5 Correct 18 ms 23552 KB Output is correct
6 Correct 18 ms 23552 KB Output is correct
7 Correct 18 ms 23612 KB Output is correct
8 Correct 18 ms 23552 KB Output is correct
9 Correct 18 ms 23552 KB Output is correct
10 Correct 18 ms 23680 KB Output is correct
11 Correct 18 ms 23680 KB Output is correct
12 Correct 18 ms 23712 KB Output is correct
13 Correct 18 ms 23680 KB Output is correct
14 Correct 20 ms 23680 KB Output is correct
15 Correct 19 ms 23680 KB Output is correct
16 Correct 18 ms 23680 KB Output is correct
17 Correct 19 ms 24192 KB Output is correct
18 Correct 19 ms 23552 KB Output is correct
19 Correct 18 ms 23680 KB Output is correct
20 Correct 19 ms 25088 KB Output is correct
21 Correct 18 ms 23680 KB Output is correct
22 Correct 18 ms 23552 KB Output is correct
23 Correct 24 ms 24832 KB Output is correct
24 Correct 19 ms 25088 KB Output is correct
25 Correct 19 ms 24448 KB Output is correct
26 Correct 20 ms 25088 KB Output is correct
27 Incorrect 21 ms 25088 KB Output isn't correct
28 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23552 KB Output is correct
2 Correct 18 ms 23552 KB Output is correct
3 Correct 18 ms 23552 KB Output is correct
4 Correct 18 ms 23552 KB Output is correct
5 Correct 18 ms 23552 KB Output is correct
6 Correct 19 ms 23552 KB Output is correct
7 Correct 18 ms 23552 KB Output is correct
8 Correct 17 ms 23552 KB Output is correct
9 Correct 18 ms 23552 KB Output is correct
10 Correct 18 ms 23680 KB Output is correct
11 Correct 18 ms 23680 KB Output is correct
12 Correct 18 ms 23680 KB Output is correct
13 Correct 19 ms 23680 KB Output is correct
14 Correct 18 ms 23680 KB Output is correct
15 Correct 18 ms 23680 KB Output is correct
16 Correct 18 ms 23552 KB Output is correct
17 Correct 19 ms 24192 KB Output is correct
18 Correct 21 ms 23552 KB Output is correct
19 Correct 18 ms 23680 KB Output is correct
20 Correct 20 ms 25216 KB Output is correct
21 Correct 19 ms 23680 KB Output is correct
22 Correct 18 ms 23680 KB Output is correct
23 Correct 19 ms 24832 KB Output is correct
24 Correct 20 ms 25088 KB Output is correct
25 Correct 19 ms 24448 KB Output is correct
26 Correct 22 ms 25216 KB Output is correct
27 Incorrect 19 ms 25088 KB Output isn't correct
28 Halted 0 ms 0 KB -