oj.uz

답안 #364245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
364245 2021-02-08T14:40:07 Z ACmachine Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 1000 ms 58840 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;}

    
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);
    priority_queue<array<int, 2>, vector<array<int, 2>>, greater<array<int, 2>>> pq;
    pq.push({0, source});
    while(!pq.empty()){
        while(!pq.empty() && dist[pq.top()[1]] != -1) 
            pq.pop();
        if(pq.empty()) break;
        int v = pq.top()[1];
        dist[v] = pq.top()[0];
        pq.pop();
        for(auto x : g[v]){
            if(dist[x[0]] == -1){
                pq.push({dist[v] + x[1], x[0]});
            }
        }
    }
    cout << dist[dest] << "\n";

	
    return 0;
}

Compilation message

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:106:9: note: in expansion of macro 'REP'
  106 |         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:107:9: note: in expansion of macro 'REP'
  107 |         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:122:9: note: in expansion of macro 'REP'
  122 |         REP(i, pos[j].size()) is[pos[j][i]] = false;
      |         ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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 2 ms 1004 KB Output is correct
7 Correct 1 ms 1004 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 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 1 ms 1132 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

# 결과 실행 시간 메모리 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 1152 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 1 ms 1132 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 1388 KB Output is correct
18 Correct 2 ms 1260 KB Output is correct
19 Correct 1 ms 1132 KB Output is correct
20 Correct 2 ms 1132 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 2 ms 1132 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 3 ms 1388 KB Output is correct
25 Correct 3 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 13 ms 2428 KB Output is correct
30 Correct 4 ms 1516 KB Output is correct
31 Correct 6 ms 1900 KB Output is correct
32 Correct 4 ms 1516 KB Output is correct
33 Correct 33 ms 3448 KB Output is correct
34 Correct 28 ms 3448 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 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 3 ms 1132 KB Output is correct
12 Correct 2 ms 1132 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 4 ms 1428 KB Output is correct
18 Correct 2 ms 1260 KB Output is correct
19 Correct 1 ms 1132 KB Output is correct
20 Correct 2 ms 1132 KB Output is correct
21 Correct 1 ms 1132 KB Output is correct
22 Correct 1 ms 1132 KB Output is correct
23 Correct 2 ms 1260 KB Output is correct
24 Correct 3 ms 1388 KB Output is correct
25 Correct 3 ms 1388 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 13 ms 2408 KB Output is correct
30 Correct 4 ms 1516 KB Output is correct
31 Correct 6 ms 1900 KB Output is correct
32 Correct 4 ms 1516 KB Output is correct
33 Correct 27 ms 3448 KB Output is correct
34 Correct 28 ms 3448 KB Output is correct
35 Correct 18 ms 3328 KB Output is correct
36 Correct 5 ms 1516 KB Output is correct
37 Correct 28 ms 4708 KB Output is correct
38 Correct 28 ms 4708 KB Output is correct
39 Correct 35 ms 4712 KB Output is correct
40 Correct 28 ms 4708 KB Output is correct
41 Correct 27 ms 4708 KB Output is correct
42 Correct 6 ms 1772 KB Output is correct
43 Correct 6 ms 1772 KB Output is correct
44 Correct 6 ms 1772 KB Output is correct
45 Correct 120 ms 10332 KB Output is correct
46 Correct 121 ms 10204 KB Output is correct

Subtask #5
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1004 KB Output is correct
2 Correct 1 ms 1004 KB Output is correct
3 Correct 2 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 1132 KB Output is correct
11 Correct 2 ms 1132 KB Output is correct
12 Correct 1 ms 1132 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 1388 KB Output is correct
18 Correct 2 ms 1260 KB Output is correct
19 Correct 1 ms 1132 KB Output is correct
20 Correct 2 ms 1132 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 1388 KB Output is correct
25 Correct 3 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 14 ms 2408 KB Output is correct
30 Correct 4 ms 1516 KB Output is correct
31 Correct 6 ms 1900 KB Output is correct
32 Correct 4 ms 1516 KB Output is correct
33 Correct 28 ms 3448 KB Output is correct
34 Correct 27 ms 3448 KB Output is correct
35 Correct 18 ms 3308 KB Output is correct
36 Correct 4 ms 1516 KB Output is correct
37 Correct 28 ms 4708 KB Output is correct
38 Correct 28 ms 4708 KB Output is correct
39 Correct 28 ms 4712 KB Output is correct
40 Correct 27 ms 4708 KB Output is correct
41 Correct 28 ms 4708 KB Output is correct
42 Correct 6 ms 1772 KB Output is correct
43 Correct 6 ms 1772 KB Output is correct
44 Correct 7 ms 1772 KB Output is correct
45 Correct 124 ms 10332 KB Output is correct
46 Correct 119 ms 10204 KB Output is correct
47 Correct 120 ms 14684 KB Output is correct
48 Correct 14 ms 4840 KB Output is correct
49 Correct 12 ms 4076 KB Output is correct
50 Correct 10 ms 3948 KB Output is correct
51 Correct 55 ms 7460 KB Output is correct
52 Correct 63 ms 8868 KB Output is correct
53 Correct 19 ms 4232 KB Output is correct
54 Correct 4 ms 2412 KB Output is correct
55 Correct 5 ms 2796 KB Output is correct
56 Correct 13 ms 3436 KB Output is correct
57 Correct 95 ms 11364 KB Output is correct
58 Correct 11 ms 3368 KB Output is correct
59 Correct 12 ms 3756 KB Output is correct
60 Correct 13 ms 4392 KB Output is correct
61 Correct 13 ms 3952 KB Output is correct
62 Correct 22 ms 7656 KB Output is correct
63 Correct 346 ms 32236 KB Output is correct
64 Correct 402 ms 40664 KB Output is correct
65 Execution timed out 1055 ms 58840 KB Time limit exceeded
66 Halted 0 ms 0 KB -