oj.uz

Submission #331161

# Submission time Handle Problem Language Result Execution time Memory
331161 2020-11-27T15:53:12 Z ec1117 Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 315 ms 77448 KB 
#include "bits/stdc++.h"

using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str; 

typedef pair<int,int> pi;
typedef pair<pi, int> pii;
typedef pair<ll,ll> pl; 
typedef pair<db,db> pd; 

typedef vector<int> vi; 
typedef vector<bool> vb; 
typedef vector<ll> vl; 
typedef vector<db> vd; 
typedef vector<str> vs; 
typedef vector<pi> vpi;
typedef vector<pl> vpl; 
typedef vector<pd> vpd; 
template<class T> using V = vector<T>; 
template<class T, size_t SZ> using AR = array<T,SZ>; 

#define mp make_pair
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend() 
#define sor(x) sort(all(x)) 
#define rsz resize
#define ins insert 
#define ft front() 
#define bk back()
#define pf push_front 
#define pb push_back
#define eb emplace_back 
#define lb lower_bound 
#define ub upper_bound 

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define For(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define Rof(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

template<class T> bool ckmin(T& a, const T& b) { 
        return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
        return a < b ? a = b, 1 : 0; } 
constexpr int pct(int x) { return __builtin_popcount(x); } 
constexpr int bits(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
ll cdiv(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll fdiv(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down
ll half(ll x) { return fdiv(x,2); }

template<class T, class U> T fstTrue(T lo, T hi, U f) { 
        // note: if (lo+hi)/2 is used instead of half(lo+hi) then this will loop infinitely when lo=hi
        hi ++; assert(lo <= hi); // assuming f is increasing
        while (lo < hi) { // find first index such that f is true 
                T mid = half(lo+hi);
                f(mid) ? hi = mid : lo = mid+1; 
        } 
        return lo;
}
template<class T, class U> T lstTrue(T lo, T hi, U f) {
        lo --; assert(lo <= hi); // assuming f is decreasing
        while (lo < hi) { // find first index such that f is true 
                T mid = half(lo+hi+1);
                f(mid) ? lo = mid : hi = mid-1;
        } 
        return lo;
}
template<class T> void remDup(vector<T>& v) { 
        sort(all(v)); v.erase(unique(all(v)),end(v)); }

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
str ts(char c) { return str(1,c); }
str ts(const char* s) { return (str)s; }
str ts(str s) { return s; }
str ts(bool b) { 
        #ifdef LOCAL
                return b ? "true" : "false"; 
        #else 
                return ts((int)b);
        #endif
}
template<class A> str ts(complex<A> c) { 
        stringstream ss; ss << c; return ss.str(); }
str ts(vector<bool> v) {
        str res = "{"; F0R(i,sz(v)) res += char('0'+v[i]);
        res += "}"; return res; }
template<size_t SZ> str ts(bitset<SZ> b) {
        str res = ""; F0R(i,SZ) res += char('0'+b[i]);
        return res; }
template<class A, class B> str ts(pair<A,B> p);
template<class T> str ts(T v) { // containers with begin(), end()
        #ifdef LOCAL
                bool fst = 1; str res = "{";
                for (const auto& x: v) {
                        if (!fst) res += ", ";
                        fst = 0; res += ts(x);
                }
                res += "}"; return res;
        #else
                bool fst = 1; str res = "";
                for (const auto& x: v) {
                        if (!fst) res += " ";
                        fst = 0; res += ts(x);
                }
                return res;

        #endif
}
template<class A, class B> str ts(pair<A,B> p) {
        #ifdef LOCAL
                return "("+ts(p.f)+", "+ts(p.s)+")"; 
        #else
                return ts(p.f)+" "+ts(p.s);
        #endif
}

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
        pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
        pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
        cerr << ts(h); if (sizeof...(t)) cerr << ", ";
        DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL, chk -> fake assert
        #define dbg(...) cerr << "Line(" << __LINE__ << ") -> [" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
        #define chk(...) if (!(__VA_ARGS__)) cerr << "Line(" << __LINE__ << ") -> function(" \
                 << __FUNCTION__  << ") -> CHK FAILED: (" << #__VA_ARGS__ << ")" << "\n", exit(0);
#else
        #define dbg(...) 0
        #define chk(...) 0
#endif

int gcd(int a, int b) {if (b == 0)return a;return gcd(b, a % b);}
int max(int a,int b, int c){return max(a,max(b,c));}
int min(int a,int b, int c){return min(a,min(b,c));}
ll max(ll a,ll b, ll c){return max(a,max(b,c));}
ll min(ll a,ll b, ll c){return min(a,min(b,c));}
void dbga(int arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
void dbga(ll arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}

// FILE I/O
void setIn(str s) { freopen(s.c_str(),"r",stdin); }
void setOut(str s) { freopen(s.c_str(),"w",stdout); }
void unsyncIO() { cin.tie(0)->sync_with_stdio(0); }
void setIO(str s = "") {
        unsyncIO();
        // cin.exceptions(cin.failbit); 
        // throws exception when do smth illegal
        // ex. try to read letter into int
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
}
// 576743 29995400689069LL
const int MOD = 1e9+7; // 998244353;
const int MX = 3e4+5;
const ll INF = 1e18;
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1};
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());

map<pi,vi> m;
set<int> a[MX];//mods
vpi adj[MX];
pi og[MX];

void solve(){
    int N,M;re(N,M);
    For(i,M){
        int b,p;re(b,p);
        a[p].ins(b%p);
        m[mp(p,b%p)].pb(b);
        og[i]=mp(b,p);
    }
    For(i,N){
        trav(x,a[i]){//residues
            vi v=m[mp(i,x)];//basically just need to connect all v to j
            v.pb(-MOD);v.pb(MOD);
            sort(all(v));
            dbg(v,x);
            for(int j=x;j<N;j+=i){
                int hi=lb(all(v),j)-v.begin();
                assert(hi!=0 && hi!=sz(v));
                int d1=v[hi]-j, d2=abs(v[hi-1]-j);
                dbg(j,hi,d1,d2);
                if(v[hi]==j){
                    if(v[hi-1]!=MOD && v[hi-1]!=-MOD)adj[v[hi-1]].pb(mp(j,(d2/i)));
                    if(v[hi+1]!=MOD && v[hi+1]!=-MOD)adj[v[hi+1]].pb(mp(j,((v[hi+1]-j)/i)));
                    continue;
                }
                if(v[hi]!=MOD && v[hi]!=-MOD)adj[v[hi]].pb(mp(j,(d1/i)));
                if(v[hi-1]!=MOD && v[hi-1]!=-MOD)adj[v[hi-1]].pb(mp(j,(d2/i)));
            }
        }
    }

    priority_queue<pi,vpi,greater<pi>> pq;
    vi vis(N,MOD);
    pq.push(mp(0,og[0].f));
    vis[og[0].f]=0;
    For(i,5)dbg(adj[i]);
    while(!pq.empty()){
        pi x=pq.top();pq.pop();
        dbg(x);
        trav(y,adj[x.s]){
            if(x.f+y.s<vis[y.f]){
                vis[y.f]=x.f+y.s;
                pq.push(mp(x.f+y.s,y.f));
            }
        }
    }
    if(vis[og[1].f]==MOD)ps(-1);
    else ps(vis[og[1].f]);
}

int main() {
        setIO();
        int t=1;
        // re(t);
        while(t--)solve();
        // you should actually read the stuff at the bottom
}

//psums, bsearch, two pointers
/* stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * think of simple solution first
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
*/

Compilation message

skyscraper.cpp: In function 'void dbga(int*, int)':
skyscraper.cpp:163:26: warning: statement has no effect [-Wunused-value]
  163 |         #define dbg(...) 0
      |                          ^
skyscraper.cpp:172:55: note: in expansion of macro 'dbg'
  172 | void dbga(int arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
      |                                                       ^~~
skyscraper.cpp: In function 'void dbga(ll*, int)':
skyscraper.cpp:163:26: warning: statement has no effect [-Wunused-value]
  163 |         #define dbg(...) 0
      |                          ^
skyscraper.cpp:173:54: note: in expansion of macro 'dbg'
  173 | void dbga(ll arr[], int n){vi v;For(i,n)v.pb(arr[i]);dbg(v);}
      |                                                      ^~~
skyscraper.cpp: In function 'void solve()':
skyscraper.cpp:163:26: warning: statement has no effect [-Wunused-value]
  163 |         #define dbg(...) 0
      |                          ^
skyscraper.cpp:212:13: note: in expansion of macro 'dbg'
  212 |             dbg(v,x);
      |             ^~~
skyscraper.cpp:163:26: warning: statement has no effect [-Wunused-value]
  163 |         #define dbg(...) 0
      |                          ^
skyscraper.cpp:217:17: note: in expansion of macro 'dbg'
  217 |                 dbg(j,hi,d1,d2);
      |                 ^~~
skyscraper.cpp:163:26: warning: statement has no effect [-Wunused-value]
  163 |         #define dbg(...) 0
      |                          ^
skyscraper.cpp:233:13: note: in expansion of macro 'dbg'
  233 |     For(i,5)dbg(adj[i]);
      |             ^~~
skyscraper.cpp:163:26: warning: statement has no effect [-Wunused-value]
  163 |         #define dbg(...) 0
      |                          ^
skyscraper.cpp:236:9: note: in expansion of macro 'dbg'
  236 |         dbg(x);
      |         ^~~
skyscraper.cpp: In function 'void setIn(str)':
skyscraper.cpp:176:28: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  176 | void setIn(str s) { freopen(s.c_str(),"r",stdin); }
      |                     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp: In function 'void setOut(str)':
skyscraper.cpp:177:29: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
  177 | void setOut(str s) { freopen(s.c_str(),"w",stdout); }
      |                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2412 KB Output is correct
2 Correct 2 ms 2412 KB Output is correct
3 Correct 2 ms 2412 KB Output is correct
4 Correct 2 ms 2412 KB Output is correct
5 Correct 2 ms 2412 KB Output is correct
6 Correct 3 ms 2412 KB Output is correct
7 Correct 2 ms 2412 KB Output is correct
8 Correct 2 ms 2412 KB Output is correct
9 Correct 2 ms 2412 KB Output is correct
10 Correct 2 ms 2540 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 2 ms 2540 KB Output is correct
13 Correct 2 ms 2540 KB Output is correct
14 Correct 4 ms 2796 KB Output is correct
15 Correct 4 ms 2796 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2432 KB Output is correct
2 Correct 2 ms 2412 KB Output is correct
3 Correct 2 ms 2412 KB Output is correct
4 Correct 2 ms 2412 KB Output is correct
5 Correct 2 ms 2432 KB Output is correct
6 Correct 2 ms 2412 KB Output is correct
7 Correct 2 ms 2412 KB Output is correct
8 Correct 2 ms 2412 KB Output is correct
9 Correct 2 ms 2412 KB Output is correct
10 Correct 2 ms 2540 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 2 ms 2540 KB Output is correct
13 Correct 2 ms 2540 KB Output is correct
14 Correct 4 ms 2816 KB Output is correct
15 Correct 4 ms 2796 KB Output is correct
16 Correct 3 ms 2668 KB Output is correct
17 Correct 4 ms 2924 KB Output is correct
18 Correct 3 ms 2668 KB Output is correct
19 Correct 3 ms 2668 KB Output is correct
20 Correct 4 ms 2540 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 3 ms 2668 KB Output is correct
23 Correct 3 ms 2668 KB Output is correct
24 Correct 6 ms 3052 KB Output is correct
25 Correct 5 ms 2924 KB Output is correct
26 Correct 3 ms 2668 KB Output is correct
27 Correct 3 ms 2668 KB Output is correct
28 Correct 5 ms 3052 KB Output is correct
29 Correct 6 ms 3436 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 4 ms 3052 KB Output is correct
32 Correct 4 ms 2924 KB Output is correct
33 Correct 10 ms 4332 KB Output is correct
34 Correct 10 ms 4348 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2412 KB Output is correct
2 Correct 2 ms 2412 KB Output is correct
3 Correct 3 ms 2412 KB Output is correct
4 Correct 2 ms 2412 KB Output is correct
5 Correct 2 ms 2412 KB Output is correct
6 Correct 2 ms 2412 KB Output is correct
7 Correct 2 ms 2412 KB Output is correct
8 Correct 2 ms 2412 KB Output is correct
9 Correct 2 ms 2412 KB Output is correct
10 Correct 2 ms 2540 KB Output is correct
11 Correct 5 ms 2796 KB Output is correct
12 Correct 2 ms 2540 KB Output is correct
13 Correct 2 ms 2540 KB Output is correct
14 Correct 4 ms 2796 KB Output is correct
15 Correct 4 ms 2796 KB Output is correct
16 Correct 3 ms 2668 KB Output is correct
17 Correct 5 ms 2924 KB Output is correct
18 Correct 3 ms 2668 KB Output is correct
19 Correct 3 ms 2668 KB Output is correct
20 Correct 3 ms 2540 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 3 ms 2668 KB Output is correct
23 Correct 3 ms 2668 KB Output is correct
24 Correct 38 ms 3052 KB Output is correct
25 Correct 5 ms 2924 KB Output is correct
26 Correct 3 ms 2668 KB Output is correct
27 Correct 3 ms 2668 KB Output is correct
28 Correct 5 ms 3052 KB Output is correct
29 Correct 6 ms 3436 KB Output is correct
30 Correct 3 ms 2796 KB Output is correct
31 Correct 4 ms 3052 KB Output is correct
32 Correct 4 ms 2924 KB Output is correct
33 Correct 10 ms 4352 KB Output is correct
34 Correct 10 ms 4348 KB Output is correct
35 Correct 33 ms 7916 KB Output is correct
36 Correct 7 ms 3436 KB Output is correct
37 Correct 29 ms 7788 KB Output is correct
38 Correct 44 ms 9324 KB Output is correct
39 Correct 45 ms 9324 KB Output is correct
40 Correct 47 ms 9452 KB Output is correct
41 Correct 45 ms 9324 KB Output is correct
42 Correct 8 ms 3308 KB Output is correct
43 Correct 8 ms 3308 KB Output is correct
44 Correct 8 ms 3308 KB Output is correct
45 Correct 56 ms 12396 KB Output is correct
46 Correct 54 ms 12396 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2412 KB Output is correct
2 Correct 2 ms 2412 KB Output is correct
3 Correct 2 ms 2412 KB Output is correct
4 Correct 2 ms 2412 KB Output is correct
5 Correct 2 ms 2412 KB Output is correct
6 Correct 2 ms 2412 KB Output is correct
7 Correct 2 ms 2412 KB Output is correct
8 Correct 2 ms 2412 KB Output is correct
9 Correct 2 ms 2412 KB Output is correct
10 Correct 2 ms 2540 KB Output is correct
11 Correct 4 ms 2796 KB Output is correct
12 Correct 3 ms 2540 KB Output is correct
13 Correct 2 ms 2540 KB Output is correct
14 Correct 4 ms 2796 KB Output is correct
15 Correct 4 ms 2796 KB Output is correct
16 Correct 3 ms 2668 KB Output is correct
17 Correct 4 ms 2924 KB Output is correct
18 Correct 3 ms 2688 KB Output is correct
19 Correct 3 ms 2668 KB Output is correct
20 Correct 3 ms 2540 KB Output is correct
21 Correct 3 ms 2668 KB Output is correct
22 Correct 3 ms 2668 KB Output is correct
23 Correct 3 ms 2668 KB Output is correct
24 Correct 5 ms 2924 KB Output is correct
25 Correct 5 ms 2924 KB Output is correct
26 Correct 3 ms 2668 KB Output is correct
27 Correct 3 ms 2668 KB Output is correct
28 Correct 5 ms 3052 KB Output is correct
29 Correct 6 ms 3436 KB Output is correct
30 Correct 3 ms 2816 KB Output is correct
31 Correct 4 ms 3052 KB Output is correct
32 Correct 4 ms 2944 KB Output is correct
33 Correct 12 ms 4332 KB Output is correct
34 Correct 10 ms 4348 KB Output is correct
35 Correct 37 ms 7916 KB Output is correct
36 Correct 7 ms 3436 KB Output is correct
37 Correct 30 ms 7788 KB Output is correct
38 Correct 47 ms 9324 KB Output is correct
39 Correct 46 ms 9452 KB Output is correct
40 Correct 45 ms 9452 KB Output is correct
41 Correct 48 ms 9324 KB Output is correct
42 Correct 8 ms 3308 KB Output is correct
43 Correct 8 ms 3308 KB Output is correct
44 Correct 8 ms 3308 KB Output is correct
45 Correct 55 ms 12396 KB Output is correct
46 Correct 55 ms 12396 KB Output is correct
47 Correct 67 ms 15848 KB Output is correct
48 Correct 35 ms 8808 KB Output is correct
49 Correct 31 ms 7916 KB Output is correct
50 Correct 21 ms 6636 KB Output is correct
51 Correct 69 ms 11688 KB Output is correct
52 Correct 74 ms 12160 KB Output is correct
53 Correct 49 ms 9236 KB Output is correct
54 Correct 4 ms 3052 KB Output is correct
55 Correct 6 ms 3560 KB Output is correct
56 Correct 15 ms 4084 KB Output is correct
57 Correct 45 ms 11624 KB Output is correct
58 Correct 12 ms 4144 KB Output is correct
59 Correct 13 ms 4464 KB Output is correct
60 Correct 15 ms 5104 KB Output is correct
61 Correct 17 ms 4860 KB Output is correct
62 Correct 54 ms 12776 KB Output is correct
63 Correct 121 ms 31264 KB Output is correct
64 Correct 129 ms 38796 KB Output is correct
65 Correct 169 ms 45224 KB Output is correct
66 Correct 315 ms 77320 KB Output is correct
67 Correct 313 ms 77448 KB Output is correct