oj.uz

Submission #332795

# Submission time Handle Problem Language Result Execution time Memory
332795 2020-12-03T11:52:27 Z AmineWeslati Jakarta Skyscrapers (APIO15_skyscraper) C++14
36 / 100
 423 ms 262148 KB 
//Never stop trying
/*#pragma GCC target ("avx2")
#pragma GCC optimize ("Ofast")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")*/
#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 double db;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
typedef vector<str> vs;
typedef vector<ld> vd;
#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 = 1e9;
const int MX = 2e5 + 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
}

int main() {
    boost; IO();

    int N,M; cin>>N>>M;
    vpi adj[N];
    int B[M];
    FOR(j,0,M){
    	int s,p; cin>>s>>p;
    	B[j]=s;
    	FOR(i,0,N) if((abs(s-i))%p==0){
    		adj[s].pb({i,abs(s-i)/p});
		}
	}

	int vis[N]; fill(vis,vis+N,INF);
	vis[B[0]]=0;
	priority_queue<pi,vpi,greater<pi>> q; q.push({0,B[0]});

	while(!q.empty()){
		int u=q.top().se,d=q.top().fi;
		q.pop();
		if(d>vis[u]) continue;
		for(auto v: adj[u]) if(vis[u]+v.se < vis[v.fi]){
			vis[v.fi]=vis[u]+v.se;
			q.push({vis[v.fi],v.fi});
		}
	}
	if(vis[B[1]]==INF) cout << -1 << endl;
	else cout << vis[B[1]] << endl;

    

    return 0;
}

/* Careful!!!
    .Array bounds
    .Infinite loops
    .Uninitialized variables / empty containers
    .Multisets are shit

   Some insights:
    .Binary search
    .Graph representation
    .Write brute force code
    .Change your approach
*/

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 6 ms 2536 KB Output is correct
13 Correct 5 ms 2544 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 9 ms 620 KB Output is correct
18 Correct 10 ms 492 KB Output is correct
19 Correct 7 ms 492 KB Output is correct
20 Correct 70 ms 32492 KB Output is correct
21 Correct 4 ms 364 KB Output is correct
22 Correct 8 ms 492 KB Output is correct
23 Correct 11 ms 492 KB Output is correct
24 Correct 21 ms 620 KB Output is correct
25 Correct 24 ms 620 KB Output is correct
26 Correct 78 ms 33464 KB Output is correct
27 Correct 76 ms 33516 KB Output is correct
28 Correct 24 ms 748 KB Output is correct
29 Correct 13 ms 1260 KB Output is correct
30 Correct 4 ms 748 KB Output is correct
31 Correct 9 ms 876 KB Output is correct
32 Correct 8 ms 748 KB Output is correct
33 Correct 29 ms 1900 KB Output is correct
34 Correct 29 ms 1900 KB Output is correct

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 492 KB Output is correct
12 Correct 5 ms 2536 KB Output is correct
13 Correct 5 ms 2544 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 9 ms 620 KB Output is correct
18 Correct 10 ms 492 KB Output is correct
19 Correct 7 ms 492 KB Output is correct
20 Correct 69 ms 32492 KB Output is correct
21 Correct 4 ms 404 KB Output is correct
22 Correct 8 ms 492 KB Output is correct
23 Correct 10 ms 492 KB Output is correct
24 Correct 21 ms 620 KB Output is correct
25 Correct 23 ms 620 KB Output is correct
26 Correct 80 ms 33464 KB Output is correct
27 Correct 77 ms 33512 KB Output is correct
28 Correct 23 ms 748 KB Output is correct
29 Correct 12 ms 1260 KB Output is correct
30 Correct 4 ms 748 KB Output is correct
31 Correct 9 ms 876 KB Output is correct
32 Correct 8 ms 748 KB Output is correct
33 Correct 29 ms 1900 KB Output is correct
34 Correct 30 ms 2028 KB Output is correct
35 Correct 209 ms 2668 KB Output is correct
36 Correct 30 ms 768 KB Output is correct
37 Correct 213 ms 4204 KB Output is correct
38 Correct 335 ms 3948 KB Output is correct
39 Correct 332 ms 3948 KB Output is correct
40 Correct 337 ms 4088 KB Output is correct
41 Correct 335 ms 3820 KB Output is correct
42 Runtime error 423 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 380 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 2 ms 620 KB Output is correct
12 Correct 5 ms 2536 KB Output is correct
13 Correct 5 ms 2544 KB Output is correct
14 Correct 2 ms 492 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 2 ms 364 KB Output is correct
17 Correct 9 ms 620 KB Output is correct
18 Correct 10 ms 492 KB Output is correct
19 Correct 7 ms 492 KB Output is correct
20 Correct 68 ms 32492 KB Output is correct
21 Correct 3 ms 364 KB Output is correct
22 Correct 8 ms 492 KB Output is correct
23 Correct 9 ms 492 KB Output is correct
24 Correct 21 ms 620 KB Output is correct
25 Correct 23 ms 620 KB Output is correct
26 Correct 80 ms 33464 KB Output is correct
27 Correct 77 ms 33512 KB Output is correct
28 Correct 24 ms 748 KB Output is correct
29 Correct 12 ms 1260 KB Output is correct
30 Correct 4 ms 748 KB Output is correct
31 Correct 9 ms 876 KB Output is correct
32 Correct 8 ms 748 KB Output is correct
33 Correct 29 ms 1900 KB Output is correct
34 Correct 30 ms 1900 KB Output is correct
35 Correct 209 ms 2668 KB Output is correct
36 Correct 30 ms 768 KB Output is correct
37 Correct 214 ms 4204 KB Output is correct
38 Correct 332 ms 3820 KB Output is correct
39 Correct 335 ms 4000 KB Output is correct
40 Correct 331 ms 3820 KB Output is correct
41 Correct 346 ms 3968 KB Output is correct
42 Runtime error 417 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
43 Halted 0 ms 0 KB -