oj.uz

Submission #332805

# Submission time Handle Problem Language Result Execution time Memory
332805 2020-12-03T12:20:51 Z AmineWeslati Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 2024 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;
    vi adj[N];
    int B[M];
    FOR(j,0,M){
    	int s,p; cin>>s>>p;
    	B[j]=s;
		adj[s].pb(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 p: adj[u]) 
			FOR(v,0,N) if(abs(u-v)%p==0 && vis[u]+abs(u-v)/p < vis[v]){
				vis[v]=vis[u]+abs(u-v)/p;
				q.push({vis[v],v});
			}
	}
	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
*/

Compilation message

skyscraper.cpp:4: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    4 | #pragma GCC optimization ("O3")
      | 
skyscraper.cpp:5: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
    5 | #pragma GCC optimization ("unroll-loops")
      |

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 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 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 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 8 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 30 ms 492 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 9 ms 492 KB Output is correct
24 Correct 21 ms 492 KB Output is correct
25 Correct 23 ms 492 KB Output is correct
26 Correct 28 ms 620 KB Output is correct
27 Correct 27 ms 492 KB Output is correct
28 Correct 27 ms 492 KB Output is correct
29 Correct 11 ms 620 KB Output is correct
30 Correct 4 ms 492 KB Output is correct
31 Correct 9 ms 492 KB Output is correct
32 Correct 7 ms 492 KB Output is correct
33 Correct 27 ms 620 KB Output is correct
34 Correct 27 ms 620 KB Output is correct

Subtask #4
21.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 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 8 ms 492 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 28 ms 492 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 9 ms 492 KB Output is correct
24 Correct 21 ms 492 KB Output is correct
25 Correct 23 ms 492 KB Output is correct
26 Correct 28 ms 364 KB Output is correct
27 Correct 28 ms 364 KB Output is correct
28 Correct 23 ms 492 KB Output is correct
29 Correct 11 ms 620 KB Output is correct
30 Correct 4 ms 492 KB Output is correct
31 Correct 9 ms 492 KB Output is correct
32 Correct 7 ms 492 KB Output is correct
33 Correct 27 ms 620 KB Output is correct
34 Correct 27 ms 620 KB Output is correct
35 Correct 202 ms 748 KB Output is correct
36 Correct 31 ms 492 KB Output is correct
37 Correct 217 ms 876 KB Output is correct
38 Correct 331 ms 876 KB Output is correct
39 Correct 329 ms 876 KB Output is correct
40 Correct 327 ms 876 KB Output is correct
41 Correct 330 ms 876 KB Output is correct
42 Correct 433 ms 748 KB Output is correct
43 Correct 411 ms 876 KB Output is correct
44 Correct 416 ms 748 KB Output is correct
45 Correct 346 ms 876 KB Output is correct
46 Correct 346 ms 876 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 0 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 0 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 364 KB Output is correct
12 Correct 2 ms 364 KB Output is correct
13 Correct 2 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 9 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 29 ms 492 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 9 ms 364 KB Output is correct
24 Correct 21 ms 492 KB Output is correct
25 Correct 23 ms 620 KB Output is correct
26 Correct 28 ms 492 KB Output is correct
27 Correct 27 ms 364 KB Output is correct
28 Correct 23 ms 492 KB Output is correct
29 Correct 11 ms 620 KB Output is correct
30 Correct 3 ms 492 KB Output is correct
31 Correct 9 ms 492 KB Output is correct
32 Correct 7 ms 492 KB Output is correct
33 Correct 27 ms 620 KB Output is correct
34 Correct 27 ms 620 KB Output is correct
35 Correct 202 ms 748 KB Output is correct
36 Correct 29 ms 492 KB Output is correct
37 Correct 212 ms 876 KB Output is correct
38 Correct 328 ms 876 KB Output is correct
39 Correct 340 ms 876 KB Output is correct
40 Correct 329 ms 876 KB Output is correct
41 Correct 337 ms 1004 KB Output is correct
42 Correct 415 ms 748 KB Output is correct
43 Correct 414 ms 876 KB Output is correct
44 Correct 417 ms 748 KB Output is correct
45 Correct 348 ms 1004 KB Output is correct
46 Correct 350 ms 876 KB Output is correct
47 Execution timed out 1046 ms 2024 KB Time limit exceeded
48 Halted 0 ms 0 KB -