oj.uz

Submission #306183

# Submission time Handle Problem Language Result Execution time Memory
306183 2020-09-24T19:24:32 Z MarcoMeijer Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 236 ms 68196 KB 
#include <bits/stdc++.h>
using namespace std;
 
// macros
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef pair<ll, ll> lll;
typedef tuple<int, int, int> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vll;
typedef vector<lll> vlll;
#define REP(a,b,c) for(int a=int(b); a<int(c); a++)
#define RE(a,c) REP(a,0,c)
#define RE1(a,c) REP(a,1,c+1)
#define REI(a,b,c) REP(a,b,c+1)
#define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--)
#define FOR(a,b) for(auto& a : b)
#define all(a) a.begin(), a.end()
#define INF 1e9
#define EPS 1e-9
#define pb push_back
#define popb pop_back
#define fi first
#define se second
#define sz size()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
 
// input
template<class T> void IN(T& x) {cin >> x;}
template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); }
 
// output
template<class T1, class T2> void OUT(const pair<T1,T2>& x);
template<class T> void OUT(const vector<T>& x);
template<class T> void OUT(const T& x) {cout << x;}
template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); }
template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);}
template<class T> void OUT(const vector<T>& x) {RE(i,x.size()) OUT(i==0?"":" ",x[i]);}
template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); }
template<class H> void OUTLS(const H& h) {OUTL(h); }
template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); }
 
//===================//
//  Added libraries  //
//===================//
 
//===================//
//end added libraries//
//===================//
 
void program();
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    program();
}
 
 
//===================//
//   begin program   //
//===================//
 
const int MX = 31000;

int n, m;
int b[MX], p[MX];
int d[MX];
set<int> dif[MX];
vii adj[MX];

