oj.uz

답안 #392364

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
392364 2021-04-20T20:47:35 Z osaaateiasavtnl Jakarta Skyscrapers (APIO15_skyscraper) C++14
100 / 100
 74 ms 9804 KB 
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
using namespace std;
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define FOR(i, n) for (int i = 0; i < n; ++i)
#define FORN(i, n) for (int i = 1; i <= n; ++i)
#define pb push_back
#define trav(a, x) for (auto& a : x)
using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> void re(V<T>& x) { 
    trav(a, x)
        cin >> a;
}
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
const int N = 30007, INF = 1e9+7;
int n, m;
int dist[N];
vi have[N];
int pos[N], step[N];
bool used[N];

const int K = 200;
bool vis[K][N];

signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    FOR (i, N) {
    	dist[i] = INF;
    }
    cin >> n >> m;
    FOR (i, m) {
    	cin >> pos[i] >> step[i];
    	have[pos[i]].app(step[i]);
    }
    dist[pos[0]] = 0;
    priority_queue <ii> q;
    q.push(mp(0, pos[0]));
    while (q.size()) {
    	int u = q.top().y; q.pop();
    	if (used[u]) {
    		continue;
    	}
    	used[u] = 1;
    	auto relax = [&] (int v, int c) {
    		if (ckmin(dist[v], c)) {
    			q.push(mp(-dist[v], v));
    		}
    	};
    	trav (d, have[u]) {
    		for (int i = 1; i * d <= u; ++i) {
    			if (d < K) {
	    			if (vis[d][u - i * d]) {
	    				break;
	    			}
	    			vis[d][u - i * d] = 1;    				
    			}
    			relax(u - i * d, dist[u] + i);
    		}
    		for (int i = 1; u + i * d < n; ++i) {
    			if (d < K) {
	    			if (vis[d][u + i * d]) {
	    				break;
	    			}
	    			vis[d][u + i * d] = 1;    				
    			}
    			relax(u + i * d, dist[u] + i);
    		}
    	}
    }
    if (dist[pos[1]] == INF) {
    	cout << -1 << endl;
    }
    else {
    	cout << dist[pos[1]] << endl;
    }
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 2 ms 1484 KB Output is correct
12 Correct 2 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1356 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 2 ms 2124 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1104 KB Output is correct
23 Correct 2 ms 1612 KB Output is correct
24 Correct 3 ms 1996 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1740 KB Output is correct
27 Correct 2 ms 1484 KB Output is correct
28 Correct 2 ms 1740 KB Output is correct
29 Correct 2 ms 1484 KB Output is correct
30 Correct 2 ms 1228 KB Output is correct
31 Correct 2 ms 1356 KB Output is correct
32 Correct 2 ms 1228 KB Output is correct
33 Correct 3 ms 1612 KB Output is correct
34 Correct 3 ms 1740 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1100 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1100 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 2 ms 1228 KB Output is correct
10 Correct 1 ms 1484 KB Output is correct
11 Correct 2 ms 1484 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 1 ms 1100 KB Output is correct
14 Correct 2 ms 1356 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 2 ms 2124 KB Output is correct
18 Correct 1 ms 1100 KB Output is correct
19 Correct 2 ms 1100 KB Output is correct
20 Correct 2 ms 1228 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 2 ms 1612 KB Output is correct
24 Correct 3 ms 1996 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1740 KB Output is correct
27 Correct 2 ms 1484 KB Output is correct
28 Correct 2 ms 1740 KB Output is correct
29 Correct 3 ms 1484 KB Output is correct
30 Correct 2 ms 1228 KB Output is correct
31 Correct 2 ms 1356 KB Output is correct
32 Correct 2 ms 1228 KB Output is correct
33 Correct 3 ms 1612 KB Output is correct
34 Correct 3 ms 1740 KB Output is correct
35 Correct 8 ms 2636 KB Output is correct
36 Correct 4 ms 2124 KB Output is correct
37 Correct 7 ms 2792 KB Output is correct
38 Correct 13 ms 2896 KB Output is correct
39 Correct 10 ms 2852 KB Output is correct
40 Correct 10 ms 2876 KB Output is correct
41 Correct 10 ms 2892 KB Output is correct
42 Correct 6 ms 2124 KB Output is correct
43 Correct 8 ms 1868 KB Output is correct
44 Correct 6 ms 1612 KB Output is correct
45 Correct 12 ms 2892 KB Output is correct
46 Correct 9 ms 2764 KB Output is correct

