oj.uz

Submission #245159

# Submission time Handle Problem Language Result Execution time Memory
245159 2020-07-05T16:04:45 Z b00n0rp Jakarta Skyscrapers (APIO15_skyscraper) C++17
36 / 100
 315 ms 262144 KB 
// --------------------------------------------------<TEMPLATE>--------------------------------------------------
// --------------------<optimizations>--------------------
#pragma GCC optimize("Ofast,unroll-loops")
/* I don't understand these pragmas at all. 
   Earlier I added all the optimizations I could find but 
   upon my short amount of testing, these 2 are enough and adding more makes it slower. */
 
// -------------------</optimizations>--------------------
 
// ---------------<Headers and namespaces>----------------
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <ratio>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
 
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
*/
 
// ---------------</Headers and namespaces>---------------
 
// -----------------<Defines and typedefs>----------------
// typedef tree<int,null_type,less<int>,rb_tree_tag, \
tree_order_statistics_node_update> indexed_set; // use less_equal for multiset
// order_of_key (val): returns the no. of values less than val
// find_by_order (k): returns the iterator to kth largest element.(0-based)
 
typedef long double LD;
typedef long long ll;
#define int ll
#define pb push_back
#define mp make_pair
#define REP(i,n) for (int i = 0; i < n; i++)
#define FOR(i,a,b) for (int i = a; i < b; i++)
#define REPD(i,n) for (int i = n-1; i >= 0; i--)
#define FORD(i,a,b) for (int i = a; i >= b; i--)
#define remax(a,b) a = max(a,b)
#define remin(a,b) a = min(a,b)
#define all(v) v.begin(),v.end()
typedef map<int,int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int,int> pii;
typedef vector<pii> vpii;
#define F first
#define S second
#define PQ(type) priority_queue<type>
#define PQD(type) priority_queue<type,vector<type>,greater<type> >
#define ITR :: iterator it
#define WL(t) while(t --)
#define SZ(x) ((int)(x).size())
#define runtime() ((double)clock() / CLOCKS_PER_SEC)
#define TR(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define sqr(x) ((x)*(x))
#define inrange(i,a,b) ((i>=min(a,b)) && (i<=max(a,b)))
 
// -----<SCANF>-----
#define sfi(x) scanf("%d",&x);
#define sfi2(x,y) scanf("%d%d",&x,&y);
#define sfi3(x,y,z) scanf("%d%d%d",&x,&y,&z);
 
#define sfl(x) scanf("%lld",&x);
#define sfl2(x,y) scanf("%lld%lld",&x,&y);
#define sfl3(x,y,z) scanf("%lld%lld%lld",&x,&y,&z);
#define sfl4(x,y,z,x1) scanf("%lld%lld%lld%lld",&x,&y,&z,&x1);
#define sfl5(x,y,z,x1,y1) scanf("%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1);
#define sfl6(x,y,z,x1,y1,z1) scanf("%lld%lld%lld%lld%lld%lld",&x,&y,&z,&x1,&y1,&z1);
 
#define sfs(x) scanf("%s",x);
#define sfs2(x,y) scanf("%s%s",x,y);
#define sfs3(x,y,z) scanf("%s%s%s",x,y,z);
// ----</SCANF>-----
 
// ----<PRINTF>-----
#define pfi(x) printf("%d\n",x);
#define pfi2(x,y) printf("%d %d\n",x,y);
#define pfi3(x,y,z) printf("%d %d %d\n",x,y,z);
 
#define pfl(x) printf("%lld\n",x);
#define pfl2(x,y) printf("%lld %lld\n",x,y);
#define pfl3(x,y,z) printf("%lld %lld %lld\n",x,y,z);
 
#define pfs(x) printf("%s\n",x);
#define pfs2(x,y) printf("%s %s\n",x,y);
#define pfs3(x,y,z) printf("%s %s %s\n",x,y,z);
 
#define pwe(x) printf("%lld ",x); // print without end
// ----</PRINTF>----
 
#define FLSH fflush(stdout)
#define fileIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);
#define PRECISION(x) cout << fixed << setprecision(x); 
#define FAST_IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
 
// ----------------</Defines and typedefs>----------------
 
// -------------------<Debugging stuff>-------------------
#define TRACE
 
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}
#else
#define trace(...)
#endif
 
// ------------------</Debugging stuff>-------------------
 
// ------------------------<Consts>-----------------------
const int MAXN = 30000;
const int SQRTN = 200;
const int LOGN = 22;
const double PI=acos(-1);
 
#ifdef int
const int INF=1e16;
#else
const int INF=1e9;
#endif
 
