oj.uz

Submission #249982

# Submission time Handle Problem Language Result Execution time Memory
249982 2020-07-16T16:05:41 Z Evirir Jakarta Skyscrapers (APIO15_skyscraper) C++17
22 / 100
 43 ms 4104 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 = 30005;
const int MAXM = 30005;
const int LIM = 173;

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 173 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 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 2 ms 1280 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 5 ms 1536 KB Output is correct
12 Correct 4 ms 1536 KB Output is correct
13 Correct 2 ms 1536 KB Output is correct
14 Correct 4 ms 1536 KB Output is correct
15 Correct 4 ms 1536 KB Output is correct
16 Correct 4 ms 1536 KB Output is correct
17 Correct 13 ms 2432 KB Output is correct
18 Correct 43 ms 3704 KB Output is correct
19 Correct 26 ms 3960 KB Output is correct
20 Correct 27 ms 4096 KB Output is correct
21 Correct 7 ms 1792 KB Output is correct
22 Correct 38 ms 3704 KB Output is correct
23 Correct 28 ms 3456 KB Output is correct
24 Correct 28 ms 3960 KB Output is correct
25 Correct 28 ms 4104 KB Output is correct
26 Correct 31 ms 4052 KB Output is correct
27 Correct 41 ms 4088 KB Output is correct
28 Incorrect 28 ms 4088 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 1 ms 1280 KB Output is correct
4 Correct 1 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 1 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 2 ms 1280 KB Output is correct
9 Correct 2 ms 1408 KB Output is correct
10 Correct 3 ms 1408 KB Output is correct
11 Correct 3 ms 1536 KB Output is correct
12 Correct 3 ms 1536 KB Output is correct
13 Correct 2 ms 1536 KB Output is correct
14 Correct 4 ms 1536 KB Output is correct
15 Correct 3 ms 1536 KB Output is correct
16 Correct 4 ms 1536 KB Output is correct
17 Correct 14 ms 2432 KB Output is correct
18 Correct 25 ms 3704 KB Output is correct
19 Correct 27 ms 3960 KB Output is correct
20 Correct 28 ms 4088 KB Output is correct
21 Correct 7 ms 1920 KB Output is correct
22 Correct 23 ms 3704 KB Output is correct
23 Correct 22 ms 3448 KB Output is correct
24 Correct 38 ms 3952 KB Output is correct
25 Correct 28 ms 4088 KB Output is correct
26 Correct 27 ms 4096 KB Output is correct
27 Correct 29 ms 4088 KB Output is correct
28 Incorrect 29 ms 4096 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1280 KB Output is correct
2 Correct 1 ms 1280 KB Output is correct
3 Correct 2 ms 1280 KB Output is correct
4 Correct 2 ms 1280 KB Output is correct
5 Correct 1 ms 1280 KB Output is correct
6 Correct 2 ms 1280 KB Output is correct
7 Correct 1 ms 1280 KB Output is correct
8 Correct 1 ms 1280 KB Output is correct
9 Correct 3 ms 1408 KB Output is correct
10 Correct 2 ms 1408 KB Output is correct
11 Correct 6 ms 1536 KB Output is correct
12 Correct 3 ms 1536 KB Output is correct
13 Correct 4 ms 1536 KB Output is correct
14 Correct 4 ms 1536 KB Output is correct
15 Correct 4 ms 1536 KB Output is correct
16 Correct 3 ms 1536 KB Output is correct
17 Correct 12 ms 2432 KB Output is correct
18 Correct 24 ms 3712 KB Output is correct
19 Correct 28 ms 3960 KB Output is correct
20 Correct 28 ms 4088 KB Output is correct
21 Correct 11 ms 1792 KB Output is correct
22 Correct 25 ms 3704 KB Output is correct
23 Correct 43 ms 3556 KB Output is correct
24 Correct 31 ms 3920 KB Output is correct
25 Correct 35 ms 4088 KB Output is correct
26 Correct 34 ms 4096 KB Output is correct
27 Correct 34 ms 4096 KB Output is correct
28 Incorrect 29 ms 4096 KB Output isn't correct
29 Halted 0 ms 0 KB -