void program() {
    IN(n,m);
    RE(i,m) IN(b[i],p[i]);
    RE(i,m) dif[b[i]].insert(p[i]);

    // create graph
    RE(i,n) {
        FOR(del,dif[i]) {
            int x, dist;

            // left
            x=i; dist = 0;
            while(1) {
                x -= del; dist++;
                if(x < 0) break;
                adj[i].pb({x,dist});
                if(dif[x].count(dist)) break;
            }

            // right
            x=i; dist = 0;
            while(1) {
                x += del; dist++;
                if(x >= n) break;
                adj[i].pb({x,dist});
                if(dif[x].count(dist)) break;
            }
        }
    }

    // dijkstra
    RE(i,n) d[i] = INF;
    priority_queue<ii,vii,greater<ii>> pq;
    pq.push({0,b[0]}); d[b[0]] = 0;
    while(!pq.empty()) {
        ii p = pq.top(); pq.pop();
        if(d[p.se] != p.fi) continue;
        FOR(v,adj[p.se]) {
            if(d[v.fi] > p.fi+v.se) {
                d[v.fi] = p.fi+v.se;
                pq.push({d[v.fi], v.fi});
            }
        }
    }
    int ans = d[b[1]];
    if(ans == INF) OUTL(-1);
    else OUTL(ans);
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2560 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 2 ms 2560 KB Output is correct
4 Correct 3 ms 2560 KB Output is correct
5 Correct 2 ms 2560 KB Output is correct
6 Correct 2 ms 2560 KB Output is correct
7 Correct 2 ms 2560 KB Output is correct
8 Correct 2 ms 2560 KB Output is correct
9 Correct 2 ms 2560 KB Output is correct
10 Correct 2 ms 2560 KB Output is correct
11 Correct 3 ms 2688 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2560 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 2 ms 2560 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2560 KB Output is correct
20 Correct 3 ms 2688 KB Output is correct
21 Correct 2 ms 2560 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2816 KB Output is correct
25 Correct 3 ms 2816 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 3 ms 2816 KB Output is correct
29 Correct 5 ms 3456 KB Output is correct
30 Correct 3 ms 2816 KB Output is correct
31 Correct 4 ms 3072 KB Output is correct
32 Correct 3 ms 2944 KB Output is correct
33 Correct 8 ms 4092 KB Output is correct
34 Correct 8 ms 4092 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2560 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 2 ms 2560 KB Output is correct
4 Correct 2 ms 2560 KB Output is correct
5 Correct 2 ms 2560 KB Output is correct
6 Correct 2 ms 2560 KB Output is correct
7 Correct 2 ms 2560 KB Output is correct
8 Correct 2 ms 2560 KB Output is correct
9 Correct 2 ms 2560 KB Output is correct
10 Correct 3 ms 2560 KB Output is correct
11 Correct 3 ms 2688 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2560 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 2 ms 2560 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2560 KB Output is correct
20 Correct 3 ms 2688 KB Output is correct
21 Correct 2 ms 2560 KB Output is correct
22 Correct 2 ms 2560 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2816 KB Output is correct
25 Correct 3 ms 2816 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 2 ms 2688 KB Output is correct
28 Correct 3 ms 2816 KB Output is correct
29 Correct 5 ms 3328 KB Output is correct
30 Correct 3 ms 2816 KB Output is correct
31 Correct 4 ms 3072 KB Output is correct
32 Correct 3 ms 2944 KB Output is correct
33 Correct 8 ms 4092 KB Output is correct
34 Correct 8 ms 4092 KB Output is correct
35 Correct 18 ms 4992 KB Output is correct
36 Correct 5 ms 2944 KB Output is correct
37 Correct 21 ms 5760 KB Output is correct
38 Correct 24 ms 6016 KB Output is correct
39 Correct 24 ms 6008 KB Output is correct
40 Correct 24 ms 6016 KB Output is correct
41 Correct 24 ms 5888 KB Output is correct
42 Correct 7 ms 2944 KB Output is correct
43 Correct 7 ms 2816 KB Output is correct
44 Correct 7 ms 2944 KB Output is correct
45 Correct 27 ms 8696 KB Output is correct
46 Correct 27 ms 8704 KB Output is correct

Subtask #5
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2560 KB Output is correct
2 Correct 2 ms 2560 KB Output is correct
3 Correct 3 ms 2560 KB Output is correct
4 Correct 2 ms 2560 KB Output is correct
5 Correct 2 ms 2560 KB Output is correct
6 Correct 2 ms 2560 KB Output is correct
7 Correct 2 ms 2560 KB Output is correct
8 Correct 2 ms 2560 KB Output is correct
9 Correct 2 ms 2560 KB Output is correct
10 Correct 2 ms 2560 KB Output is correct
11 Correct 3 ms 2688 KB Output is correct
12 Correct 2 ms 2560 KB Output is correct
13 Correct 2 ms 2688 KB Output is correct
14 Correct 3 ms 2688 KB Output is correct
15 Correct 3 ms 2688 KB Output is correct
16 Correct 2 ms 2560 KB Output is correct
17 Correct 3 ms 2816 KB Output is correct
18 Correct 2 ms 2688 KB Output is correct
19 Correct 2 ms 2560 KB Output is correct
20 Correct 3 ms 2688 KB Output is correct
21 Correct 2 ms 2560 KB Output is correct
22 Correct 3 ms 2688 KB Output is correct
23 Correct 3 ms 2688 KB Output is correct
24 Correct 3 ms 2816 KB Output is correct
25 Correct 3 ms 2816 KB Output is correct
26 Correct 3 ms 2688 KB Output is correct
27 Correct 3 ms 2688 KB Output is correct
28 Correct 3 ms 2816 KB Output is correct
29 Correct 5 ms 3456 KB Output is correct
30 Correct 3 ms 2816 KB Output is correct
31 Correct 4 ms 3072 KB Output is correct
32 Correct 3 ms 2944 KB Output is correct
33 Correct 8 ms 4092 KB Output is correct
34 Correct 8 ms 4092 KB Output is correct
35 Correct 18 ms 4992 KB Output is correct
36 Correct 5 ms 2944 KB Output is correct
37 Correct 20 ms 5760 KB Output is correct
38 Correct 24 ms 6008 KB Output is correct
39 Correct 24 ms 6016 KB Output is correct
40 Correct 25 ms 6016 KB Output is correct
41 Correct 23 ms 5880 KB Output is correct
42 Correct 7 ms 2944 KB Output is correct
43 Correct 7 ms 2816 KB Output is correct
44 Correct 7 ms 2944 KB Output is correct
45 Correct 27 ms 8696 KB Output is correct
46 Correct 27 ms 8704 KB Output is correct
47 Correct 52 ms 12668 KB Output is correct
48 Correct 19 ms 6136 KB Output is correct
49 Correct 16 ms 5248 KB Output is correct
50 Correct 12 ms 4992 KB Output is correct
51 Correct 44 ms 8516 KB Output is correct
52 Correct 44 ms 8948 KB Output is correct
53 Correct 21 ms 5884 KB Output is correct
54 Correct 4 ms 3200 KB Output is correct
55 Correct 5 ms 3580 KB Output is correct
56 Correct 15 ms 5504 KB Output is correct
57 Correct 152 ms 56556 KB Output is correct
58 Correct 11 ms 4088 KB Output is correct
59 Correct 13 ms 4732 KB Output is correct
60 Correct 14 ms 5244 KB Output is correct
61 Correct 13 ms 4480 KB Output is correct
62 Correct 29 ms 9464 KB Output is correct
63 Correct 87 ms 27116 KB Output is correct
64 Correct 97 ms 30572 KB Output is correct
65 Correct 129 ms 39860 KB Output is correct
66 Correct 236 ms 68192 KB Output is correct
67 Correct 230 ms 68196 KB Output is correct