const int MOD = 1000000007;
const int FMOD = 998244353;
const double eps = 1e-9;
 
// -----------------------</Consts>-----------------------
 
// -------------------------<RNG>-------------------------
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count()); 
#define SHUF(v) shuffle(all(v), RNG);
// Use mt19937_64 for 64 bit random numbers.
 
// ------------------------</RNG>-------------------------
 
// ----------------------<MATH>---------------------------
template<typename T> T gcd(T a, T b){return(b?__gcd(a,b):a);}
template<typename T> T lcm(T a, T b){return(a*(b/gcd(a,b)));}
int add(int a, int b, int c = MOD){int res=a+b;return(res>=c?res-c:res);}
int mod_neg(int a, int b, int c = MOD){int res;if(abs(a-b)<c)res=a-b;else res=(a-b)%c;return(res<0?res+c:res);}
int mul(int a, int b, int c = MOD){ll res=(ll)a*b;return(res>=c?res%c:res);}
int muln(int a, int b, int c = MOD){ll res=(ll)a*b;return ((res%c)+c)%c;}
ll mulmod(ll a,ll b, ll m = MOD){ll q = (ll)(((LD)a*(LD)b)/(LD)m);ll r=a*b-q*m;if(r>m)r%=m;if(r<0)r+=m;return r;}
template<typename T>T expo(T e, T n){T x=1,p=e;while(n){if(n&1)x=x*p;p=p*p;n>>=1;}return x;}
template<typename T>T power(T e, T n, T m = MOD){T x=1,p=e;while(n){if(n&1)x=mul(x,p,m);p=mul(p,p,m);n>>=1;}return x;}
template<typename T>T extended_euclid(T a, T b, T &x, T &y){T xx=0,yy=1;y=0;x=1;while(b){T q=a/b,t=b;b=a%b;a=t;\
t=xx;xx=x-q*xx;x=t;t=yy;yy=y-q*yy;y=t;}return a;}
template<typename T>T mod_inverse(T a, T n = MOD){T x,y,z=0;T d=extended_euclid(a,n,x,y);return(d>1?-1:mod_neg(x,z,n));}
 
const int FACSZ = 1; // Make sure to change this
 
int fact[FACSZ],ifact[FACSZ];
 
void precom(int c = MOD){
    fact[0] = 1;
    FOR(i,1,FACSZ) fact[i] = mul(fact[i-1],i,c);
    ifact[FACSZ-1] = mod_inverse(fact[FACSZ-1],c);
    REPD(i,FACSZ-1){
        ifact[i] = mul(i+1,ifact[i+1],c);
    }
}
 
int ncr(int n,int r,int c = MOD){
    return mul(mul(ifact[r],ifact[n-r],c),fact[n],c);
} 
// ----------------------</MATH>--------------------------
// --------------------------------------------------</TEMPLATE>--------------------------------------------------
 
void solvethetestcase();
 
signed main(){
    // (UNCOMMENT FOR CIN/COUT) \
    FAST_IO
    PRECISION(10)
 
    int t = 1;
    // (UNCOMMENT FOR MULTIPLE TEST CASES) \
    sfl(t);
    FOR(testcase,1,t+1){
        // (UNCOMMENT FOR CODEJAM) \
        printf("Case #%lld: ",testcase); 
        solvethetestcase();
    }
}   
 
int n,m,st,fin;
vpii adj[MAXN+5][SQRTN+5]; // weight 0
vpii g[MAXN+5];
int dist[MAXN+5][SQRTN+5];

int dijkstra(){
    REP(i,MAXN) REP(j,SQRTN+1) dist[i][j] = INF;
    dist[st][0] = 0;
    priority_queue<pair<int,pii> ,vector<pair<int,pii> >,greater<pair<int,pii> > > pq;
    pq.push({0,{st,0}});
    while(pq.size()){
        pair<int,pii> lol = pq.top();
        pii u = lol.S;
        int d = lol.F;  
        pq.pop();
        // trace(u.F,u.S,d,pq.size());
        if(u.F == fin) return d;

        if(dist[u.F][u.S] != d) continue;

        if(u.S == 0){
            for(auto v:g[u.F]){
                // trace(u.F,v.F,v.S);
                if(dist[v.F][0] > d+v.S){
                    dist[v.F][0] = d+v.S;
                    pq.push({dist[v.F][0],{v.F,0}});
                }
            }
            // trace(0,pq.size());
        }
        else{
            if(u.F+u.S < n and dist[u.F+u.S][u.S] > d+1){
                dist[u.F+u.S][u.S] = d+1;
                pq.push({dist[u.F+u.S][u.S],{u.F+u.S,u.S}});
            }
            if(u.F-u.S >= 0 and dist[u.F-u.S][u.S] > d+1){
                dist[u.F-u.S][u.S] = d+1;
                pq.push({dist[u.F-u.S][u.S],{u.F-u.S,u.S}});
            }
            // trace(1,pq.size());
        }
        for(auto v:adj[u.F][u.S]){
            // trace(u.F,u.S,v.F,u.S);
            if(dist[v.F][v.S] > d){
                dist[v.F][v.S] = d;
                pq.push({dist[v.F][v.S],{v.F,v.S}});
            }
        }
        // trace(pq.size());
    }
    return -1;
}
 
