oj.uz

Submission #228453

# Submission time Handle Problem Language Result Execution time Memory
228453 2020-05-01T04:54:34 Z caoash Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 229720 KB 
#pragma GCC target ("sse4")
 
#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
 
typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;
 
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
 
#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset
 
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
 
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize
 
template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }
 
template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};
 
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
 
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }
 
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}
 
using namespace input;
 
namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}
 
using namespace output;
 
namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}
 
using namespace io;
 
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
 
const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 30005;
const ld PI = 4*atan((ld)1);
 
struct pair_hash
{
	template <class T1, class T2>
	std::size_t operator () (std::pair<T1, T2> const &pair) const
	{
		std::size_t h1 = std::hash<T1>()(pair.first);
		std::size_t h2 = std::hash<T2>()(pair.second);

		return h1 ^ h2;
	}
};

map<pi, vector<pii>> adj; vector<pi> low, high; vector<int> vals; unordered_set<pi, pair_hash> vis; map<pi,ll> dist;
 
int main() {
   setIO(); 
   int N,M; re(N,M);   
   const int LIM = sqrt((double)N);
   pi fst = {-1,-1}; pi sec = {-1,-1};
   fax(i,M){
      int b,p; re(b,p);  
      if(fst.f == -1){
         fst = mp(b,p);
      } 
      else if(sec.f == -1){
         sec = mp(b,p);
      }
      if(p <= LIM){
         low.pb(mp(b,p));
         vals.pb(p);
      }
      else{
         high.pb(mp(b,p));
      }
   }
   /*
   ps();
   trav(curr, sorted){
      pr(curr.f, " ", curr.s, "\n");
   }
   */
   trav(curr, low){
      adj[mp(curr.f, -1)].pb(mp(0,mp(curr.f, curr.s)));
      //dbg(mp(curr.f, -1), mp(0,mp(curr.f,curr.s)));
   }
   trav(curr, high){
      for(int j = 1; curr.f + (curr.s*j) < N; j++){
          adj[mp(curr.f,-1)].pb(mp(j,mp(curr.f+(curr.s*j),-1)));
          //dbg(mp(i,curr.s),mp(j,mp(i+(curr.s*j),-1)));
       }
       for(int j = 1; curr.f - (curr.s*j) >= 0; j++){
          adj[mp(curr.f,-1)].pb(mp(j,mp(curr.f-(curr.s*j),-1)));
          //dbg(mp(i,curr.s),mp(j,mp(i-(curr.s*j),-1)));
       }
   }
   sort(vals.begin(), vals.end());
   vals.erase(unique(vals.begin(), vals.end()), vals.end());
   fax(i,N){
     trav(curr, vals){
      adj[mp(i,curr)].pb(mp(0,mp(i,-1)));  
      if(i-curr >= 0){
         adj[mp(i, curr)].pb(mp(1,mp(i-curr,curr)));
      }
      if(i + curr < N){
         adj[mp(i,curr)].pb(mp(1,mp(i+curr,curr)));
      }
     }
   }
   trav(curr, adj){
     dist[curr.f] = INF; 
     trav(to, curr.s){
      dist[to.s] = INF;
     }
   }
   priority_queue<pair<ll,pi>, vector<pair<ll,pi>>, greater<pair<ll,pi>>> pq;
   pq.push(mp(0,mp(fst.f, -1)));
   dist[mp(fst.f, -1)] = 0;
   while(!pq.empty()){
      pair<ll,pi> fr = pq.top(); pq.pop();
      for(pii to : adj[fr.s]){
         if(vis.count(to.s)){
            continue;
         }
         if(dist[to.s] > dist[fr.s] + to.f){
            dist[to.s] = dist[fr.s] + to.f;
            pq.push(mp(dist[to.s], to.s));
         }
      }
      vis.insert(fr.s);
   }
   if(dist.count(mp(sec.f, -1))){
      ll d = dist[mp(sec.f, -1)];
      if(d != INF){
         pr(d, "\n");
         return 0;
      }
   }
   pr(-1, "\n");
}

Compilation message

