oj.uz

Submission #364250

# Submission time Handle Problem Language Result Execution time Memory
364250 2021-02-08T15:15:48 Z ACmachine Jakarta Skyscrapers (APIO15_skyscraper) C++17
100 / 100
 516 ms 67096 KB 
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
struct node{
    int ans = INF;
    int ind = 0;
    void apply(int l, int r, int val){
        ans = val; 
    }
};
struct segtree{
    node comb(node const &a, node const &b){
        node res;
        res.ans = min(a.ans, b.ans);
        if(a.ans < b.ans)
            res.ind = a.ind;
        else
            res.ind = b.ind;
        return res;
    } 
    void push(int l, int r, int v){ 
    }
    int sz;
    vector<node> tree; 
    segtree(int _sz){ // tree is resized to default values set in node
        sz = 1; while(sz < _sz) sz<<=1;
        tree.resize(2*sz); 
    } 
    void build(vector<node> &init){
        for(int i = 0; i < sz; ++i) 
            if(i < init.size())
                tree[i+sz] = init[i];
        for(int i = sz-1; i > 0; --i)
            tree[i] = comb(tree[i<<1], tree[i<<1|1]);
    } 
    node query(int l, int r){if(l + 1 == r) return tree[l + sz]; return query0(l, r, 0, sz, 1);} 
    node query0(int l, int r, int beg, int end, int v){ 
        if(beg >= l && end <= r)
            return tree[v];
        push(beg, end, v);
        int mid = (beg + end) >> 1;
        node res;
        if(beg >= r || mid <= l) res = query0(l, r, mid, end, v<<1|1); //[beg, mid]
        else if(mid >= r || end <= l) res = query0(l, r, beg, mid, v<<1);
        else res = comb(query0(l, r, beg, mid, v<<1), query0(l, r, mid, end, v<<1|1));
        return res;
    } 
    template<typename... T>
    void upd(int l, int r, T ...args){upd0(l, r, 0, sz, 1, args...);}
    template<typename... T>
    void upd0(int l, int r, int beg, int end, int v, T ...args){
        int id = l + sz;
        tree[id].apply(beg, end, args...);
        for(int i = id/2; i > 0; i/=2)
            tree[i] = comb(tree[i<<1], tree[i<<1|1]);
        /* if(beg >= r || end <= l) */
        /*     return; */
        /* if(beg >= l && end <= r){ */
        /*     tree[v].apply(beg, end, args...); */
        /*     return; */
        /* } */
        /* push(beg, end, v); */
        /* int mid = (beg + end) >> 1; */
        /* upd0(l, r, beg, mid, v<<1, args...); */
        /* upd0(l, r, mid, end, v<<1|1, args...); */
        /* tree[v] = comb(tree[v<<1], tree[v<<1|1]); */
    } 
};

int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
	int n, m;
    cin >> n >> m;
    vector<array<int, 2>> a(m);
    int dest = -1;
    int source = -1;
    int mxp = 30005;
    vector<vi> pos(mxp);
    REP(i, m){
        cin >> a[i][0] >> a[i][1];
        if(i == 0) source = a[i][0];
        if(i == 1) dest = a[i][0];
        pos[a[i][1]].pb(a[i][0]);
    }
    vector<vector<array<int, 2>>> g(n);
    vector<bool> is(n, false);
    REP(j, mxp){
        sort(all(pos[j]));
        pos[j].erase(unique(all(pos[j])), pos[j].end());
        REP(i, pos[j].size()) is[pos[j][i]] = true;
        REP(i, pos[j].size()){
            int x = pos[j][i];
            int nm = 0;
            FORD(k, x - j, 0, j){
                nm++;
                g[x].pb({k, nm});
                if(is[k]) break;
            }
            nm = 0;
            FOR(k, x + j, n, j){
                nm++;
                g[x].pb({k, nm});
                if(is[k]) break;
            }
        }
        REP(i, pos[j].size()) is[pos[j][i]] = false;
    }
    vi dist(n, -1);
    segtree st(n);
    vector<node> init(n); REP(i, n) init[i].ind = i;
    st.build(init);
    st.upd(source, source + 1, 0);
    while(true){
        auto no = st.query(0, st.sz);
        if(no.ans == INF) break;
        int v = no.ind;
        dist[v] = no.ans; 
        st.upd(v, v + 1, INF);
        for(auto x : g[v]){
            if(dist[x[0]] == -1){
                auto th = st.query(x[0], x[0] + 1);
                st.upd(x[0], x[0] + 1, min(th.ans, dist[v] + x[1])); 
            }
        }
    }
    cout << dist[dest] << "\n";

	
    return 0;
}

Compilation message

skyscraper.cpp: In member function 'void segtree::build(std::vector<node>&)':
skyscraper.cpp:112:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |             if(i < init.size())
      |                ~~^~~~~~~~~~~~~
skyscraper.cpp: In function 'int main()':
skyscraper.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
skyscraper.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
skyscraper.cpp:172:9: note: in expansion of macro 'REP'
  172 |         REP(i, pos[j].size()) is[pos[j][i]] = true;
      |         ^~~
