oj.uz

Submission #352457

# Submission time Handle Problem Language Result Execution time Memory
352457 2021-01-20T21:29:47 Z AmineWeslati Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 618 ms 262148 KB 
//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)

const int MOD = 1e9 + 7; //998244353
const ll INF = 2e9;
const int MX = 3e4 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up

template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))

mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
    return a + rng() % (b - a + 1);
}
#ifndef LOCAL  
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl; 
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;

void IO() {
#ifdef LOCAL
    freopen("input.txt", "r", stdin); 
    freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////

const int mxP=80;
int N,M; 
vi pos(MX),vec[MX],P(MX);

V<pair<pi,int>> adj[MX][mxP+1];

int main() {
    boost; IO();

    cin>>N>>M;
    FOR(i,0,M){
    	cin>>pos[i]>>P[i];
    	if(P[i]<=mxP) vec[pos[i]].pb(P[i]);
	}

	FOR(i,0,N){
		FOR(j,0,mxP+1){
			if(i+j<N){
				adj[i][j].pb({{i+j,j},1});
				adj[i][j].pb({{i+j,0},1});
			}
			if(i-j>=0){
				adj[i][j].pb({{i-j,j},1});
				adj[i][j].pb({{i-j,0},1});
			}
		}

		for(auto j: vec[i]) adj[i][0].pb({{i,j},0});
	}
	FOR(i,0,M) if(P[i]>mxP){
		int x=pos[i],jump=0;
		while(x+P[i]*(jump+1)<N){
			jump++;
			adj[x][0].pb({{x+P[i]*jump,0},jump});
		}
		jump=0;
		while(x-P[i]*(jump+1)>=0){
			jump++;
			adj[x][0].pb({{x-P[i]*jump,0},jump});
		}
	}


	priority_queue<pair<int,pi>,V<pair<int,pi>>,greater<pair<int,pi>>>q;
	q.push({0,{pos[0],0}});
	int dist[N][mxP+1]; FOR(i,0,N) FOR(j,0,mxP+1) dist[i][j]=INF;
	dist[pos[0]][0]=0;

	while(!q.empty()){
		int u=q.top().se.fi,p=q.top().se.se,d=q.top().fi;
		q.pop();
		if(dist[u][p]<d) continue;
		for(auto it: adj[u][p]){
			int v=it.fi.fi,pp=it.fi.se,w=it.se;
			if(dist[v][pp]>d+w){
				dist[v][pp]=d+w;
				q.push({dist[v][pp],{v,pp}});
			}
		}
	}

	int ans=dist[pos[1]][0];
	if(ans==INF) ans=-1;
	cout << ans << endl;

    

    return 0;
}

/*
(pos,power)-->(pos+-power,power) (<=sqrt(N))
(pos,power)-->(pos+-power,0) (<=sqrt(N))
(pos,0)--> (pos,power) (all powers in that pos) (<=sqrt(N))
(pos,0)-->(nw_pos,0) (>sqrt(N))
*/
//Change your approach

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 58348 KB Output is correct
2 Correct 40 ms 58348 KB Output is correct
3 Correct 39 ms 58348 KB Output is correct
4 Correct 40 ms 58368 KB Output is correct
5 Correct 39 ms 58348 KB Output is correct
6 Correct 39 ms 58348 KB Output is correct
7 Correct 40 ms 58348 KB Output is correct
8 Correct 40 ms 58348 KB Output is correct
9 Correct 40 ms 58476 KB Output is correct
10 Correct 41 ms 58732 KB Output is correct
11 Correct 42 ms 58988 KB Output is correct
12 Correct 41 ms 58732 KB Output is correct
13 Correct 43 ms 58732 KB Output is correct
14 Correct 42 ms 58732 KB Output is correct
15 Correct 42 ms 58732 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 58348 KB Output is correct
2 Correct 39 ms 58368 KB Output is correct
3 Correct 40 ms 58348 KB Output is correct
4 Correct 44 ms 58348 KB Output is correct
5 Correct 40 ms 58348 KB Output is correct
6 Correct 40 ms 58348 KB Output is correct
7 Correct 40 ms 58476 KB Output is correct
8 Correct 40 ms 58348 KB Output is correct
9 Correct 40 ms 58476 KB Output is correct
10 Correct 41 ms 58732 KB Output is correct
11 Correct 42 ms 58732 KB Output is correct
12 Correct 42 ms 58732 KB Output is correct
13 Correct 40 ms 58732 KB Output is correct
14 Correct 42 ms 58732 KB Output is correct
15 Correct 43 ms 58732 KB Output is correct
16 Correct 42 ms 59244 KB Output is correct
17 Correct 52 ms 62316 KB Output is correct
18 Correct 65 ms 67644 KB Output is correct
19 Correct 65 ms 68972 KB Output is correct
20 Correct 65 ms 69100 KB Output is correct
21 Correct 46 ms 60268 KB Output is correct
22 Correct 62 ms 67820 KB Output is correct
23 Correct 60 ms 66796 KB Output is correct
24 Correct 66 ms 68588 KB Output is correct
25 Correct 65 ms 69100 KB Output is correct
26 Correct 66 ms 69100 KB Output is correct
27 Correct 66 ms 68972 KB Output is correct
28 Correct 69 ms 69120 KB Output is correct
29 Correct 79 ms 68972 KB Output is correct
30 Correct 77 ms 68972 KB Output is correct
31 Correct 72 ms 68972 KB Output is correct
32 Correct 71 ms 68972 KB Output is correct
33 Correct 95 ms 69228 KB Output is correct
34 Correct 92 ms 69100 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 58348 KB Output is correct
2 Correct 40 ms 58348 KB Output is correct
3 Correct 41 ms 58348 KB Output is correct
4 Correct 40 ms 58348 KB Output is correct
5 Correct 40 ms 58348 KB Output is correct
6 Correct 40 ms 58348 KB Output is correct
7 Correct 40 ms 58348 KB Output is correct
8 Correct 40 ms 58348 KB Output is correct
9 Correct 40 ms 58476 KB Output is correct
10 Correct 41 ms 58732 KB Output is correct
11 Correct 42 ms 58732 KB Output is correct
12 Correct 42 ms 58732 KB Output is correct
13 Correct 41 ms 58732 KB Output is correct
14 Correct 42 ms 58732 KB Output is correct
15 Correct 42 ms 58732 KB Output is correct
16 Correct 42 ms 59244 KB Output is correct
17 Correct 52 ms 62316 KB Output is correct
18 Correct 70 ms 67692 KB Output is correct
19 Correct 64 ms 68972 KB Output is correct
20 Correct 65 ms 69228 KB Output is correct
21 Correct 44 ms 60268 KB Output is correct
22 Correct 61 ms 67820 KB Output is correct
23 Correct 62 ms 66796 KB Output is correct
24 Correct 67 ms 68588 KB Output is correct
25 Correct 67 ms 69100 KB Output is correct
26 Correct 67 ms 69100 KB Output is correct
27 Correct 67 ms 69100 KB Output is correct
28 Correct 70 ms 69228 KB Output is correct
29 Correct 79 ms 68972 KB Output is correct
30 Correct 74 ms 68920 KB Output is correct
31 Correct 74 ms 68972 KB Output is correct
32 Correct 71 ms 68972 KB Output is correct
33 Correct 91 ms 69240 KB Output is correct
34 Correct 95 ms 69100 KB Output is correct
35 Correct 77 ms 66796 KB Output is correct
36 Correct 58 ms 64236 KB Output is correct
37 Correct 98 ms 70592 KB Output is correct
38 Correct 97 ms 70764 KB Output is correct
39 Correct 95 ms 70636 KB Output is correct
40 Correct 98 ms 70764 KB Output is correct
41 Correct 97 ms 70636 KB Output is correct
42 Correct 72 ms 69480 KB Output is correct
43 Correct 70 ms 69356 KB Output is correct
44 Correct 70 ms 69612 KB Output is correct
45 Correct 113 ms 75244 KB Output is correct
46 Correct 114 ms 74860 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 40 ms 58348 KB Output is correct
2 Correct 39 ms 58348 KB Output is correct
3 Correct 39 ms 58348 KB Output is correct
4 Correct 39 ms 58348 KB Output is correct
5 Correct 39 ms 58348 KB Output is correct
6 Correct 40 ms 58348 KB Output is correct
7 Correct 40 ms 58348 KB Output is correct
8 Correct 40 ms 58348 KB Output is correct
9 Correct 40 ms 58476 KB Output is correct
10 Correct 41 ms 58732 KB Output is correct
11 Correct 42 ms 58732 KB Output is correct
12 Correct 43 ms 58732 KB Output is correct
13 Correct 41 ms 58860 KB Output is correct
14 Correct 42 ms 58732 KB Output is correct
15 Correct 42 ms 58860 KB Output is correct
16 Correct 44 ms 59244 KB Output is correct
17 Correct 52 ms 62316 KB Output is correct
18 Correct 62 ms 67692 KB Output is correct
19 Correct 66 ms 68972 KB Output is correct
20 Correct 66 ms 69100 KB Output is correct
21 Correct 44 ms 60396 KB Output is correct
22 Correct 71 ms 67948 KB Output is correct
23 Correct 61 ms 66796 KB Output is correct
24 Correct 67 ms 68716 KB Output is correct
25 Correct 67 ms 69100 KB Output is correct
26 Correct 66 ms 68972 KB Output is correct
27 Correct 66 ms 68972 KB Output is correct
28 Correct 69 ms 69080 KB Output is correct
29 Correct 81 ms 68972 KB Output is correct
30 Correct 76 ms 69100 KB Output is correct
31 Correct 72 ms 68972 KB Output is correct
32 Correct 70 ms 68972 KB Output is correct
33 Correct 92 ms 69100 KB Output is correct
34 Correct 92 ms 69100 KB Output is correct
35 Correct 77 ms 66796 KB Output is correct
36 Correct 56 ms 64236 KB Output is correct
37 Correct 99 ms 70636 KB Output is correct
38 Correct 97 ms 70636 KB Output is correct
39 Correct 96 ms 70636 KB Output is correct
40 Correct 96 ms 70764 KB Output is correct
41 Correct 96 ms 70636 KB Output is correct
42 Correct 71 ms 69492 KB Output is correct
43 Correct 70 ms 69356 KB Output is correct
44 Correct 73 ms 69720 KB Output is correct
45 Correct 116 ms 75176 KB Output is correct
46 Correct 112 ms 74732 KB Output is correct
47 Correct 371 ms 133164 KB Output is correct
48 Correct 345 ms 186220 KB Output is correct
49 Correct 372 ms 197484 KB Output is correct
50 Correct 397 ms 210796 KB Output is correct
51 Correct 519 ms 224508 KB Output is correct
52 Correct 526 ms 224812 KB Output is correct
53 Correct 437 ms 220636 KB Output is correct
54 Correct 414 ms 219940 KB Output is correct
55 Correct 416 ms 219884 KB Output is correct
56 Correct 429 ms 222572 KB Output is correct
57 Correct 618 ms 220116 KB Output is correct
58 Correct 435 ms 220456 KB Output is correct
59 Correct 454 ms 220520 KB Output is correct
60 Correct 454 ms 221420 KB Output is correct
61 Correct 446 ms 220904 KB Output is correct
62 Correct 522 ms 225320 KB Output is correct
63 Correct 515 ms 255908 KB Output is correct
64 Runtime error 416 ms 262148 KB Execution killed with signal 9
65 Halted 0 ms 0 KB -