skyscraper.cpp: In function 'void io::setIn(std::__cxx11::string)':
skyscraper.cpp:133:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
skyscraper.cpp: In function 'void io::setOut(std::__cxx11::string)':
skyscraper.cpp:134:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 8 ms 640 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 5 ms 512 KB Output is correct
14 Correct 7 ms 768 KB Output is correct
15 Correct 9 ms 640 KB Output is correct
16 Correct 8 ms 1024 KB Output is correct
17 Correct 39 ms 4864 KB Output is correct
18 Correct 40 ms 7288 KB Output is correct
19 Correct 27 ms 4600 KB Output is correct
20 Correct 10 ms 1280 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 24 ms 4472 KB Output is correct
23 Correct 42 ms 6392 KB Output is correct
24 Correct 83 ms 11984 KB Output is correct
25 Correct 17 ms 2176 KB Output is correct
26 Correct 64 ms 10492 KB Output is correct
27 Correct 45 ms 7160 KB Output is correct
28 Correct 102 ms 14072 KB Output is correct
29 Correct 196 ms 16552 KB Output is correct
30 Correct 47 ms 5112 KB Output is correct
31 Correct 88 ms 8672 KB Output is correct
32 Correct 35 ms 3960 KB Output is correct
33 Correct 311 ms 22664 KB Output is correct
34 Correct 313 ms 22664 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 6 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 8 ms 640 KB Output is correct
15 Correct 8 ms 640 KB Output is correct
16 Correct 8 ms 1024 KB Output is correct
17 Correct 40 ms 4864 KB Output is correct
18 Correct 40 ms 7288 KB Output is correct
19 Correct 25 ms 4608 KB Output is correct
20 Correct 10 ms 1280 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 25 ms 4480 KB Output is correct
23 Correct 40 ms 6392 KB Output is correct
24 Correct 83 ms 11896 KB Output is correct
25 Correct 17 ms 2176 KB Output is correct
26 Correct 64 ms 10360 KB Output is correct
27 Correct 42 ms 7160 KB Output is correct
28 Correct 102 ms 14200 KB Output is correct
29 Correct 200 ms 16552 KB Output is correct
30 Correct 43 ms 5112 KB Output is correct
31 Correct 85 ms 8616 KB Output is correct
32 Correct 35 ms 3960 KB Output is correct
33 Correct 299 ms 22792 KB Output is correct
34 Correct 292 ms 22664 KB Output is correct
35 Correct 173 ms 14080 KB Output is correct
36 Correct 56 ms 7416 KB Output is correct
37 Correct 308 ms 22972 KB Output is correct
38 Correct 301 ms 22580 KB Output is correct
39 Correct 314 ms 22444 KB Output is correct
40 Correct 296 ms 22448 KB Output is correct
41 Correct 290 ms 22576 KB Output is correct
42 Correct 75 ms 11188 KB Output is correct
43 Correct 53 ms 7860 KB Output is correct
44 Correct 19 ms 2108 KB Output is correct
45 Correct 472 ms 27796 KB Output is correct
46 Correct 463 ms 27672 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 4 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 7 ms 640 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 6 ms 512 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 8 ms 640 KB Output is correct
15 Correct 7 ms 768 KB Output is correct
16 Correct 9 ms 1024 KB Output is correct
17 Correct 39 ms 4856 KB Output is correct
18 Correct 39 ms 7288 KB Output is correct
19 Correct 25 ms 4608 KB Output is correct
20 Correct 10 ms 1280 KB Output is correct
21 Correct 8 ms 1024 KB Output is correct
22 Correct 25 ms 4480 KB Output is correct
23 Correct 40 ms 6392 KB Output is correct
24 Correct 82 ms 11900 KB Output is correct
25 Correct 16 ms 2176 KB Output is correct
26 Correct 68 ms 10360 KB Output is correct
27 Correct 45 ms 7160 KB Output is correct
28 Correct 102 ms 14124 KB Output is correct
29 Correct 184 ms 16552 KB Output is correct
30 Correct 44 ms 5112 KB Output is correct
31 Correct 88 ms 8744 KB Output is correct
32 Correct 36 ms 3960 KB Output is correct
33 Correct 298 ms 22788 KB Output is correct
34 Correct 292 ms 22664 KB Output is correct
35 Correct 161 ms 14000 KB Output is correct
36 Correct 56 ms 7416 KB Output is correct
37 Correct 304 ms 22964 KB Output is correct
38 Correct 303 ms 22448 KB Output is correct
39 Correct 294 ms 22448 KB Output is correct
40 Correct 289 ms 22320 KB Output is correct
41 Correct 283 ms 22448 KB Output is correct
42 Correct 73 ms 11188 KB Output is correct
43 Correct 52 ms 7860 KB Output is correct
44 Correct 18 ms 2108 KB Output is correct
45 Correct 457 ms 27932 KB Output is correct
46 Correct 457 ms 27672 KB Output is correct
47 Execution timed out 1105 ms 229720 KB Time limit exceeded
48 Halted 0 ms 0 KB -