void solvethetestcase(){
    sfl2(n,m)
    REP(i,m){
        int b,p; sfl2(b,p)
        FOR(j,1,SQRTN+1){
            // trace(b,j,b,0);
            adj[b][j].pb({b,0});
        }
        if(p <= SQRTN){
            adj[b][0].pb({b,p});
        }
        else{
            for(int i = b+p; i < n; i+=p){
                g[b].pb({i,(i-b)/p});
            }
            for(int i = b-p; i >= 0; i-=p){
                g[b].pb({i,(b-i)/p});
            }
        }
        if(!i) st = b;
        if(i == 1) fin = b;
    }
    cout << dijkstra() << endl;
}

Compilation message

skyscraper.cpp:54:1: warning: multi-line comment [-Wcomment]
 // typedef tree<int,null_type,less<int>,rb_tree_tag, \
 ^
skyscraper.cpp:210:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR CIN/COUT) \
     ^
skyscraper.cpp:215:5: warning: multi-line comment [-Wcomment]
     // (UNCOMMENT FOR MULTIPLE TEST CASES) \
     ^
skyscraper.cpp:218:9: warning: multi-line comment [-Wcomment]
         // (UNCOMMENT FOR CODEJAM) \
         ^
skyscraper.cpp: In function 'void solvethetestcase()':
skyscraper.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
skyscraper.cpp:278:5: note: in expansion of macro 'sfl2'
     sfl2(n,m)
     ^~~~
skyscraper.cpp:94:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
 #define sfl2(x,y) scanf("%lld%lld",&x,&y);
                   ~~~~~^~~~~~~~~~~~~~~~~~
skyscraper.cpp:280:18: note: in expansion of macro 'sfl2'
         int b,p; sfl2(b,p)
                  ^~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 193656 KB Output is correct
