oj.uz

답안 #228567

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
228567 2020-05-01T14:13:26 Z caoash Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 281 ms 79840 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 = 200005;
const ld PI = 4*atan((ld)1);

vpi adj[MX]; set<int> guys[MX]; bool vis[MX]; int dist[MX];

int main() {
   setIO(); 
   int N,M; re(N,M);   
   int st = -1, en = -1;
   fax(i,M){
      int b,p; re(b,p);
      if(st < 0) st = b;
      else if(en < 0) en = b;
      guys[b].insert(p);
   }
   fax(i,N){
      trav(curr, guys[i]){
         int p = 1;
         for(int j = i; j + curr < N; j += curr){
            adj[i].pb(mp(j+curr, p++));
            if(guys[j+curr].count(curr)){
               break;
            }
         }
         p = 1;
         for(int j = i; j - curr >= 0; j -= curr){
            adj[i].pb(mp(j-curr,p++));
            if(guys[j-curr].count(curr)){
               break;
            }
         }
      }
   }
   priority_queue<pi, vector<pi>, greater<pi>> pq;
   fax(i,N) dist[i] = MOD;
   dist[st] = 0;
   pq.push(mp(0, st));
   while(!pq.empty()){
      pi fr = pq.top(); pq.pop();
      for(pi to : adj[fr.s]){
         if(!vis[to.f]){
            if(dist[to.f] > dist[fr.s] + to.s){
               dist[to.f] = dist[fr.s] + to.s;
               pq.push(mp(dist[to.f], to.f));
            }
         }
      }
      vis[fr.s] = true;
   }
   pr((dist[en] == MOD) ? -1 : dist[en], "\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

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14592 KB Output is correct
5 Correct 13 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 16 ms 14464 KB Output is correct
6 Correct 13 ms 14592 KB Output is correct
7 Correct 13 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 13 ms 14464 KB Output is correct
11 Correct 14 ms 14592 KB Output is correct
12 Correct 13 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 14 ms 14592 KB Output is correct
15 Correct 14 ms 14592 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 14 ms 14592 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14464 KB Output is correct
7 Correct 13 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 13 ms 14464 KB Output is correct
11 Correct 14 ms 14592 KB Output is correct
12 Correct 14 ms 14464 KB Output is correct
13 Correct 14 ms 14464 KB Output is correct
14 Correct 14 ms 14592 KB Output is correct
15 Correct 14 ms 14592 KB Output is correct
16 Correct 14 ms 14592 KB Output is correct
17 Correct 15 ms 14720 KB Output is correct
18 Correct 13 ms 14592 KB Output is correct
19 Correct 13 ms 14592 KB Output is correct
20 Correct 16 ms 14720 KB Output is correct
21 Correct 13 ms 14464 KB Output is correct
22 Correct 13 ms 14592 KB Output is correct
23 Correct 14 ms 14592 KB Output is correct
24 Correct 15 ms 14720 KB Output is correct
25 Correct 15 ms 14720 KB Output is correct
26 Correct 14 ms 14592 KB Output is correct
27 Correct 15 ms 14592 KB Output is correct
28 Correct 15 ms 14848 KB Output is correct
29 Correct 17 ms 15360 KB Output is correct
30 Correct 15 ms 14848 KB Output is correct
31 Correct 15 ms 14976 KB Output is correct
32 Correct 14 ms 14848 KB Output is correct
33 Correct 20 ms 15996 KB Output is correct
34 Correct 21 ms 15996 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 13 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 16 ms 14464 KB Output is correct
5 Correct 14 ms 14464 KB Output is correct
6 Correct 14 ms 14464 KB Output is correct
7 Correct 14 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 13 ms 14524 KB Output is correct
11 Correct 14 ms 14592 KB Output is correct
12 Correct 14 ms 14464 KB Output is correct
13 Correct 13 ms 14464 KB Output is correct
14 Correct 14 ms 14592 KB Output is correct
15 Correct 14 ms 14592 KB Output is correct
16 Correct 14 ms 14464 KB Output is correct
17 Correct 15 ms 14720 KB Output is correct
18 Correct 14 ms 14592 KB Output is correct
19 Correct 13 ms 14592 KB Output is correct
20 Correct 14 ms 14592 KB Output is correct
21 Correct 13 ms 14592 KB Output is correct
22 Correct 13 ms 14592 KB Output is correct
23 Correct 14 ms 14592 KB Output is correct
24 Correct 15 ms 14696 KB Output is correct
25 Correct 15 ms 14720 KB Output is correct
26 Correct 14 ms 14592 KB Output is correct
27 Correct 14 ms 14592 KB Output is correct
28 Correct 16 ms 14848 KB Output is correct
29 Correct 17 ms 15360 KB Output is correct
30 Correct 15 ms 14720 KB Output is correct
31 Correct 15 ms 14976 KB Output is correct
32 Correct 15 ms 14848 KB Output is correct
33 Correct 19 ms 15996 KB Output is correct
34 Correct 19 ms 15996 KB Output is correct
35 Correct 32 ms 16896 KB Output is correct
36 Correct 16 ms 14976 KB Output is correct
37 Correct 33 ms 17664 KB Output is correct
38 Correct 38 ms 17912 KB Output is correct
39 Correct 37 ms 17944 KB Output is correct
40 Correct 37 ms 17920 KB Output is correct
41 Correct 38 ms 17920 KB Output is correct
42 Correct 18 ms 14720 KB Output is correct
43 Correct 18 ms 14720 KB Output is correct
44 Correct 18 ms 14848 KB Output is correct
45 Correct 40 ms 20600 KB Output is correct
46 Correct 39 ms 20600 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 14464 KB Output is correct
2 Correct 14 ms 14464 KB Output is correct
3 Correct 13 ms 14464 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 13 ms 14464 KB Output is correct
6 Correct 13 ms 14464 KB Output is correct
7 Correct 13 ms 14464 KB Output is correct
8 Correct 13 ms 14464 KB Output is correct
9 Correct 13 ms 14464 KB Output is correct
10 Correct 14 ms 14464 KB Output is correct
11 Correct 14 ms 14592 KB Output is correct
12 Correct 13 ms 14464 KB Output is correct
13 Correct 13 ms 14464 KB Output is correct
14 Correct 14 ms 14592 KB Output is correct
15 Correct 14 ms 14592 KB Output is correct
16 Correct 13 ms 14592 KB Output is correct
17 Correct 15 ms 14720 KB Output is correct
18 Correct 14 ms 14592 KB Output is correct
19 Correct 14 ms 14592 KB Output is correct
20 Correct 13 ms 14592 KB Output is correct
21 Correct 13 ms 14592 KB Output is correct
22 Correct 14 ms 14592 KB Output is correct
23 Correct 14 ms 14592 KB Output is correct
24 Correct 17 ms 14720 KB Output is correct
25 Correct 15 ms 14720 KB Output is correct
26 Correct 14 ms 14592 KB Output is correct
27 Correct 18 ms 14720 KB Output is correct
28 Correct 15 ms 14848 KB Output is correct
29 Correct 17 ms 15360 KB Output is correct
30 Correct 14 ms 14848 KB Output is correct
31 Correct 15 ms 14976 KB Output is correct
32 Correct 15 ms 14848 KB Output is correct
33 Correct 19 ms 16012 KB Output is correct
34 Correct 19 ms 15996 KB Output is correct
35 Correct 31 ms 16896 KB Output is correct
36 Correct 16 ms 14848 KB Output is correct
37 Correct 35 ms 17664 KB Output is correct
38 Correct 38 ms 17912 KB Output is correct
39 Correct 38 ms 17912 KB Output is correct
40 Correct 38 ms 17912 KB Output is correct
41 Correct 37 ms 17920 KB Output is correct
42 Correct 18 ms 14720 KB Output is correct
43 Correct 18 ms 14720 KB Output is correct
44 Correct 19 ms 14848 KB Output is correct
45 Correct 40 ms 20608 KB Output is correct
46 Correct 40 ms 20600 KB Output is correct
47 Correct 68 ms 25076 KB Output is correct
48 Correct 32 ms 18300 KB Output is correct
49 Correct 28 ms 17272 KB Output is correct
50 Correct 25 ms 16896 KB Output is correct
51 Correct 60 ms 20228 KB Output is correct
52 Correct 59 ms 20732 KB Output is correct
53 Correct 36 ms 17908 KB Output is correct
54 Correct 16 ms 15104 KB Output is correct
55 Correct 17 ms 15484 KB Output is correct
56 Correct 27 ms 17152 KB Output is correct
57 Correct 53 ms 23684 KB Output is correct
58 Correct 21 ms 15736 KB Output is correct
59 Correct 23 ms 16124 KB Output is correct
60 Correct 31 ms 16892 KB Output is correct
61 Correct 24 ms 16256 KB Output is correct
62 Correct 37 ms 21364 KB Output is correct
63 Correct 94 ms 38760 KB Output is correct
64 Correct 101 ms 42068 KB Output is correct
65 Correct 131 ms 51564 KB Output is correct
66 Correct 281 ms 79816 KB Output is correct
67 Correct 281 ms 79840 KB Output is correct