skyscraper.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
skyscraper.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
skyscraper.cpp:173:9: note: in expansion of macro 'REP'
  173 |         REP(i, pos[j].size()){
      |         ^~~
skyscraper.cpp:26:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   26 | #define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
      |                                        ^
skyscraper.cpp:28:18: note: in expansion of macro 'FOR'
   28 | #define REP(i,b) FOR(i,0,b,1)
      |                  ^~~
skyscraper.cpp:188:9: note: in expansion of macro 'REP'
  188 |         REP(i, pos[j].size()) is[pos[j][i]] = false;
      |         ^~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1132 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1004 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 1 ms 1004 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 2 ms 1132 KB Output is correct
16 Correct 1 ms 1132 KB Output is correct
17 Correct 3 ms 1260 KB Output is correct
18 Correct 2 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 2 ms 1260 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 2 ms 1260 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 3 ms 1260 KB Output is correct
25 Correct 2 ms 1260 KB Output is correct
26 Correct 2 ms 1260 KB Output is correct
27 Correct 2 ms 1260 KB Output is correct
28 Correct 2 ms 1388 KB Output is correct
29 Correct 5 ms 1772 KB Output is correct
30 Correct 3 ms 1388 KB Output is correct
31 Correct 3 ms 1516 KB Output is correct
32 Correct 3 ms 1388 KB Output is correct
33 Correct 8 ms 2284 KB Output is correct
34 Correct 10 ms 2284 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1004 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 2 ms 1004 KB Output is correct
13 Correct 2 ms 1132 KB Output is correct
14 Correct 2 ms 1132 KB Output is correct
15 Correct 2 ms 1132 KB Output is correct
16 Correct 2 ms 1132 KB Output is correct
17 Correct 3 ms 1260 KB Output is correct
18 Correct 2 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 2 ms 1260 KB Output is correct
21 Correct 2 ms 1132 KB Output is correct
22 Correct 2 ms 1260 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 3 ms 1260 KB Output is correct
25 Correct 2 ms 1260 KB Output is correct
26 Correct 2 ms 1260 KB Output is correct
27 Correct 2 ms 1260 KB Output is correct
28 Correct 3 ms 1388 KB Output is correct
29 Correct 5 ms 1772 KB Output is correct
30 Correct 3 ms 1388 KB Output is correct
31 Correct 3 ms 1516 KB Output is correct
32 Correct 3 ms 1388 KB Output is correct
33 Correct 8 ms 2284 KB Output is correct
34 Correct 8 ms 2284 KB Output is correct
35 Correct 12 ms 2540 KB Output is correct
36 Correct 4 ms 1388 KB Output is correct
37 Correct 15 ms 3436 KB Output is correct
38 Correct 16 ms 3308 KB Output is correct
39 Correct 16 ms 3308 KB Output is correct
40 Correct 17 ms 3308 KB Output is correct
41 Correct 16 ms 3308 KB Output is correct
42 Correct 6 ms 1644 KB Output is correct
43 Correct 6 ms 1644 KB Output is correct
44 Correct 6 ms 1516 KB Output is correct
45 Correct 30 ms 5960 KB Output is correct
46 Correct 30 ms 5868 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1004 KB Output is correct
4 Correct 1 ms 1004 KB Output is correct
5 Correct 1 ms 1004 KB Output is correct
6 Correct 1 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct
8 Correct 1 ms 1004 KB Output is correct
9 Correct 1 ms 1004 KB Output is correct
10 Correct 1 ms 1004 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 1 ms 1004 KB Output is correct
13 Correct 1 ms 1132 KB Output is correct
14 Correct 2 ms 1152 KB Output is correct
15 Correct 2 ms 1132 KB Output is correct
16 Correct 1 ms 1132 KB Output is correct
17 Correct 3 ms 1260 KB Output is correct
18 Correct 2 ms 1260 KB Output is correct
19 Correct 1 ms 1260 KB Output is correct
20 Correct 2 ms 1260 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1260 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 3 ms 1260 KB Output is correct
25 Correct 2 ms 1260 KB Output is correct
26 Correct 2 ms 1260 KB Output is correct
27 Correct 2 ms 1260 KB Output is correct
28 Correct 3 ms 1408 KB Output is correct
29 Correct 5 ms 1772 KB Output is correct
30 Correct 3 ms 1388 KB Output is correct
31 Correct 3 ms 1516 KB Output is correct
32 Correct 3 ms 1388 KB Output is correct
33 Correct 8 ms 2284 KB Output is correct
34 Correct 8 ms 2284 KB Output is correct
35 Correct 12 ms 2540 KB Output is correct
36 Correct 5 ms 1388 KB Output is correct
37 Correct 18 ms 3436 KB Output is correct
38 Correct 19 ms 3308 KB Output is correct
39 Correct 17 ms 3308 KB Output is correct
40 Correct 16 ms 3308 KB Output is correct
41 Correct 16 ms 3308 KB Output is correct
42 Correct 7 ms 1644 KB Output is correct
43 Correct 6 ms 1644 KB Output is correct
44 Correct 7 ms 1516 KB Output is correct
45 Correct 30 ms 5868 KB Output is correct
46 Correct 31 ms 5868 KB Output is correct
47 Correct 58 ms 10604 KB Output is correct
48 Correct 16 ms 5352 KB Output is correct
49 Correct 13 ms 4588 KB Output is correct
50 Correct 11 ms 4460 KB Output is correct
51 Correct 41 ms 6700 KB Output is correct
52 Correct 43 ms 7208 KB Output is correct
53 Correct 19 ms 3944 KB Output is correct
54 Correct 4 ms 2924 KB Output is correct
55 Correct 6 ms 3308 KB Output is correct
56 Correct 17 ms 3948 KB Output is correct
57 Correct 51 ms 10988 KB Output is correct
58 Correct 12 ms 3748 KB Output is correct
59 Correct 14 ms 4140 KB Output is correct
60 Correct 15 ms 4796 KB Output is correct
61 Correct 14 ms 4080 KB Output is correct
62 Correct 26 ms 8040 KB Output is correct
63 Correct 139 ms 24552 KB Output is correct
64 Correct 148 ms 32872 KB Output is correct
65 Correct 264 ms 42472 KB Output is correct
66 Correct 516 ms 66780 KB Output is correct
67 Correct 509 ms 67096 KB Output is correct