oj.uz

Submission #352456

# Submission time Handle Problem Language Result Execution time Memory
352456 2021-01-20T21:26:38 Z AmineWeslati Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 578 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=150;
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 72 ms 107628 KB Output is correct
2 Correct 73 ms 107628 KB Output is correct
3 Correct 73 ms 107628 KB Output is correct
4 Correct 73 ms 107756 KB Output is correct
5 Correct 76 ms 107756 KB Output is correct
6 Correct 74 ms 107756 KB Output is correct
7 Correct 72 ms 107756 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 107628 KB Output is correct
2 Correct 73 ms 107628 KB Output is correct
3 Correct 73 ms 107628 KB Output is correct
4 Correct 72 ms 107636 KB Output is correct
5 Correct 73 ms 107756 KB Output is correct
6 Correct 74 ms 107884 KB Output is correct
7 Correct 74 ms 107732 KB Output is correct
8 Correct 73 ms 107812 KB Output is correct
9 Correct 73 ms 107884 KB Output is correct
10 Correct 75 ms 108140 KB Output is correct
11 Correct 74 ms 108140 KB Output is correct
12 Correct 74 ms 108268 KB Output is correct
13 Correct 75 ms 108268 KB Output is correct
14 Correct 75 ms 108140 KB Output is correct
15 Correct 75 ms 108140 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 107628 KB Output is correct
2 Correct 73 ms 107628 KB Output is correct
3 Correct 72 ms 107628 KB Output is correct
4 Correct 73 ms 107628 KB Output is correct
5 Correct 73 ms 107756 KB Output is correct
6 Correct 72 ms 107756 KB Output is correct
7 Correct 73 ms 107756 KB Output is correct
8 Correct 77 ms 107756 KB Output is correct
9 Correct 73 ms 107884 KB Output is correct
10 Correct 75 ms 108140 KB Output is correct
11 Correct 74 ms 108268 KB Output is correct
12 Correct 74 ms 108140 KB Output is correct
13 Correct 74 ms 108140 KB Output is correct
14 Correct 75 ms 108140 KB Output is correct
15 Correct 75 ms 108268 KB Output is correct
16 Correct 76 ms 109036 KB Output is correct
17 Correct 93 ms 114540 KB Output is correct
18 Correct 112 ms 124652 KB Output is correct
19 Correct 121 ms 127212 KB Output is correct
20 Correct 118 ms 127340 KB Output is correct
21 Correct 84 ms 110956 KB Output is correct
22 Correct 112 ms 124908 KB Output is correct
23 Correct 110 ms 123116 KB Output is correct
24 Correct 119 ms 126316 KB Output is correct
25 Correct 120 ms 127232 KB Output is correct
26 Correct 123 ms 127304 KB Output is correct
27 Correct 119 ms 127084 KB Output is correct
28 Correct 123 ms 127340 KB Output is correct
29 Correct 133 ms 127212 KB Output is correct
30 Correct 122 ms 127084 KB Output is correct
31 Correct 127 ms 127084 KB Output is correct
32 Correct 126 ms 127084 KB Output is correct
33 Correct 151 ms 127340 KB Output is correct
34 Correct 150 ms 127212 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 107628 KB Output is correct
2 Correct 73 ms 107628 KB Output is correct
3 Correct 73 ms 107628 KB Output is correct
4 Correct 76 ms 107628 KB Output is correct
5 Correct 72 ms 107756 KB Output is correct
6 Correct 73 ms 107756 KB Output is correct
7 Correct 72 ms 107756 KB Output is correct
8 Correct 74 ms 107756 KB Output is correct
9 Correct 73 ms 107884 KB Output is correct
10 Correct 73 ms 108140 KB Output is correct
11 Correct 74 ms 108140 KB Output is correct
12 Correct 74 ms 108140 KB Output is correct
13 Correct 74 ms 108140 KB Output is correct
14 Correct 75 ms 108140 KB Output is correct
15 Correct 75 ms 108140 KB Output is correct
16 Correct 76 ms 109036 KB Output is correct
17 Correct 93 ms 114668 KB Output is correct
18 Correct 112 ms 124780 KB Output is correct
19 Correct 120 ms 127084 KB Output is correct
20 Correct 119 ms 127212 KB Output is correct
21 Correct 83 ms 111084 KB Output is correct
22 Correct 115 ms 124908 KB Output is correct
23 Correct 111 ms 123116 KB Output is correct
24 Correct 121 ms 126188 KB Output is correct
25 Correct 120 ms 127212 KB Output is correct
26 Correct 120 ms 127212 KB Output is correct
27 Correct 120 ms 127084 KB Output is correct
28 Correct 123 ms 127244 KB Output is correct
29 Correct 135 ms 127212 KB Output is correct
30 Correct 123 ms 127084 KB Output is correct
31 Correct 126 ms 127084 KB Output is correct
32 Correct 125 ms 127084 KB Output is correct
33 Correct 148 ms 127340 KB Output is correct
34 Correct 150 ms 127220 KB Output is correct
35 Correct 129 ms 122220 KB Output is correct
36 Correct 102 ms 118124 KB Output is correct
37 Correct 163 ms 128108 KB Output is correct
38 Correct 159 ms 128492 KB Output is correct
39 Correct 159 ms 128492 KB Output is correct
40 Correct 160 ms 128492 KB Output is correct
41 Correct 157 ms 128492 KB Output is correct
42 Correct 124 ms 127592 KB Output is correct
43 Correct 124 ms 127592 KB Output is correct
44 Correct 123 ms 127848 KB Output is correct
45 Correct 197 ms 130628 KB Output is correct
46 Correct 199 ms 130884 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 107756 KB Output is correct
2 Correct 72 ms 107628 KB Output is correct
3 Correct 73 ms 107628 KB Output is correct
4 Correct 73 ms 107628 KB Output is correct
5 Correct 72 ms 107756 KB Output is correct
6 Correct 77 ms 107756 KB Output is correct
7 Correct 74 ms 107664 KB Output is correct
8 Correct 73 ms 107756 KB Output is correct
9 Correct 73 ms 107904 KB Output is correct
10 Correct 75 ms 108140 KB Output is correct
11 Correct 76 ms 108140 KB Output is correct
12 Correct 74 ms 108140 KB Output is correct
13 Correct 74 ms 108140 KB Output is correct
14 Correct 75 ms 108140 KB Output is correct
15 Correct 75 ms 108140 KB Output is correct
16 Correct 76 ms 109036 KB Output is correct
17 Correct 92 ms 114556 KB Output is correct
18 Correct 112 ms 124652 KB Output is correct
19 Correct 118 ms 127212 KB Output is correct
20 Correct 117 ms 127212 KB Output is correct
21 Correct 81 ms 110956 KB Output is correct
22 Correct 114 ms 124908 KB Output is correct
23 Correct 112 ms 123244 KB Output is correct
24 Correct 120 ms 126316 KB Output is correct
25 Correct 119 ms 127316 KB Output is correct
26 Correct 122 ms 127084 KB Output is correct
27 Correct 124 ms 127084 KB Output is correct
28 Correct 122 ms 127180 KB Output is correct
29 Correct 133 ms 127084 KB Output is correct
30 Correct 124 ms 127340 KB Output is correct
31 Correct 126 ms 127084 KB Output is correct
32 Correct 125 ms 127084 KB Output is correct
33 Correct 149 ms 127212 KB Output is correct
34 Correct 150 ms 127212 KB Output is correct
35 Correct 132 ms 122220 KB Output is correct
36 Correct 100 ms 118124 KB Output is correct
37 Correct 162 ms 128108 KB Output is correct
38 Correct 157 ms 128492 KB Output is correct
39 Correct 161 ms 128616 KB Output is correct
40 Correct 160 ms 128492 KB Output is correct
41 Correct 159 ms 128620 KB Output is correct
42 Correct 125 ms 127720 KB Output is correct
43 Correct 123 ms 127592 KB Output is correct
44 Correct 124 ms 127848 KB Output is correct
45 Correct 198 ms 130628 KB Output is correct
46 Correct 199 ms 130708 KB Output is correct
47 Correct 578 ms 238636 KB Output is correct
48 Runtime error 384 ms 262148 KB Execution killed with signal 9
49 Halted 0 ms 0 KB -