2 Correct 114 ms 193656 KB Output is correct
3 Correct 117 ms 193656 KB Output is correct
4 Correct 115 ms 193656 KB Output is correct
5 Correct 114 ms 193580 KB Output is correct
6 Correct 118 ms 193688 KB Output is correct
7 Correct 122 ms 193656 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 116 ms 193680 KB Output is correct
2 Correct 123 ms 193656 KB Output is correct
3 Correct 113 ms 193660 KB Output is correct
4 Correct 111 ms 193656 KB Output is correct
5 Correct 128 ms 193656 KB Output is correct
6 Correct 117 ms 193656 KB Output is correct
7 Correct 113 ms 193656 KB Output is correct
8 Correct 119 ms 193676 KB Output is correct
9 Correct 115 ms 193868 KB Output is correct
10 Correct 124 ms 195576 KB Output is correct
11 Correct 136 ms 203000 KB Output is correct
12 Correct 125 ms 200312 KB Output is correct
13 Correct 122 ms 200696 KB Output is correct
14 Correct 143 ms 202576 KB Output is correct
15 Correct 132 ms 202616 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 126 ms 193656 KB Output is correct
2 Correct 125 ms 193656 KB Output is correct
3 Correct 126 ms 193656 KB Output is correct
4 Correct 118 ms 193656 KB Output is correct
5 Correct 114 ms 193656 KB Output is correct
6 Correct 113 ms 193656 KB Output is correct
7 Correct 112 ms 193656 KB Output is correct
8 Correct 116 ms 193784 KB Output is correct
9 Correct 114 ms 193912 KB Output is correct
10 Correct 115 ms 195576 KB Output is correct
11 Correct 126 ms 202744 KB Output is correct
12 Correct 122 ms 200336 KB Output is correct
13 Correct 119 ms 200696 KB Output is correct
14 Correct 141 ms 202616 KB Output is correct
15 Correct 133 ms 202488 KB Output is correct
16 Correct 131 ms 197752 KB Output is correct
17 Correct 131 ms 202488 KB Output is correct
18 Correct 123 ms 199288 KB Output is correct
19 Correct 117 ms 196984 KB Output is correct
20 Correct 133 ms 206204 KB Output is correct
21 Correct 124 ms 199288 KB Output is correct
22 Correct 118 ms 197752 KB Output is correct
23 Correct 123 ms 199008 KB Output is correct
24 Correct 136 ms 203768 KB Output is correct
25 Correct 133 ms 204408 KB Output is correct
26 Correct 119 ms 201080 KB Output is correct
27 Correct 121 ms 200824 KB Output is correct
28 Correct 138 ms 206200 KB Output is correct
29 Correct 127 ms 196728 KB Output is correct
30 Correct 116 ms 194296 KB Output is correct
31 Correct 119 ms 195960 KB Output is correct
32 Correct 117 ms 196088 KB Output is correct
33 Correct 143 ms 202488 KB Output is correct
34 Correct 140 ms 202360 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 114 ms 193656 KB Output is correct
2 Correct 117 ms 193624 KB Output is correct
3 Correct 113 ms 193784 KB Output is correct
4 Correct 111 ms 193656 KB Output is correct
5 Correct 112 ms 193656 KB Output is correct
6 Correct 117 ms 193656 KB Output is correct
7 Correct 112 ms 193784 KB Output is correct
8 Correct 114 ms 193784 KB Output is correct
9 Correct 113 ms 193912 KB Output is correct
10 Correct 117 ms 195576 KB Output is correct
11 Correct 134 ms 202744 KB Output is correct
12 Correct 121 ms 200312 KB Output is correct
13 Correct 125 ms 200824 KB Output is correct
14 Correct 127 ms 202488 KB Output is correct
15 Correct 128 ms 202488 KB Output is correct
16 Correct 134 ms 197752 KB Output is correct
17 Correct 146 ms 202488 KB Output is correct
18 Correct 123 ms 199288 KB Output is correct
19 Correct 122 ms 197064 KB Output is correct
20 Correct 135 ms 206200 KB Output is correct
21 Correct 125 ms 199288 KB Output is correct
22 Correct 119 ms 197752 KB Output is correct
23 Correct 124 ms 199032 KB Output is correct
24 Correct 139 ms 203748 KB Output is correct
25 Correct 150 ms 204408 KB Output is correct
26 Correct 121 ms 201080 KB Output is correct
27 Correct 122 ms 200952 KB Output is correct
28 Correct 140 ms 206200 KB Output is correct
29 Correct 126 ms 196860 KB Output is correct
30 Correct 116 ms 194424 KB Output is correct
31 Correct 122 ms 195960 KB Output is correct
32 Correct 121 ms 196088 KB Output is correct
33 Correct 142 ms 202304 KB Output is correct
34 Correct 136 ms 202360 KB Output is correct
35 Runtime error 281 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
36 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 122 ms 193656 KB Output is correct
2 Correct 115 ms 193736 KB Output is correct
3 Correct 125 ms 193656 KB Output is correct
4 Correct 117 ms 193656 KB Output is correct
5 Correct 125 ms 193656 KB Output is correct
6 Correct 115 ms 193656 KB Output is correct
7 Correct 126 ms 193656 KB Output is correct
8 Correct 113 ms 193784 KB Output is correct
9 Correct 127 ms 193912 KB Output is correct
10 Correct 117 ms 195576 KB Output is correct
11 Correct 130 ms 202872 KB Output is correct
12 Correct 130 ms 200312 KB Output is correct
13 Correct 132 ms 200696 KB Output is correct
14 Correct 127 ms 202488 KB Output is correct
15 Correct 127 ms 202488 KB Output is correct
16 Correct 122 ms 197752 KB Output is correct
17 Correct 152 ms 202488 KB Output is correct
18 Correct 143 ms 199288 KB Output is correct
19 Correct 128 ms 196856 KB Output is correct
20 Correct 136 ms 206200 KB Output is correct
21 Correct 125 ms 199288 KB Output is correct
22 Correct 126 ms 197752 KB Output is correct
23 Correct 128 ms 199032 KB Output is correct
24 Correct 134 ms 203768 KB Output is correct
25 Correct 138 ms 204408 KB Output is correct
26 Correct 139 ms 201140 KB Output is correct
27 Correct 125 ms 200928 KB Output is correct
28 Correct 156 ms 206200 KB Output is correct
29 Correct 141 ms 196728 KB Output is correct
30 Correct 119 ms 194296 KB Output is correct
31 Correct 135 ms 195960 KB Output is correct
32 Correct 139 ms 196088 KB Output is correct
33 Correct 176 ms 202488 KB Output is correct
34 Correct 141 ms 202360 KB Output is correct
35 Runtime error 315 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
36 Halted 0 ms 0 KB -