Subtask #5
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1104 KB Output is correct
2 Correct 1 ms 1100 KB Output is correct
3 Correct 1 ms 1104 KB Output is correct
4 Correct 1 ms 1100 KB Output is correct
5 Correct 1 ms 1100 KB Output is correct
6 Correct 1 ms 1100 KB Output is correct
7 Correct 1 ms 1100 KB Output is correct
8 Correct 1 ms 1100 KB Output is correct
9 Correct 1 ms 1228 KB Output is correct
10 Correct 2 ms 1488 KB Output is correct
11 Correct 2 ms 1484 KB Output is correct
12 Correct 1 ms 1228 KB Output is correct
13 Correct 2 ms 1100 KB Output is correct
14 Correct 2 ms 1356 KB Output is correct
15 Correct 2 ms 1356 KB Output is correct
16 Correct 1 ms 1100 KB Output is correct
17 Correct 2 ms 2124 KB Output is correct
18 Correct 2 ms 1104 KB Output is correct
19 Correct 1 ms 1100 KB Output is correct
20 Correct 2 ms 1204 KB Output is correct
21 Correct 1 ms 1100 KB Output is correct
22 Correct 1 ms 1100 KB Output is correct
23 Correct 2 ms 1624 KB Output is correct
24 Correct 3 ms 2000 KB Output is correct
25 Correct 2 ms 1228 KB Output is correct
26 Correct 2 ms 1740 KB Output is correct
27 Correct 2 ms 1484 KB Output is correct
28 Correct 2 ms 1740 KB Output is correct
29 Correct 2 ms 1484 KB Output is correct
30 Correct 2 ms 1228 KB Output is correct
31 Correct 2 ms 1356 KB Output is correct
32 Correct 2 ms 1228 KB Output is correct
33 Correct 3 ms 1612 KB Output is correct
34 Correct 6 ms 1740 KB Output is correct
35 Correct 8 ms 2636 KB Output is correct
36 Correct 3 ms 2124 KB Output is correct
37 Correct 7 ms 2784 KB Output is correct
38 Correct 11 ms 2892 KB Output is correct
39 Correct 11 ms 2892 KB Output is correct
40 Correct 13 ms 2848 KB Output is correct
41 Correct 10 ms 2880 KB Output is correct
42 Correct 6 ms 2124 KB Output is correct
43 Correct 6 ms 1868 KB Output is correct
44 Correct 8 ms 1612 KB Output is correct
45 Correct 10 ms 2876 KB Output is correct
46 Correct 11 ms 2764 KB Output is correct
47 Correct 21 ms 5324 KB Output is correct
48 Correct 7 ms 1680 KB Output is correct
49 Correct 7 ms 1740 KB Output is correct
50 Correct 5 ms 1612 KB Output is correct
51 Correct 38 ms 6404 KB Output is correct
52 Correct 35 ms 7008 KB Output is correct
53 Correct 15 ms 2632 KB Output is correct
54 Correct 3 ms 1356 KB Output is correct
55 Correct 3 ms 1484 KB Output is correct
56 Correct 15 ms 2748 KB Output is correct
57 Correct 29 ms 2884 KB Output is correct
58 Correct 9 ms 2124 KB Output is correct
59 Correct 12 ms 3020 KB Output is correct
60 Correct 11 ms 5284 KB Output is correct
61 Correct 11 ms 3604 KB Output is correct
62 Correct 15 ms 5452 KB Output is correct
63 Correct 29 ms 3028 KB Output is correct
64 Correct 30 ms 3024 KB Output is correct
65 Correct 40 ms 5648 KB Output is correct
66 Correct 74 ms 9748 KB Output is correct
67 Correct 70 ms 9804 KB Output is correct