oj.uz

Submission #249972

# Submission time Handle Problem Language Result Execution time Memory
249972 2020-07-16T16:00:37 Z Evirir Jakarta Skyscrapers (APIO15_skyscraper) C++17
57 / 100
 362 ms 262144 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define watch(x) cout<<(#x)<<"="<<(x)<<'\n'
#define mset(d,val) memset(d,val,sizeof(d))
#define setp(x) cout<<fixed<<setprecision(x)
#define forn(i,a,b) for(int i=(a);i<(b);i++)
#define fore(i,a,b) for(int i=(a);i<=(b);i++)
#define pb push_back
#define F first
#define S second
#define pqueue priority_queue
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll,ll> ii;
typedef pair<ll,ii> iii;
typedef vector<ll> vi;
typedef vector<ii> vii;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> pbds;
void amin(ll &a, ll b){ a=min(a,b); }
void amax(ll &a, ll b){ a=max(a,b); }
void YES(){cout<<"YES\n";} void NO(){cout<<"NO\n";}
void SD(int t=0){ cout<<"PASSED "<<t<<endl; }
const ll INF = ll(1e18);
const int MOD = 998244353;

const bool DEBUG = 0;
const int MAXN = 30005;
const int MAXP = 2005;
const int MAXM = 30005;
const int LIM = 800;

int n,m;
int a[MAXM],p[MAXM];
vi v[MAXN];
ll dist[MAXN][LIM];

priority_queue<iii,vector<iii>,greater<iii>> q;
void add(ll x, ll y, ll w, ll d)
{
	if(x<0 || x>=n) return;
	if(dist[x][y]>d+w){
		dist[x][y]=d+w;
		q.push({dist[x][y],{x,y}});
	}
}

void dijkstra(ii src)
{
	dist[src.F][src.S]=0;
	q.push({0,src});
	
	while(!q.empty())
	{
		ii u=q.top().S; q.pop();
		if(u.S)
		{
			if(u.S>=LIM){
				for(int i=u.F%u.S;i<n;i+=u.S){
					add(i, 0, abs(i-u.F)/u.S, dist[u.F][u.S]);
				}
			}
			else{
				add(u.F-u.S, u.S, 1, dist[u.F][u.S]);
				add(u.F+u.S, u.S, 1, dist[u.F][u.S]);
				add(u.F, 0, 0, dist[u.F][u.S]);
			}
		}
		else
		{
			for(int P: v[u.F])
			{
				add(u.F, P, 0, dist[u.F][u.S]);
			}
		}
	}
}

int main()
{
	ios_base::sync_with_stdio(0); cin.tie(0);
	
	cin>>n>>m;
	forn(i,0,m){
		cin>>a[i]>>p[i];
		v[a[i]].pb(p[i]);
	}
	
	forn(i,0,n) forn(j,0,MAXP) dist[i][j]=INF;
	dijkstra({a[0],0});
	
	if(dist[a[1]][0]<INF) cout<<dist[a[1]][0]<<'\n';
	else cout<<-1<<'\n';
	
	return 0;
}

Compilation message

skyscraper.cpp: In function 'int main()':
skyscraper.cpp:94:39: warning: iteration 800 invokes undefined behavior [-Waggressive-loop-optimizations]
  forn(i,0,n) forn(j,0,MAXP) dist[i][j]=INF;
                             ~~~~~~~~~~^~~~
skyscraper.cpp:10:36: note: within this loop
 #define forn(i,a,b) for(int i=(a);i<(b);i++)
                                    ^
skyscraper.cpp:94:14: note: in expansion of macro 'forn'
  forn(i,0,n) forn(j,0,MAXP) dist[i][j]=INF;
              ^~~~
skyscraper.cpp: In function 'void dijkstra(ii)':
skyscraper.cpp:65:9: warning: array subscript is above array bounds [-Warray-bounds]
      add(i, 0, abs(i-u.F)/u.S, dist[u.F][u.S]);
      ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1408 KB Output is correct
10 Correct 2 ms 1664 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 1 ms 1792 KB Output is correct
14 Correct 2 ms 1792 KB Output is correct
15 Correct 2 ms 1792 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Correct 1 ms 1408 KB Output is correct
10 Correct 1 ms 1664 KB Output is correct
11 Correct 3 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 2 ms 1792 KB Output is correct
14 Correct 3 ms 1792 KB Output is correct
15 Correct 2 ms 1792 KB Output is correct
16 Correct 3 ms 2304 KB Output is correct
17 Correct 6 ms 5888 KB Output is correct
18 Correct 7 ms 12032 KB Output is correct
19 Correct 13 ms 13568 KB Output is correct
20 Correct 13 ms 13696 KB Output is correct
21 Correct 2 ms 3584 KB Output is correct
22 Correct 11 ms 12288 KB Output is correct
23 Correct 8 ms 11136 KB Output is correct
24 Correct 13 ms 13056 KB Output is correct
25 Correct 9 ms 13696 KB Output is correct
26 Correct 8 ms 13696 KB Output is correct
27 Correct 8 ms 13696 KB Output is correct
28 Correct 10 ms 13696 KB Output is correct
29 Correct 15 ms 13696 KB Output is correct
30 Correct 10 ms 13568 KB Output is correct
31 Correct 12 ms 13696 KB Output is correct
32 Correct 10 ms 13568 KB Output is correct
33 Correct 26 ms 13696 KB Output is correct
34 Correct 24 ms 13696 KB Output is correct

Subtask #4
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1408 KB Output is correct
10 Correct 1 ms 1664 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 2 ms 1792 KB Output is correct
13 Correct 2 ms 1792 KB Output is correct
14 Correct 3 ms 1792 KB Output is correct
15 Correct 2 ms 1792 KB Output is correct
16 Correct 2 ms 2304 KB Output is correct
17 Correct 6 ms 5888 KB Output is correct
18 Correct 7 ms 12032 KB Output is correct
19 Correct 8 ms 13568 KB Output is correct
20 Correct 8 ms 13696 KB Output is correct
21 Correct 3 ms 3584 KB Output is correct
22 Correct 7 ms 12288 KB Output is correct
23 Correct 7 ms 11136 KB Output is correct
24 Correct 10 ms 13056 KB Output is correct
25 Correct 9 ms 13696 KB Output is correct
26 Correct 9 ms 13696 KB Output is correct
27 Correct 10 ms 13696 KB Output is correct
28 Correct 11 ms 13696 KB Output is correct
29 Correct 16 ms 13696 KB Output is correct
30 Correct 12 ms 13568 KB Output is correct
31 Correct 13 ms 13696 KB Output is correct
32 Correct 11 ms 13568 KB Output is correct
33 Correct 24 ms 13696 KB Output is correct
34 Correct 24 ms 13696 KB Output is correct
35 Correct 29 ms 11328 KB Output is correct
36 Correct 13 ms 8064 KB Output is correct
37 Correct 48 ms 14716 KB Output is correct
38 Correct 44 ms 15348 KB Output is correct
39 Correct 45 ms 15040 KB Output is correct
40 Correct 48 ms 15032 KB Output is correct
41 Correct 45 ms 15040 KB Output is correct
42 Correct 13 ms 14336 KB Output is correct
43 Correct 13 ms 14436 KB Output is correct
44 Correct 14 ms 14372 KB Output is correct
45 Correct 100 ms 15232 KB Output is correct
46 Correct 107 ms 15360 KB Output is correct

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1024 KB Output is correct
2 Correct 1 ms 1024 KB Output is correct
3 Correct 1 ms 1152 KB Output is correct
4 Correct 1 ms 1152 KB Output is correct
5 Correct 1 ms 1152 KB Output is correct
6 Correct 1 ms 1152 KB Output is correct
7 Correct 1 ms 1152 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 1 ms 1408 KB Output is correct
10 Correct 1 ms 1664 KB Output is correct
11 Correct 2 ms 1792 KB Output is correct
12 Correct 1 ms 1792 KB Output is correct
13 Correct 1 ms 1792 KB Output is correct
14 Correct 3 ms 1792 KB Output is correct
15 Correct 2 ms 1792 KB Output is correct
16 Correct 2 ms 2304 KB Output is correct
17 Correct 6 ms 5888 KB Output is correct
18 Correct 7 ms 12032 KB Output is correct
19 Correct 8 ms 13568 KB Output is correct
20 Correct 8 ms 13696 KB Output is correct
21 Correct 2 ms 3584 KB Output is correct
22 Correct 8 ms 12288 KB Output is correct
23 Correct 8 ms 11136 KB Output is correct
24 Correct 10 ms 13056 KB Output is correct
25 Correct 9 ms 13696 KB Output is correct
26 Correct 9 ms 13696 KB Output is correct
27 Correct 9 ms 13696 KB Output is correct
28 Correct 10 ms 13696 KB Output is correct
29 Correct 15 ms 13696 KB Output is correct
30 Correct 10 ms 13568 KB Output is correct
31 Correct 12 ms 13696 KB Output is correct
32 Correct 11 ms 13568 KB Output is correct
33 Correct 24 ms 13696 KB Output is correct
34 Correct 25 ms 13696 KB Output is correct
35 Correct 30 ms 11456 KB Output is correct
36 Correct 9 ms 8152 KB Output is correct
37 Correct 48 ms 14716 KB Output is correct
38 Correct 45 ms 15348 KB Output is correct
39 Correct 45 ms 15040 KB Output is correct
40 Correct 46 ms 15040 KB Output is correct
41 Correct 44 ms 15040 KB Output is correct
42 Correct 14 ms 14336 KB Output is correct
43 Correct 18 ms 14336 KB Output is correct
44 Correct 14 ms 14372 KB Output is correct
45 Correct 101 ms 15232 KB Output is correct
46 Correct 103 ms 15232 KB Output is correct
47 Correct 217 ms 80116 KB Output is correct
48 Correct 94 ms 147320 KB Output is correct
49 Correct 94 ms 160888 KB Output is correct
50 Correct 103 ms 176504 KB Output is correct
51 Runtime error 362 ms 262144 KB Execution killed with signal 11 (could be triggered by violating memory limits)
52 Halted 0 ms 0 KB -