oj.uz

Submission #208714

# Submission time Handle Problem Language Result Execution time Memory
208714 2020-03-12T05:07:33 Z YJU Jakarta Skyscrapers (APIO15_skyscraper) C++14
10 / 100
 393 ms 262148 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef long double ld;
const ll MOD=1e9+7;
const ll N=2e5+5;
const ld pi=3.14159265359;
const ll INF=(1LL<<60);
#define REP(i,n) for(ll i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define pb push_back
#define mp make_pair
#define X first
#define Y second
#define setp setprecision
#define lwb lower_bound
#define SZ(a) (ll)a.size()

ll n,m,b[N],p[N],vis[N],ti,x,y,dis[N];
vector<ll> v[N];
vector<pll> ed[N];
priority_queue<pll,vector<pll>,greater<pll> > pq;

int main(){
	ios_base::sync_with_stdio(0);cin.tie(0);
	cin>>n>>m;
	REP(i,m){
		cin>>b[i]>>p[i];
		v[b[i]].pb(p[i]);
	}
	REP(i,N)sort(v[i].rbegin(),v[i].rend()),v[i].resize(unique(v[i].begin(),v[i].end())-v[i].begin());
	REP(i,n){
		++ti;
		for(ll step:v[i]){
			for(ll j=i+step,tt=1;j<n;j+=step,++tt){
				if(vis[j]==ti)continue;
				vis[j]=ti;
				ed[i].pb(mp(tt,j));
			}
			for(ll j=i-step,tt=1;j>=0;j-=step,++tt){
				if(vis[j]==ti)continue;
				vis[j]=ti;
				ed[i].pb(mp(tt,j));
			}
		}
	}
	REP(i,N)dis[i]=INF;
	pq.push(mp(0,b[0]));
	while(SZ(pq)){
		x=pq.top().Y;y=pq.top().X;pq.pop();
		if(dis[x]<y)continue;
		dis[x]=y;
		for(auto j:ed[x]){
			if(j.X+dis[x]<dis[j.Y])pq.push(mp(j.X+dis[x],j.Y));
		}
	}
	cout<<(dis[b[1]]==INF?-1:dis[b[1]])<<"\n";
	return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11256 KB Output is correct
2 Correct 12 ms 11256 KB Output is correct
3 Correct 12 ms 11256 KB Output is correct
4 Correct 12 ms 11256 KB Output is correct
5 Correct 12 ms 11260 KB Output is correct
6 Correct 12 ms 11256 KB Output is correct
7 Correct 12 ms 11256 KB Output is correct
8 Correct 12 ms 11256 KB Output is correct
9 Correct 11 ms 11256 KB Output is correct
10 Correct 12 ms 11384 KB Output is correct
11 Correct 13 ms 11640 KB Output is correct
12 Correct 13 ms 11384 KB Output is correct
13 Runtime error 393 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11384 KB Output is correct
2 Correct 12 ms 11256 KB Output is correct
3 Correct 15 ms 11256 KB Output is correct
4 Correct 12 ms 11128 KB Output is correct
5 Correct 12 ms 11256 KB Output is correct
6 Correct 12 ms 11256 KB Output is correct
7 Correct 12 ms 11384 KB Output is correct
8 Correct 12 ms 11384 KB Output is correct
9 Correct 12 ms 11384 KB Output is correct
10 Correct 13 ms 11384 KB Output is correct
11 Correct 14 ms 11640 KB Output is correct
12 Correct 12 ms 11384 KB Output is correct
13 Runtime error 389 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #4
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11384 KB Output is correct
2 Correct 12 ms 11260 KB Output is correct
3 Correct 14 ms 11384 KB Output is correct
4 Correct 11 ms 11256 KB Output is correct
5 Correct 12 ms 11256 KB Output is correct
6 Correct 12 ms 11384 KB Output is correct
7 Correct 12 ms 11256 KB Output is correct
8 Correct 13 ms 11384 KB Output is correct
9 Correct 12 ms 11384 KB Output is correct
10 Correct 12 ms 11384 KB Output is correct
11 Correct 13 ms 11640 KB Output is correct
12 Correct 12 ms 11384 KB Output is correct
13 Runtime error 385 ms 262148 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -

Subtask #5
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 11256 KB Output is correct
2 Correct 12 ms 11384 KB Output is correct
3 Correct 11 ms 11256 KB Output is correct
4 Correct 12 ms 11384 KB Output is correct
5 Correct 12 ms 11256 KB Output is correct
6 Correct 12 ms 11384 KB Output is correct
7 Correct 12 ms 11260 KB Output is correct
8 Correct 12 ms 11256 KB Output is correct
9 Correct 12 ms 11256 KB Output is correct
10 Correct 12 ms 11384 KB Output is correct
11 Correct 14 ms 11640 KB Output is correct
12 Correct 12 ms 11384 KB Output is correct
13 Runtime error 386 ms 262144 KB Execution killed with signal 9 (could be triggered by violating memory limits)
14 Halted 0 ms 0 KB -